This action might not be possible to undo. Are you sure you want to continue?
MASTER OF COMPUTER APPLICATIONS MCA – REVISED FALL 2007
Subject Code Subject Title Book id Name of the Books No. of Credits 04 No. of Books 02
First Semester MC0061 Computer Programming ―C Language‖ 1. B0678 1. Programming with C – Edition: Fall-2007 2. B0679 2. Advanced Programming in C – Edition: Fall-2007
MC0062 Digital Systems, 1. B0680 1. Digital Systems – Edition: Fall 2007 Computer Organization &Architecture 2. B0684 2. Computer Organization & Architecture- Edition: Fall 2007 MC0063 Discrete Mathematics 1. B0676 1. Discrete Mathematics – Edition: Fall 2007 2. B0677 2. Modern Applications using Discrete Mathematical Structures – Edition: Fall 2007 B0703 Basic Web Development – Edition: Fall 2007
MC0064 Basic Web Development (Internet, HTML, Style-sheets & Basics of Multimedia) MC0065 Financial Management & Accounting
Financial Management and Accounting – Edition: Fall 2007
Second Semester MC0066 OOPS using C++ 1. B0681 1. OOPS Using C++ - Edition: Fall 2007 2. B0715 2. Advanced Concepts of OOPS using C++ - Edition: Fall 2007 04 02
MC0067 Database Management 1. B0716 1. Fundamentals of DBMS – System (DBMS and Edition: Fall 2007 Oracle 9i) 2. Advanced DBMS with 2. B0717 Oracle 9i – Edition: Fall 2007 MC0068 Data Structures using C 1. B0701 1. Data Structures using C – Edition: Fall 2007 2. B0702 2. Advanced Data Structures using C – Edition: Fall 2007 B0714 System Analysis & Design with UML – Edition: Fall 2007
MC0069 System Analysis & Design (SAD) MC0070 Operating Systems with Unix
1. B0682 1. Operating Systems – Edition: Fall 2007 2. B0683 2. Advanced Operating System with UNIX – Edition: Fall 2007
Third Semester MC0071 Software Engineering 1.B0808 1. Software Engineering – Edition: Fall 2007 2.B0809 2. Advanced Software Engineering – Edition: Fall 2007 B0810 Computer Graphics – Edition: Fall 2007 System Programming – Edition: Fall 2007 Statistical & Numerical Methods using C++ – Edition: Fall 2007 04 02
MC0072 Computer Graphics
MC0073 System Programming MC0074 Statistical & Numerical Methods using C++ MC0075 Computer Networks
1.B0813 1. Computer Networks – Edition: Fall 2007 2.B0814 2. Advanced Computer Networks – Edition: Fall 2007 Fourth Semester
MC0076 Management Information Systems MC0077 Advanced Database Systems MC0078 Java Programming
Management Information Systems – Edition: Fall 2007 Advanced Database Systems – Edition: Fall 2007
04 04 04
01 01 02
1. B0831 1. Java Programming Edition: Fall 2007 2. B0832 2. Advanced Java Programming – Edition: Fall 2007
MC0079 Computer Based Optimization Methods (Statistics/Applied OR) MC0080 Analysis & Design of Algorithms
Computer Based Optimization Methods (Statistics/Applied OR) – Edition: Fall 2007 Analysis & Design of Algorithms – Edition: Fall 2007
Fifth Semester MC0081 .(Dot)Net Technologies MC0082 Theory of Computer Science B0974 (Dot)Net Technologies Edition: Fall 2007 04 04 01 02
1. B0972 1. Fundamentals of Theory of 2. B0970 Computer Science – Edition:
Fundamentals of Digital finalized Image Processing 2. Advanced Data Warehousing and Data Mining MC0089 Project 08 04 02 04 02 04 02 MC0088 Data Warehousing & Data Mining Detailed Curriculum is given on the web site (www.in).Edition: Fall 2007 2. Object Oriented Analysis & Design 2. B0959 Management and Quality Assurance . Data Warehousing and Data Mining 2. Advanced Project Management and Quality Assurance – Edition: Fall 2007 MC0085 Advanced Operating Systems (Distributed systems) B0967 Advanced Operating Systems (Distributed systems) 04 01 04 02 04 02 MC0084 Software Project Management & Quality Assurance Sixth Semester MC0086 Digital Image Processing Yet to be 1. Digital Image Processing MC0087 Internetworking with TCP/IP – do – 1.smude. Software Project 2. TCP/ IP Protocol Suite 2. B0958 1.edu. Advanced Object Oriented Analysis using UML 1. 3 .Fall 2007 2. Internetworking with TCP/IP – do – 1. Theory of Computer Science – Edition: Fall 2007 MC0083 Object Oriented Analysis & Design using UML B0969 1.
Real Constants. Unit 3: Operators and Expressions Arithmetic operators. Bitwise operators. The type char. 4 . Variables and Declarations Constants: Integer Constants. Declaring an Integer Variable. Unit 5: Input and Output operators Computer Components. Unit 2: Constants. Concept of an Integer and Variable. Formatted output. The increment and decrement operators. Relational and Logical operators. Basic structure of C programs. Interactive Programming. Character Input and Output. Mixed-mode Expressions. Unit 4: Some More Data Types Floating-point Numbers. Converting Integers to Floating-point and vice-versa. More simple C programs. The type cast Operator . Precedence of operators. Library functions. Unary operators. Character Constants. The size of operator. The Conditional operator. The gets() and puts() functions. Backslash Character Constants. The rules for naming Variables. String Constants. Assigning values to variables.Detailed Syllabus MCA SEMESTER I i) Computer Programming “C Language” (4 Credits) MC0061 Book I: Programming with C Unit 1: Introduction to C Programming Features of C. A simple C program. Formatted input.
The continue statement. Pointers and Strings. The for loop. Multidimensional Arrays. Arrays of structures. Unit 7: Control Statements The while loop. Function Philosophy. The switch statement. Pointers and one-dimensional arrays: Pointer arithmetic. Structures and Unions Basics of Pointers. Unit 11: Pointers. The if statement. Structures and functions. Similarities between Pointers and One-dimensional arrays. Recursion. Pointers as Function Arguments. External variables. Unit 8 Functions Function Basics. Book 2: Advanced Programming in C Unit 1: Pointers Basic pointer operations. The nesting of for loops. The do…while loop. Unit 10: Arrays and Strings One Dimensional Arrays. Function Prototypes. Basics of structures. Unit 9: Storage Classes Storage Classes and Visibility. Unions. 5 . Global variables. Strings. Pointers and two-dimensional arrays: Arrays of Pointers. Static variables. Automatic or local variables. Null pointers. Passing Arrays to Functions. The if-else statement. The conditional expression. Pointer Subtraction and Comparison. Nesting of if statements.Unit 6: Making Decisions in C The goto statement. The break statement.
Sorting and Reversing a Linked List. Allocating Memory with calloc. Circular Queues. Implementation of a Queue Using Linked List Representation. Command line arguments. 6 . Stack as an Abstract Data Type: Array Implementation of a Stack. Freeing Memory. Applications of Stacks. Macro Definition and Substitution: Macros with Arguments. Self-referential structures. Random access to files. Unit 3: Dynamic memory allocation and Linked list Dynamic memory allocation: Allocating Memory with malloc. Reallocating Memory Blocks. Queue as an Abstract Data Type: Array Implementation of a Queue. Arrays of structures. Deleting the Specified Node in a Singly Linked List. Unit 4: File Management Defining and opening a file. Closing files. The Concept of linked list: Inserting a node by using Recursive Programs. Unit 6: Advanced Data Representation Exploring Data Representation. Conditional Compilation. Unit 5: The Preprocessor File Inclusion. Structures and functions.Unit 2: Structures and Unions Basics of structures. Unions. Implementation of a Stack Using Linked Representation. Nesting of Macros. Pointers to structures. Abstract Data Types. Pointer Safety. Input/Output operations on files: Predefined Streams. Error handling during I/O operations. Applications of Queues.
Realization of Combinational circuits from the truth table. Hexadecimal to Octal Conversion. Binary to Octal Conversion. NOR Logic. Decimal to Octal Conversion. Repeated Multiplication. Unit 3: Combinational Logic Realization of switching functions using logic gates. Computer Organization &Architecture MC0062 Book 1: Digital Systems Unit 1: Number Systems The Decimal Number System.ii) Digital Systems. Binary Logic Functions. Sum of Weight Method. 1‘s and 2‘s Complements. NOR Gate as Universal Gate. Canonical Logic Forms: Sum of Products Form. Boolean Rules and Laws: Commutative law. Sum of Weight Method. Realization of Boolean Functions using Universal Gates. Octal to Decimal Conversion. Repeated Multiplication. Decimal to Binary Conversion: Sum of Weight Method. The Binary Numbering System: Counting in Binary. Universal Gate: NAND Gate as Universal Gate. Repeated Division Method. Octal to Binary Conversion. Distributive Law. Boolean Rules. Binary to Decimal Conversion. Complementary numbering systems. Binary Coded Decimal (BCD) Numbering system: BCD Addition. DEMORGAN‘s Theorem. Repeated Division Method. Binary Subtraction. Binary Multiplication. OR Logic. Binary subtraction using 2‘s complementary Method. Decimal to Octal Conversion. Hexadecimal to Decimal Conversion. Unit 2: Boolean Algebra Addition and Multiplication in Boolean algebra. The Hexadecimal Numbering System: Hexadecimal to Binary Conversion. Binary Division. Binary subtraction using 1‘s complementary Method. Product of Sum Form.The Octal Numbering System: Counting in Octal. Logical Gates and Truth Tables: NOT Logic. Associative Law. NAND Logic. 7 . Repeated Multiplication. Ex – NOR Logic. Repeated Division Method. Binary Arithmetic: Binary Addition. Ex – OR Logic. Timing Diagrams and Synchronous Logic. AND Logic. Binary to Hexadecimal Conversion.
Binary Subtractor: Half subtractor. Full subtractor. Prime implicant chart. Gated Latches: Gated S-R Latches. Unit 5: Analysis and Design of Combinational Logic Binary adders: Half adder. Decoders: Basic Binary Decoder. IC 7490 – A Decade Counter. Unit 6: Latches and Flip Flops Latches: The S-R Latch: Active HIGH S-R Latch (NOR gate S-R Latch). Cascading of Ripple Counter.Counters: Two bit Synchronous Binary Counters. Quine McClusky Method: Prime implicants. Multiplexers or Data Selectors. A Three-bit Synchronous Binary Upcounter. Priority Encoder: Decimal to BCD priority encoder. A Three-bit Synchronous Binary down-counter. Logic expression simplification with grouping cells. Gray code to Binary Conversion. 3 line to 8 line Decoder. Binary Comparator or Magnitude Comparator.Counters: Two bit Synchronous Binary Counters. BCD Adders. Integrated Circuit Asynchronous Ripple Counter: IC 7493 – A 4-bit Binary Counter. Octal to Binary Encoder. Negative edge triggered 2-bit ripple up/down-counter. 8 . Gray Code. Multiplexers as logic function generators. A Four-bit Synchronous Binary Up-counter. Parallel Binary Adders. Parity Generators and Parity Checkers: Parity. Detecting an Error. Code conversion: BCD to Binary conversion. Edge triggered J-K Flip-Flop (J-K FF). Full adder. Unit 7: Asynchronous Counters Asynchronous Counters: Negative edge triggered 2-bit ripple Up-counter. Active Low S-R Latch ( NAND Gate S-R Latch). Unit 8: Synchronous Counters Up. Gated D-Latch or D-flip-flop. A Four-bit Synchronous Binary down-counter. Synchronous Decade Up-counter. Design of modulus counters. Binary to Gray Conversion. Plotting a Boolean expression. Master-Slave J-K Flip Flop. Asynchronous inputs: PRESET and CLEAR. Down. Edge triggered Flip-Flops: Edge triggered S-R Flip-Flop (S-R FF). Edge triggered D-Flip-Flop (D-FF). Negative edge triggered 2-bit ripple Down-counter. Demultiplexers.Unit 4: Combination logic realization Karnaugh Map or K – Map. Encoders: Decimal to BCD encoder.
Motorola 68000 machine.Control and Status Registers. Unit 10: Data Converters Digital to Analog Converters (DAC): Binary Weighted Input Method.Unit 9: Shift Registers Shift Register Classification. Bus Structure. Parallel In. Analog to Digital Converters (ADC): Flash Type ADC. Control Unit. System interconnection. Parallel out Shift Register. Arithmetic Logic Unit. Step Recovery.Program Status Word (PSW). Serial-in. Serial Out Left Shift Operation of 74LS395. Johnson counters. Memory Unit. Parallel out Shift Register. Staircase Ramp or Digital Ramp Type. Conversion Rate or Sample Frequency. CPU organization in 8085 microprocessor. Book 2: Computer Organization & Architecture Unit 1: Basic Structure of a Digital Computer Mechanical and Electromechanical ancestors. Serial in. Serial Out Right Shift Operation of 74LS395. 74LS395 – A Universal Shift Register: Serial in. CPU Organization: Fundamental Computer Architecture. Unit 2: CPU and Register Organization Introduction: User-visible Registers. Input/Output and I/O Interface. The R-2R Ladder DAC. Structure of a computer system: Central processing Unit. Practical Considerations of ADCs: Resolution. Serial In. Serial In. Register Organization of different machine: The Zilog Z8000 machine. Serial out Shift operation – 3 register combination. Successive Approximation Method. Von Neumann Architecture. Slope Integrator Type: Single Slope Integrator Type. Intel 8086 machine. Basic instruction Cycle state diagram. Serial-out shift register: Timings in Serial Shift operation. 9 . Instruction cycles: Basic instruction cycle. Ring counters. Dual Slope Integrator Type.
Division. Binary Addition. Immediate addressing mode.Unit 3: Interconnection Structures Types of exchange of information: Modules of a System. Floating Point Numbers: Floating Point Variables. Different types of transfers. Static and dynamic memories. Real Numbers. Allocation of bits. Relative addressing mode.Other additional addressing modes. Bus Structure: Single Bus System. Instruction types. Pipelined Floating-Point Addition. Negative Integers. Displacement addressing mode. system control. Finite-Precision Ten's Complement. Bus Speed. Unit 6: Memory Unit Characteristics of Memory Systems. Unit 5: ALU and Binary Arithmetic: Arithmetic Logic Unit. Stack addressing. Register addressing mode. I/O. Register Indirect addressing mode. Instruction formats: Instruction Length. Introduction: Instruction Characteristics.The Bus Standard. Variable length instruction. Instruction representation. Main Memory:Types of Random-Access Semiconductor Memory. Base Register addressing Mode. Unsigned Integer Multiplication: Straightforward Method. Addition of Floating-Point Numbers. Rational Numbers. Elements of Bus Design: Bus Types. Organization. Types of Operands: Data types. Arithmetic. Binary Arithmetic: Overflow in Integer Arithmetic. Types of Operations: Data transfer. Types of Buses . Instruction Set Design. Infinite-Precision Ten's Complement. Finite-Precision Two's Complement. Positive Integer Multiplication. Signed Integer Multiplication. IBM 370 Data types. Number Representations: Non-negative Integers. Unit 4: Instruction sets: Addressing Modes and formats. Transfer of control. System Control. Bus width.Design of memory subsystem using 10 . Time for Floating-Point Addition. Number of addresses. Logical. Another Note on Overflow. Addressing Modes: Direct addressing mode. Multiplication. Memory system considerations:Design of memory subsystem using Static Memory Chips. Floating Point Arithmetic. Subroutines. Conversion. Stacks & Subroutines: Stacks. Unsigned Integer Multiplication: A More Efficient Method. Indirect addressing mode. Indexing. Two Bus Organization. VAX Data types. Subtraction. Bus Timing. Method of arbitration.
Dynamic Memory Chips; Memory interleaving; Cache Memory:Principles of cache memory, Structure of cache and main memory, Performance using cache memory, Elements of Cache Design, Mapping functions, Replacement algorithms; External Memory: Magnetic Disk, RAID; Virtual memory; Memory Management in Operating Systems. Unit 7: Input/Output External Devices:Classification of external devices,Input/Output problems; Input/Output Module: I/O Module Function, I/O Module Decisions, Input Output Techniques, Programmed I/O: I/O commands, I/O instructions; Interrupt Driven I/O: Basic concepts of an Interrupt, Response of CPU to an Interrupt, Design Issues, Priorities, Interrupt handling, Types of Interrupts; Direct Memory Access: DMA Function and Operation, DMA Configurations;DMA Controller: DMA Transfer Types, DMA Transfer modes, DMA Controller Operation, Advantages; Synchronization Requirements for DMA and Interrupts: Synchronization with Interrupts, Synchronization with DMA.
Unit 8: Control Unit Micro operations: Micro operations of Fetch cycle, Indirect Cycle, The execute cycle, The Instruction cycle; Control of the CPU: Functional Requirements, Control Signals, Data paths and control signals; Data Path inside A CPU: Single bus structure, Two bus structure, Three bus structure, Execution of a complete instruction, Branching; Sequencing of Control Signals: Hardwired Control Unit, Micro-Programmed Control. Unit 9: Parallel Model of Computers and Pipelining Introduction: Lookahead, Parallelism and pipelining, Flynn‘s Classification; Parallel/Vector Computers: Development Layers, New Challenges; Pipelining: Principles of Linear Pipelining, Pipeline structure of CPU, Timings of pipelining, Effect of pipelining; Basic Performance Issues in Pipelining; The Major Hurdle of Pipelining: Structural Hazards,Data Hazards, Control Hazards.
Unit 10: Advanced Processor Technology Instruction set Architecture: RISC and CISC, Characteristics of CISC, Characteristics of RISC, RISC versus CISC, Instruction set complexity- RISC versus CISC; Vector processing requirements: Characteristics of vector processing, Multiple vector task dispatching; Super scalar processors: The emergence and spread of super scalar processors, Specific task of Super scalar processing; Super Scalar instruction issue: The design space, Issue policies, Instruction issue policies of scalar processors, Instruction issue policies of superscalar processors.
iii) Discrete Mathematics
Book 1: Discrete Mathematics
Unit 1: Sets, Relations and Functions Sets; Relations; Functions; Intervals; Functions of real variables; Different functions.
Unit 2: Mathematical Induction Progressions; Principle of Mathematical Induction; Summation of series using n, n2 and n3.; Arithmetico – Geometric series (A.G.P); Summation of series by the Method of Differences and partial fractions. Unit 3: Combinatorics Principles of Counting; Generating Function; Partitions and Compositions; Orderings; Principle of Inclusion and Exclusion.
Unit 4: Recurrences and Integer Functions Recurrence Relation; Applications of Recurrences; Generating Function; Integer Functions.
Unit 5: Partially Ordered Sets and Lattices Relation Matrices; Partial Ordered Sets; Lattices; Duality; Modular and Distributive lattices. Unit 6: Semigroups, Monoids and Groups Semigroups; Monoids; Groups; Permutation Groups. Unit 7: Rings, Fields and Vector Spaces Rings and Integral domains; Fields; Vector Spaces.
Unit 8: Propositional Calculus and Logical Quantifiers Logical Inference; Propositions and Tautologies; Predicates; Logical Quantification of Propositions.
Equivalence Relations. Generator Matrices. Algebraic Systems. Functions. Arithmetical Functions. Unit 3: Formal Languages Grammars and Languages. Boolean lattices and Boolean algebras. Classification of Grammars. Classical logic and Fuzzy logic. Applications to Cryptography. Unit 7: Fuzzy Sets and Fuzzy Logic Fuzzy sets. Derivation Trees. Congruence. Linguistic variable. Languages accepted by an automation. Boolean Expressions and Normal forms. Logical circuits and applications. Algorithms. Non – Determinants Finite State Automaton (NDFSA). Unit 2: Theory of Numbers and Introduction to Cryptography Divisibility and Factorization. Method of Repeated Squares. Unit 4: Boolean Algebras and Logical Circuits Posets and Lattices. Unit 8: Graphs Preliminary Definitions and Notations. Turing Machine. Fuzzy Truth Qualifier. 14 .Book 2: Modern Applications using Discrete Mathematical Structures Unit 1: Preliminaries Sets. Parity Check. Linear Codes. Backus – Naur Form (BNF). Fuzzy Relations. Unit 6: Algebraic Codes Preliminaries. Uniqueness of finite Boolean algebras. Hamming Distance. Unit 5: Finite – State Automata Finite State Machine.
Hamiltonian Paths and Circuits. Unit 13: Directed Graphs Definitions and Examples. Partitioning. Matrix Representation of Digraphs. Euler‘s Digraphs. 15 . Binary relation as a digraph. Rooted Trees and Applications. Coloring. Coloring and Partitioning Planar and Dual Graphs.Unit 9: Trees and Algorithms Characterization of Trees. Algorithms for Spanning Trees. Unit 12: Representations of Graphs Adjacency matrix and Incidence Matrix. Spanning Trees. Unit 10: Traversability Eulerian Graphs. Algorithms for Chromatic Number. Circuit Matrix. Traveling Salesman problem. Unit 11: Planarity. Path Matrix.
How Internet Works?. Internet Service Providers: Choosing an ISP.iv) Basic Web Development (Internet. E-commerce. URLS and 16 . Roaming Facility. 3 The Network Layer. Who Cares for Internet?. Sending and Receiving messages. Network Protocols: SPX/IPX for DOS. Jini. Roles of each layer. HTML. Advantages of using star topology. The Presentation layer. XML. Resource Addressing: URL (Uniform Resource Locator). Choosing a modem. For Shell Account. Token Ring. Working of internet. Support. The Domain name system and DNS Servers. Wide Area Networks. The Physical layer. Getting Connected: Accessing the internet via your local network. Metropolitan Area Networks (MANs). Networks: Computer Networks. Interface simplicity. Class C: Addresses. Internet Applications. Major disadvantages. ADSL. OSI Model of ISO: Introduction. The seven layers in the ISO model. IP Addresses. The Transport layer. What is TCP/IP?. Conventional Dial-UP Shell Account. Mail servers. Wireless communication. Evolution of Internet. How old is the Internet?. Internet from practical and technical angle. The Session Layer. ISDN. Style-sheets & Basics of Multimedia) MC0064 (4 credits) Unit 1: Introduction to Internet What is Internet?: Definition. TCP/IP for UNIX. Classes of Networks: Class A: over 16 million Served. Point to-Point networks. FTP servers. User ID-Telephone Ratio. Data link layer. Introduction to RFC. Java. Internet Technologies. PPP and SLIP.server model : Introduction . Web Browser. Local Area Networks. Other Classes. and Leased Line Connections. Multiple Login Facility. Special Packages. Advantages and Disadvantages of LAN. Unit 2: Connecting to Internet Client. Media Access Control: Ethernet. Different Types of Connections: Dialup Connections. Class B: Larger nets. Choosing a computer. ISDN Advantages. Address in Internet: Introduction. Topologies: The Star. The Ring. Advantages of bus topology. TCP/IP Software. Subnet masks. Discounts on renewal. Protocol Dial-up (TCP/IP Account). The Bus. Owning of internet. The Application Layer. IRC servers. Cable & DSS Internet accounts. Client. From the Technical Angle. Requirements for connections. Who Owns and cares for the Internet?. Major drawbacks. Server. DialUP or On-Demand TCP/IP link through your LAN. News servers. LAN Hardware. Brochure-speak. From the practical Angle. For TCP/IP Account.
Subscripts and superscripts: the SUB and SUP Elements.. Categorizing cells. Tag: <DIR> . Preformatted text: The PRE element.. Column groups: the COLGROUP and COL elements: The COLGROUP element.Table cells: The TH and TD elements.. Tag. Tag: <MENU> .Tag: <VAR> ... Viewing the HTML Source. Table Captions: The CAPTION element...Tag: <OL> ……..</KBD>. CODE... Lines and Paragraphs: Paragraphs: the P element.... Sample table.. Quotations: The BLOCKQUOTE and Q elements.</B>. Tag: <TT> . Text Tags: Using Block-Level Elements to Structure the DOCUMENT.. Choosing Colours for Text and Links. Tag: <I> . Controlling the overall Appearance of the page: Displaying wallpaper in the Background. Tag: <STRONG> . Footer.. Horizontal and vertical alignment.Tag: <DFN> . Tag: <B> .</TT>. Attribute definitions.. <BIG> .</OL>.</STRIKE>. Tag: <U> ..Tag: <EM> . Prohibiting a line break ... Forcing a line break: the BR element ....</DL>.CITE.</ABBR> or <ACRONYM> ..</I>. Tag: <DL> . Tag: <INS> . Tag: <SAMP> .</STRONG>.Wrapping Your Content with the Body Element. Presentation Controls / Text presentation Tags...</DEL>. Cells that span several rows or columns .<IEM>.. 18 ..</ACRONYM>. Hyphenation.</SMALL>. Tag: <UL> . Cell margins.<NAR>. Unit 6: Elements of HTML Introduction. . Tag: <KBD> ....</U>. Controlling line breaks. Table formatting by visual user agents: Borders and rules. Table rows: The TR element. and TBODY elements.. HTML's Rules of Nesting. Two Categories of Body Elements.</INS>. Tag: <ABBR> . Tag: <DT>. Lists: Tag: <LI>. Using Text-Level Elements.</MENU>. Table directionality.. The COL element...</DIR>.. TFOOT.. Tag: < DD>. Row groups: the THEAD. Tag: <DEL> .</BIG>. Unit 7: Tables Introduction. Elements for constructing tables: The TABLE element.</SAMP>... Tag: <SMALL> . Tag: <STRIKE> . Introduction to tables.</DFN>..</UL>.. Table rendering by non-visual user agents: Associating header information with data cells..
Labels: The LABEL element. Controls: Control types. Use id or name. Internationalization and links. Introduction to forms. objects. The TEXTAREA element. Specifying target frame information: Setting the default target for links. Alternate content: The NOFRAMES element. Generic inclusion: the OBJECT element. Inline frames: the IFRAME element. Other link relationships. Pre-selected options. OPTGROUP Attribute definitions. Giving focus to an element: 19 . Rules for rendering objects. Notes on embedded documents. and applets: Width and height. Introduction to frames. The Select. Header style information: the STYLE element. images. Long descriptions of frames. Visual rendering of a frame . Image maps. OPTION Attribute definitions. Inline style information. Links and search engines. Adding style to HTML. Object initialization: the PARAM element. Introduction to style sheets: HTML 4 provides support for the following style sheet features. SELECT Attribute definitions. The INPUT element: Control types created with INPUT. Media types. The BUTTON element. Links and external style sheets. White space around images and objects. The A element: Nested links are illegal. and applets. Nested frame sets . Including an image: the IMG element. Setting the initial contents of a frame . Adding a Link to your Email Address. Sharing data among frames . Document relationships: the LINK element: Forward and reverse links. Setting the default style sheet language. Link titles. Introduction to links and anchors: Visiting a linked resource. Borders. The FORM element. Optgroup. Client-side image maps: the MAP and AREA elements. Adding structure to forms: the FIELDSET and LEGEND elements. Examples of forms containing INPUT controls. Unit 9: Frames and Style Sheets Introduction. Layout of frames: The FRAMESET element. Introduction to objects. Object declarations and instantiations. Alignment. Including an applet: the APPLET element. The FRAME element. Global naming schemes for objects. How to specify alternate text. and Option elements. Target semantics. Visual presentation of images.Unit 8: Links and Anchors Introduction. Anchors with the id attribute. The ISINDEX element. Unit 10: Forms Introduction. Unavailable and unidentifiable resources. Server-side image maps. Specifying anchors and links.
Desirable Features for a Multimedia System. Image/Graphics Editing. Pace and Running length. Form submission. History of Multimedia Systems. 20 . Make the Form Easy. Overview of Multimedia Software Tools: Digital Audio. Group Similar Categories. Trends in Multimedia. Processing form data. Themes and Styles. Multimedia Systems. Multimedia Multimedia Authoring. (interacting). Access keys. Scripting Graphics (illustrating). Components of a Multimedia System.Visual Design. Animation. Selling the < form > Environment. Basic Layout. Disabled controls. Issues in Multimedia Applications Design: (writing). Applications. Provide Incentives. Multimedia Authoring. Design Issues. Interactivity Technical Design.Tabbing navigation. Audio (hearing). Usability Issues. Disabled and read-only controls. an authoring system?. Content Design. Successful controls. Multimedia Why should you use Programming vs Authoring: Systems and Applications : What is an Authoring System? . Form submission method. Animation (wiggling). Determining Form Content: Information Issues. What is HyperText and HyperMedia?. What is Multimedia?: Definitions . Understanding Widgets. Creating Forms. Music Sequencing and Notation. Characteristics of a Multimedia System. Unit 11: Multimedia Introduction. Challenges for Multimedia Systems. Read-only controls . Short checking list for hardware/software requirements. Multimedia Authoring Paradigms.
Meaning of Financial Management accounting. Uses and Limitations of Ratio Analysis. Purposes of Trial Balance. Format of ledger. Components of Fund Flow statement: Computation of changes in Working Capital. Errors affecting two or more accounts. Classification of Assets and Liabilities. Suspense Account. Balance Sheet: Meaning of Balance sheet. Classification of accounts. Combined Ratios. Classification of Ratios: Traditional Classifications of ratios. Utility of journal. Ledger: Meaning and features of ledger. Classification from the View point of Users. Format of journal. Balance Sheet Ratios. Accounting conventions. Meaning and uses of financial statements: Meaning of financial statements. Classification of Errors: Introduction. Rectification of Errors: Errors affecting one account. Meaning and format of Fund Flow Statement. Errors not disclosed by Trial balance. Unit 2: Trial Balance and Rectification of Errors Introduction. Features of Trial Balance. Meaning and classification of Accounts: Meaning of accounts. Funds from operations. Trial Balance: Definition and Meaning of Trial Balance. Classification of Assets. Unit 4: Understanding Ratio Introduction. How to journalise. Meaning and objectives of Ratios. Journal: Meaning and features of journal. Purpose and objectives of financial statements.v) Financial Management & Accounting MC0065 Unit 1: Introduction to Accounting Introduction. Revenue Statement Ratios. Functional Classifications of ratios. Unit 5: Funds Flow Statement Introduction. Unit 3: Understanding Financial Statements Introduction . Errors disclosed by Trial Balance. Contents of Trial Balance. Profit and Loss Account/Income Statement. Sources and 21 . Accounting Principles: Accounting concepts. Systems of Accounting. Classification of Liabilities. General Classification of errors. Rules of debit and credit.
Uses and Limitation of cash flow statement: Uses of cash flow statement. Factors affecting Break Even Point and Margin of safety.E. Unit 7: Understanding Cost Introduction. Merits and Demerits of Budgetary Control. Meaning of cash flow statements. Uses and Limitations of Break Even Analysis. Features of cash flow statements: Information required for Cash flow statement. Steps in Budgetary Control. Preparation of Flexible Budget. Classification of Cash flows: Cash flow from operating activities.Application of Funds. Determination of total cost. Meaning. 22 . Limitations of Marginal Costing. Estimation of Cost. Cash flow from investing activities. On the basis of elements of the cost. Difference between Funds flow statement and P & L A/C.P. Unit 6: Cash Flow Analysis Introduction. Essentials and Objectives of Budgetary Control. Cash Flow Statement. Use of Fund flow statement. Assumptions. IlIustration. Difference between Funds flow statement and Balance Sheet. Break-Even Chart. Classification of Cost: On the basis of behaviour of cost. Concept of Profit and Contribution. Advantages of Marginal Costing. Overheads and Non-cost Items: Overheads . Funds Flow Statement Vs. Non cost items. Drawbacks of Fund flow statement. Basic concept of marginal costing: Meaning and Features of Marginal costing. Illustration. Cost sheet: Proforma of cost sheet. Types of Budgets. Concept of Profit/Volume Ratio. Unit 9: Budgetary Control Introduction. Classification of Overheads. Unit 8: Marginal Costing & Break-even Analysis Introduction.): Methods of calculating Break Even Point. Limitations of Cash Flow Statement. Break Even Point (B. Meaning of Budget. Cash flow from financing activities.
Material and Labour Cost Standards. Standard Costing Vs Budgetary Control. Historical Costing Vs Standard Costing. 23 . Utility and Limitations of Standard Costing.Unit 10: Standard Costing Introduction. Variance Analysis : Material Cost Variance.
Introduction to Arrays. Structures in C++. 24 . Unit 4 Functions and Structures in C++ Introduction. Unit 5: Objects and Classes Introduction. Selection control statements in C++. Overloading Unary Operators. Operator Overloading in C++. Overloading binary operators. Passing Data to Functions. Evolution of Programming methodologies. Introduction to OOP and its basic features. Basic components of a C++ Program and program structure. Break. Constructors and Destructors. Unit 6: Operator Overloading Introduction. continue and exit statements in C++. Strings and String related Library Functions. Unit 2: C++ Basic Programming Statements Introduction. Creating classes and objects. Introduction to Functions. Static variables and Functions in class. Unit 3: Arrays and Strings in C++ Introduction.SECOND SEMESTER i) OOPS using C++ MC0066 (4 Credits) Book 1: OOPS Using C++ Unit 1: Introduction to OOP and C++ Introduction. Scope and Visibility of variables in Functions. Multidimensional Arrays. Iteration statements in C++. Compiling and Executing C++ Program.
Types of Inheritance. Polymorphism. Reading a File. Some Useful Functions. Static Functions. The this Pointer. Checking the I/O Status – Flags. and Static Functions Introduction. Introduction to Polymorphism. Character and String input and output to files. Elements of the iostream Library. Manipulators. Checking for Failure with File Commands. Friend Classes. Friends. Inheritance in C++. Multiple Inheritance. Derivation and Inheritance: Derivation. Organization. Unit 2: This Pointer. Friend Scope. Unit 8: Multiple Inheritance. Basic Programming using Streams: Basic Stream Concepts. Dealing with Binary Files.Unit 7: Inheritance and Pointers Introduction. Virtual Functions. Virtual Functions. Introduction to Multiple Inheritance. 25 . Unit 3: The iostream Library Introduction. Unit 9: File Input and Output in C++ Introduction. Inheritance. Managing I/O Streams: Opening a File – Different Methods. Friends: Friend Functions. Book 2: Advanced Concepts of OOPS using C++ Unit 1: Inheritance. Introduction to Pointers. Command Line Arguments and Printer Output. and Polymorphism – Revisited Introduction. Objects and Pointers. Understanding the C++ iostream hierarchy: Standard Input/Output Stream Library. Introduction to Virtual Functions. Virtual Functions And Polymorphism Introduction. Your Very First Program.
Unit 4: Templates Introduction. Applications of Use Case Diagrams. Algorithms and Functions: Algorithms. Allocators. Unit 5 : Exception Handling Introduction. Tagged Value. Deque. STL Components. What is UML?. Function templates: Implementing function templates. Template instantiation: Class template specialization. Actor. Unit 6: Standard Template Library Introduction. Iterators.Throwing an exception. Using template functions. Exception specifications: unexpected(). set_unexpected(). Template parameters. Implementing class template member functions. Class Diagrams: Packages. Associations. Includes. Priority Queue. set_terminate(). Uncaught exceptions: terminate(). Associations. Object Diagrams. Container Caveats. Sequence Adapters: Stack. Template class partial specialization. Containers. Standard exceptions. Constraints. Using exceptions. Aggregation and Composition. Set and Multiset. Dependencies. Class templates: Implementing a class template. Collaboration Diagram. Attributes. Activity and State Diagrams: Activity Diagram. Implementation Diagrams – Component and Deployment. Functors. Sequence Diagram. Strings. Resumption. Sequence Containers: Vector. Iterators. Catching an exception: The try block. Interfaces. Generalization. Algorithms. Iterator Adapters. Extensibility Mechanisms: Stereotypes. Termination vs. Static members and variables. Operations. State Diagram. Interaction Diagrams: Instances and Messages. Associative Containers: Map and Multimap. Functions and Function Objects. Use Case Diagrams: Use Case. Generalization. Templates and friends. Exception handlers. Queue. Template function specialization. List. 26 . Rethrowing an exception. Using a class template. Extends. History. Catching any exception. Unit 7: Introduction to UML Introduction. Programming with exceptions: When to avoid exception. Classes.Templates and multiple-file projects.
ii) Database Management System (DBMS and Oracle 9i) MC0067 (4 Credits)
Book 1: Fundamentals of DBMS
Unit 1: Fundamentals of DBMS Introduction; DBMS & Approaches to Data Management; Advantages of Database Systems; Functions of a DBMS; Role of the Database Administrator; Types of Database Systems.
Unit 2: Physical Storage Structure of Databases Introduction; Physical Storage Structure; Clustering; Indexing; Hashing; Linear Search, Collision Chain. Unit 3: Introduction to Relational Model Introduction; The Relational Model; Properties of Relations; Integrity Rules; Relational Algebra Operators.
Unit 4: Database Processing Introduction; Database Architecture: Application Logic, One Tier Architectures, Two Tier Client/Server Architectures; Advantages of Database Processing: Economy of Scale, Efficient extraction of relevant Information, Sharing of Data, Balancing Conflicting Requirements, Environment of Standards, Controlled Redundancy, Consistency, Integrity, Security, Flexibility and Responsiveness, Data Independence; Three Level Architecture of a Database; Services of a Database System; Functions of Database Management Systems.
Unit 5: Relational Operators & Standards Introduction; Relational Model – a Review: Relation, Formal definition of a relation; SQL – The Relational database standard: Database Creation, Sorting, Built-in Functions, Joining Tables, Union; Relational Algebra. Unit 6: Database Design Introduction; Introduction to Database Design; E-R Modeling: Basic Constructs of E-R
Modeling, Degree of a Relationship, ER Notation; Normalization: Functional Dependence, First Normal Form, Second Normal Form, Third Normal Form, Boyce-Codd Normal Form, Multi-valued Dependencies and Fourth Normal Form; Database Design Goals. Unit 7 Database Security and Authorization
Introduction; Introduction to Database Security Issues: Types of Security, Threats to Databases, Database Security and the DBA; Access Protection, User Accounts, and Database Audits; Discretionary Access Control Based on Granting and Revoking Privileges: Types of Discretionary Privileges, Specifying Privileges Using Views,Revoking Privileges, Propagation of Privileges Using the grant option;Mandatory Access Control and Role-based Access Control or Multilevel Security: Comparing Discretionary Access Control and Mandatory Access Control, Role-Based Access Control, Access Control Policies for E-Commerce and the Web; Introduction to Statistical Database Security; Introduction to Flow Control: Covert Channels; Encryption and Public Key Infrastructures: The Data and Advanced Encryption Standards, Public Key Encryption, Digital Signatures.
Unit 8 ORDBMS and Concepts of Data Mining and Data Warehousing Introduction; The Evolution of Database Systems Technology; The Informix Universal Server; Categories of INFORMIX Universal Server; Overview of Data Mining Technology; Goals of Data Mining and Knowledge Discovery; Association Rules: Market-Basket Model, Support, and Confidence,Additional Considerations for Association Rules Classification, Clustering; Approaches to Other Data Mining Problems:Discovery of Sequential Patterns, Discovery of Patterns in Time Series, Regression, Neural Networks, Genetic Algorithms, Applications of Data Mining; Commercial Data Mining Tools; Data Warehousing: Introduction, Definitions, and Terminology, Characteristics of Data Warehouses, Data Modeling for Data Warehouses, Building a Data Warehouse, Typical Functionality of a Data Warehouse, Data Warehouse versus Views; Problems and Open Issues in Data Warehouses: Difficulties of Implementing Data Warehouses, Open Issues in Data Warehousing.
Unit 9: SQL Introduction; SQL - An Overview: Data Manipulation Language, Data Definition Language, Data Control Language; Implementation of DML Statements: Basics of the SELECT Statement, Conditional Selection, Relational Operators, More Complex Conditions: Compound Conditions / Logical Operators; In & Between; SQL Order of Logical Operations (each operates from left to right):Using LIKE ; Joins: Keys, Performing a Join, DISTINCT and Eliminating Duplicates, Aliases & In / Subqueries; Miscellaneous SQL Statements: Aggregate Functions, Views, Creating New Tables, Altering Tables, Adding Data, Deleting Data, Updating Data; Miscellaneous Topics: Indexes, Group By & Having, More Subqueries, Exists & All, UNION & Outer Joins, Cartesian product. Unit 10: Transaction Processing, Recovery and Concurrency Introduction; Transactions, Read And Write Operations; Transaction and System Concepts; Transaction and System Concepts; Recovery from System Failures; Concurrency Control Mechanism: Locking, Deadlocks.
Book 2: Advanced DBMS with Oracle 9i Unit1: Database Systems – Concepts and Architecture Data Models, Schemas, and Instances: Categories of Data Models, Schemas, Instances, and Database State; Three-Schema Architecture and Data Independence: The Three-Schema Architecture, Data Independence; Database Languages and Interfaces: dbms Languages, dbms Interfaces, The Database System Environment: dbms Component Modules, Database System Utilities, Tools, Application Environments, and Communications
Facilities; Centralized and Client/Server Architectures for dbmss : Centralized dbmss Architecture; Basic Client/Server Architectures, Two-Tier Client/Server Architectures for dbmss, Three-Tier Client/Server Architectures for Web Applications; Classification of Database Management Systems.
and EER-to-Relational Mapping Elational Database Design Using ER-To-Relational Mapping: ER. Entity Sets. Desirable Properties of Transactions. The Insert Unit 4: Relational Database Design by ER. Placing File Records on Disk: Records and Record Types. and DBMS Buffers. Entity Sets. Read and Write Operations. Magnetic Tape Storage Devices. Record Blocking and Spanned Versus 30 . Unit 5: Introduction to Transaction Processing-Concepts and Theory Transaction Processing: Transactions. Relationship sets. Mapping EER Model Constructs to Relations: Mapping of Specialization or Generalization. Weak Entity Types. Relational Model Constraints and Relational Database Schemas : Relational Databases and Relational Database Schemas. Concurrency Control Techniques: Two-phase Locking Techniques for Concurrency Control. Database Recovery Concepts: Recovery Outline and Categorization of Recovery Algorithms.Unit 2: Data Modeling Using the Entity Relationship Model Using High Level conceptual Data Models for Database Design. Commit Point of a Transaction. And Value Sets. Tuples. Characteristics of Relations. Fixed-Length Records. The Delete Operation. Attributes Of Relationship Types. Attributes. The Update Operation. Why Recovery is Needed: Commit Point of a Transaction. and Variable-Length Records. Keys. Types of locks and system lock tables . And Recursive Relationships. roles and Structural Constraints: Relationship Types. Files. Entity Types. Attributes and Keys : Entities and attributes. Buffering of Blocks. and Relations. Sets.to. Unit 3: The Relational Data Model and Relational Database Constraints Elational Model Concepts: Domains. Unit 6: Fire Organizations and Indexes Computer Storage Media: Memory Hierarchies and Storage Devices. And Instances. Relationship Degree. Initial Conceptual Design Of The COMPANY Database. Update Operations and Dealing With Constraint Vioations: Operation. Other Types of Constraints. Relationship types. Role Names.Relational Mapping Algorithm. Relational Model Notation. An example Database Application. Entity Types.
Operations on Files. File Headers. Files of UnOrdered Records (Heap Files). Allocating File Blocks on Disk. Files of Ordered Records (Sorted Files).Unspanned Records. Hashing Techniques: Internal Hashing. Other Types of Indexes. Indexing Structures for Files: Types of Single-level Ordered Indexes. 31 .
Data Types and Structured Data Type: Common structure.Insert / Push operation. Operations of Stack. The Abstract Level. Pre and Post Conditions: Preconditions. Non Linear Data Structures: Trees.Two Dimensional Arrays. Display. Stack implementation using arrays. Unit 4: Overview of Queues Introduction. Programming with Abstract Data Types. Structure used with an Array. Applications of stack. Implementation Level. Circular queue. Double ended queue (Deque). Sample C programs to represents the Queue Implementation. Structures. Pointers and Arrays.iii) Data Structures using C MC0068 (4 Credits) Book 1: Data Structures using C Unit 1: Arrays. Pointers used in an Array. Stacks using structures. The Application Level. Binary Tree. Implementation Checks Preconditions. Single – Dimensional Arrays (One Dimensional Array). Properties of Abstract Data Types. Checking Pre & Post Conditions. Disadvantage of ordinary queue. Sample C programs to represents the Stack Implementation. Declaring a pointer variable. Initialization of structure. Pointers used in function. Definition of data structure. Definition and concept of an Array: Array Used in „C‟ Language. Postconditions. Queues and its Operations. Using an Array and Lists as a Data Structure. Delete/pop operation. Different types of queues: Ordinary queue. Hash Tables. What the application needs ?.:Pointer Operators. Implementation methods. Abstract Data Types. Structures: Declaration of Processing of Structure. [Matrix]. Linear Data Structure: The Array Data Structure. Unit 2 Overview of Data Structures Introduction: What is a Data Structure?. 32 . Generic Abstract Data Types. Elementary Data Structures. Unit 3: Overview of Stack Introduction. Pointers and Structures Introduction. Pointers.
Unit 5: Linked Lists Introduction. How do you sort?. Binary tree: Strictly binary tree. Searching. Almost complete binary tree. Count leaves in a tree. To find minimum value in a BST. Delete a node from the rear end. Linear list. Adjacency Matrix. Shell Sort. Linked list: Typical basic linked-list operations. Unit 7: Graphs Introduction. Traversals. Overview of Tree Concept. Breadth – First Traversal. To find maximum value in a tree BST. External Sorts: Merge Sort. Binary search tree (BST): Insertion Operation. Internal Sorting: Insertion Sort. Complete binary tree. 33 . Delete a node from the front end. Unit 9: Sorting Methods Introduction. Evaluating a Sorting Algorithms: Stability on Sorting algorithm. Depth – First Traversal. Count nodes in a tree. Unit 6 : Trees Introduction. Overview of Graphs. Insert a node at the rear end. Other operations. Height of tree. Storage representation of a binary tree. Spanning Trees. Quick Sort. Delete a node from the front end. Insert a node at the rear end. Unit 8: Searching Methods Introduction. Basics Searching Techniques. Tree Sort. Selection Sort. Overview of Sorting Methods. Doubly linked lists: Insert a node at the front end. Delete a node from the tree. 2-Way Merge Sort. Bubble Sort. Singly-Linked Lists. Circular singly linked list: Insert a node at the front end. Illustration of C programmes. Algorithmic Notation: Sequential Search [Linear search]. Adjacency lists & Adjacency Matrix: Adjacency lists. Various operations on binary trees using linked representation: Insertion Operation. Binary Search.
Spanning Trees: Minimum spanning trees. Bellman-Ford Algorithm.building a tree from a collection of forests. Postorder Traversal. Traversing the Nodes of a BST: Preorder Traversal. Iterative deepening search. Adjacency Matrix. Sub graphs. Relaxation. Uninformed Search: Breadth-first search. Uniform-cost search. Terminology. Binary Search Trees in the Real-World. Analyzing the BST Search Algorithm. Adjacency List. Why minimum spanning trees.Book 2: Advanced Data Structures using C Unit 1: Advanced Topics in Trees and Their Applications Introduction. Deletions from a Red-Black tree. Inorder Traversal. Kruskal's Algorithm. Safest Path. Prim's algorithm. Graph Representation: Edge List. Topological Sort Problem. Directed Graph. Insertion into a red-black tree. Bidirectional search. Other Graphs: Graph Transpose Problem. Depth-limited search . Strongly Connected Components problem. The Order of Insertion Determines the BST's Topology. The Binary Heap: Definition. Connectedness. The A-A tree. Red-Black Trees. Depth-first search. Insertions into a Binary Heap. Single-source shortest paths in Directed Acyclic Graph (DAG). Big- and Big-:Properties of the sets O(f(n)) and (f(n)). Bipartite Graph. Inserting Nodes into a BST. Sample Problem: Riding The Fences. Deleting Nodes from a BST. Overfencing. Other useful mathematical formulae. Special Graphs: Rooted tree. The Cost of Recursion. Implicit Representation. Examples of Graph Problems: Telecommunication. Unit 3: Graphs and their Applications – I Introduction to Graphs. Worst case height of an AVL tree with n Nodes. MaxiMin Distance. Floyd Warshall and Variants:Transitive Hull. Finding Shortest Paths using BFS. Unit 2: Minimum Spanning Trees and Algorithms Introduction. Euler Path. Paths. AVL Trees: Definition. 34 . Deletions from a Binary Heap. Build Heap -. Complete Graph. Height Balanced Trees: AVL Trees. How to find minimum Spanning Tree?: Lemma. Dijkstra Algorithm. Lemma. Euler Cycle. Big-O Notation: Application of Big-O notation to algorithm analysis. Representation. MiniMax Distance. Knight moves. Analysis of Insertion Algorithm. Forest.
Udder Travel . Sequential Access Theorem. Inverted files. The potential method. Complexity. B . Static Finger Theorem. Desert Crossing. An Application of Graph. Clustered files. Depth First Search (DFS) Algorithm: Sample Problem: n Queens [Traditional]. Comparison of DFS. Insertion. B.Tree File Organization. Strong Access Lemma. 35 . Sequential files. Depth First with Iterative Deepening (DF-ID): Complexity. Dynamic Hashing: How does it work?. A* Search. Complexity. A language for describing file structures. Multi-lists. Scatter storage or hash addressing. Balance Theorem. Other Theorems : Working Set Theorem. Ring structures. A Dynamic Hash Table that both expands and contracts. Splay Trees. Amortized Analysis: Aggregate Analysis. Depth First Search (DFS) Implementation. Unit 5: Splay Trees (Self-adjusting Search Trees) Introduction. Properties of the Potential Function. Trees. Betsy's Tour . Breadth First Search (BFS) Implementation. Dynamic Finger Theorem. Dynamic Optimality Conjecture. Logical or Physical Organization and Data Independence.Tree Index Files. Index-sequential files. Sample Problems: Super-prime Rib. BFS & DFS+ID. Access lemma.Unit 4: Graphs and their Applications – II Introduction. Deletion. Join. Static Optimality Theorem . Unit 6: File Structures Introduction. Breadth First Search (BFS): Sample Problem: Knight Cover [Traditional]. Basic terminology. Addition Chains. Informed Search: Best First Search. The Dynamic Hash Table. Cellular multi-lists. Threaded lists.
The UML Is a Language for Specifying. common Modeling Techniques: Modeling Simple Dependencies. An Overview of the UML: The UML Is a Language. Advanced Relationships. Realization. Other Features. Attributes. Organizing Attributes and Operations. Diagrams in the UML. Adornments. Unit 4: Common Mechanisms Introduction. Interfaces. Where Can the UML Be Used?. Grouping Things. Unit 3: Relationships Introduction. Modeling New Properties. Modeling the Distribution of Responsibilities in a System. Attributes. Name. The UML Is a Language for Visualizing. Responsibilities. Modeling Structural Relationships. Types. 36 . Behavioral Things. Multiplicity. Modeling Single Inheritance. Role. Generalization. Common Mechanisms in the UML: Specifications. Tagged Values. Advanced Classes. Common Modeling Techniques. Association. Terms And Concepts: Names. Association. Operations. Terms And Concepts: Dependency. Common Modeling Techniques: Modeling New Building Blocks. A Conceptual Model of the UML: Building Blocks of the UML. Unit 2: Basic Structural Modeling Introduction. Template Classes. Stereotypes. Relationships in the UML. Root. Operations. Constraints. Scope. Aggregation. The UML Is a Language for Constructing. Abstract. Modeling New Semantics. Leaf. Things in the UML: Structural Things. Terms And Concepts: Classifiers. Terms and Concepts: Notes.iv) System Analysis & Design (SAD) MC0069 (4 Credits) Unit 1:The Context of Systems Analysis and Design Introduction. Other Adornments. Standard Elements. Common Modeling Techniques: Modeling Webs of Relationships. and Polymorphic Elements. Standard Elements. Visibility. The UML Is a Language for Documenting. Common Modeling Techniques: Modeling the Vocabulary of a System. Principles of Modeling: Object-Oriented Modeling. And Roles. Dependency. Rules of the UML. Generalization. Terms And Concepts. Multiplicity.
Statechart Diagrams. Types and Roles. Time and Change Events. Collaboration Diagram. Signals. Creation. Operations. Common Modeling Techniques: Modeling a Flow of Control. Behavioral Diagrams: Use Case Diagram. Common Modeling Techniques: Modeling reactive Objects. Sending and Receiving Events. Unit 5: Diagrams Introduction. Object Diagrams. Common Modeling Techniques: Modeling Simple Collaborations. Modeling Static and Dynamic Types. Representation. Unit 6: Class Diagrams Introduction. Forward and Reverse Engineering. Messages. Common Modeling Techniques: Modeling the Seams in a System. Modification. Sequence Diagram. Unit 8: Events and Signals Introduction.Terms And Concepts: Names. Sequencing. Common Modeling Techniques: Modeling Different Views of a System. Forward And Reverse Engineering. Modeling Different Levels of Abstraction. Terms And Concepts: Kinds of Events. Relationships. Component Diagram. Unit 7: Interactions Introduction. Understanding an interface. Modeling Complex Views. Terms And Concepts: Context. Call Events. Links. Terms And Concepts: Context. Substates. Common Modeling Techniques: Modeling Object Structures.Structural Diagrams: Class Diagram. Terms And Concepts. State Machines. Common Modeling Techniques: Modeling the Lifetime of an Object. Modeling Exceptions. Terms And Concepts. Advanced States and Transitions. Forwarding And Reverse Engineering. Modeling A Logical Database Schema. Statechart Diagram. Common Modeling Techniques: Modeling a Family of Signals. Object Diagram. Activity Diagram.Terms and Concepts. Transitions. States. Terms And Concepts: Common Properties. Objects and Roles. 37 . Deployment Diagram. and Destruction.
Modeling a Client/Server System. Behavior. Common Modeling Techniques: Modeling the Architecture of a System. Modeling Realization of an Operation. Common Modeling Techniques: Modeling a Embedded System. Structure. Forward and Reverse Engineering. 38 . Standard Elements. Terms And Concepts: Names. Modeling a Mechanism. Collaborations. Modeling an API. Terms And Concepts: Names. and Binary Replaceability. Terms And Concepts: Common Properties. Contents. Unit 10: Systems And Models Introduction. Deployment Diagrams. Common Modeling Techniques: Modeling Source Code. Components Interfaces. Models and Views. Common Uses. Modeling Adaptable Systems. Modeling Source Code.Unit 9: Components Introduction. Terms And Concepts: Common Properties. Modeling Tables. Components Diagrams. Contents. Organizing Collaborations. Modeling a Fully Distributed System. Components and Classes. Common Modeling Techniques: Modeling Executables and Libraries. Trace. Modeling Systems of Systems. Modeling an Executable Release. Kinds of Components. Organizing Components. MODeling a Physical Database. Files And Documents. the Common Modeling Techniques: Modeling the Realization of a Use Case. Common Uses. Terms And Concepts: Systems and Subsystems.
Modes of Execution. Seven State Process Model. Microkernels . Process Termination. Secondary-Storage Management . Error Detection. Unit 2: Operating System Architecture Introduction. Distributed Systems. Introduction to Virtual Machines: Hardware Virtual machine. Threads: Processes Vs Threads. Swapping. Resources Management Provide a effective user interface. Process Creation. Main-Memory Management . Protection System. Operating System Services: Program Execution. Emulation of a non-native system. File Management . Multi Programmed Batch Systems . I/O Operations. Evolution of Operating Systems: Early Systems. Simple Structure. What is an Operating System?. What is a Process?. Communications . 39 . Layered Approach. Functions of an Operating System: To hide details of hardware. Application virtual machine. Implementation Techniques: Emulation of the underlying raw hardware (native execution). Why Threads?. Real-time Operating System . Process States: Five State Process Model. File System Manipulation . Process Control: Process Structure.Thread States. Virtual Environment. I/O System Management . Time Sharing Systems . Unit 3: Process Management Introduction. Kernel Level Threads. Command Interpreter System. OS as an Extended Machine. Advantages of Threads over Multiple Processes. Modules. Machine Aggregation. Operating Systems for Different Computers.v) Operating Systems with Unix MC0070 Book 1: Operating Systems Unit 1:Overview of Operating System Introduction to OS. Networking. Types of Threads: User Level Threads. Disadvantages of Threads over Multiple Processes. Process Control Block. Operating System Components: Process Management . UNIX kernel Components . Example: UNIX Process. Context Switching. Simple Batch Systems .
Killing Zombies. Algorithms. Mutual exclusion by disabling interrupts. Memory Hierarchy. Fetch and write Mechanism: Demand fetch. Replacement Policy. Selective fetch. Cleaning policy. Fully Associative Mapping. pre-fetch. CPU-I/O Burst Cycle. Round Robin Scheduling. Unit 6: Deadlocks Introduction. Semaphore Implementation. Critical Section. Associative Memory. Cache Memory: Basic Structure. Operating System Examples. File Structure: File Types. 40 . FIFO replacement algorithms. Pipes. Unit 5: CPU Scheduling Introduction. Priority Scheduling. File Attributes.Unit 4: Memory Management Introduction. Cache Performance. Write-back mechanism. Mutual exclusion by Peterson‘s Method:. Instruction and data caches. Mutual Exclusion: Requirements for mutual exclusion. Multi level page table. Second-level Caches. Cache Memory Organization. Fetch Policy. Deadlock Prevention. Replacement policy: Random replacement algorithm. Page buffering . Mutual Exclusion using Semaphore. Least recently used algorithm for a Cache. Paging: Control bits. Scheduling Algorithms: First-Come First-Serve Scheduling. CPU Scheduler. FCFS. What is concurrency?. Algorithm Evaluation. Write Operations. Load Control. Solutions to deadlock. Multilevel Queue Scheduling. Deadlock detection and recovery. Placement Policy. Unit 8: File Systems and Space Management Introduction. Mutual exclusion by using Special Machine Instructions. Multiple-Processor Scheduling: Approaches to Multiple-Processor Scheduling. Segmentation: Combined paging and Segmentation. Access Modes. Thread Scheduling. Mutual exclusion by using Lock variable. Scheduling Criteria. Frame locking. Livelock. Write-through mechanism. Data Blocking . Optimizing the data cache performance: Principle of Locality. Mutual exclusion by Strict Alternation. Symmetric Multithreading. Race Conditions. Unit 7:Concurrency Control Introduction. Semaphores: What are Semaphores. File Systems. Deadlock avoidance.
Layers of UNIX Operating System. UNIX Architecture.Versions. Interrupt-controlled I/O. Performance. Unit 2: The Standard File Systems Introduction: root. Architecture. UNIX and Standards: UNIX for Mainframes and Workstations. Part 1. Process Control. ufs. Back-up Dumps. Space Management : Block Size and Extents. Accessibility support. Reliability. I/O structure. Fsck: File System Checking. Commands Connected Through Pipes. Recovery Console. The I/O address space. Orthogonal Commands.6 swap. Encrypting File System. The UNIX Operating System. bfs The boot file system. Source Versions of "UNIX". Environment Variables and Shells.Volume fault tolerance . UNIX for Intel Platforms. Program-controlled I/O. Hardware Management. File System Types: s5. Unit 9 Input-Output Architecture Introduction.2. System utilities. Swap. Linked List. I/O Control Strategies. Directories. Architecture of the Windows NT operating system line: 1 User mode. Common functionality:NTFS 5. Consistency Checking: Transactions. File System Mounting and Un-mounting. Ext2. Basic and dynamic disk storage. mkfs. Process Management . Free Space. Making Changes to UNIX. Kernel. Help. The History of UNIX: Berkeley Software Distributions. Direct Memory Access. Server family functionality: Distributed File System . Introduction to the UNIX Philosophy: Simple. Windows 2000:History. Iso9660 or hsfs. Language & locale support. msdos or pcfs2. swap.8 Fdisk. Introduction to the UNIX Philosophy. Deployment. A (Mostly) Common Option Interface Style. The Boot Procedure. Kernel mode. Book 2: Advanced Operating System with UNIX Unit 1: Review of Operating system Concepts What is an Operating System?. Contiguous. File Index. Hardware Management. System 41 . Part 2. Bad-block Forwarding.Implementing File Systems : Files . proc or procfs2.2. Unit 10: Case Study on Window Operating Systems Introduction. No File Types . Disk Index.Active Directory .
Backup Options. Named Pipe: Creating A Named Pipe. Working with Files: Copying Files with cp. Using Metacharacters When Referring to Filenames: Pattern Matching on a Single Character. dump. File and Directory Names. Kill. Viewing and Setting Environment Variables. Creating Listing. Using Shell Startup Files. The UNIX File Tree.Processes. After Login Succeeds.msgsnd(). Working on the System: Erase. Other Useful ls Options. Logging In to the System. Semaphore. 42 . Online Help.msgget(). Shared Memory. Startup Scripts. Listing Files and Directories: ls Revisited: ls The Short and Long of It. Creating Directories with mkdir . Moving Files with mv. Redirecting Input and Output. The pipe() System Call. The fork() System Call. Reading A Message From The Queue . and Viewing Files. Different Privileges for Different Users. Removing Files with rm. Showing File Types with –F. Using Commands: What Is a Command?. Showing Hidden Files with –a. Listing Files Whose Names Contain Nonprintable Characters with –q. Other Process Related Commands. Configuring Your Environment. Keeping Secrets — File and Directory Permissions. Backup & Restore: Tape Media and removal cartridge. Unit 3:Processes in Unix Introduction. Renaming Directories with mv. Inter Process Communication: Communications Via Pipes. eof. Unit 6: Managing Data Files in UNIX Introduction. Setting a processes priority. Other ls Options.msgrcv(). Working with Directories: Creating Multiple Directories with mkdir. Removing a Directory with rmdir. Logging Out. The Message Structure . Child Process Termination. Configuring with rc files. The Types of UNIX Files. Message Queues: Creating A Message Queue .struct msgbuf: Writing Messages Onto A Queue . Stop and Start. Hard and Symbolic Links. Unit 4: Beginning with UNIX Introduction: User Account Setup. Default File and Directory Permissions—Your umask. Unit 5: UNIX File System Introduction. Managing Your Password.
The Kernel and the Shell. The id Command. Escaping from the Special Characters. HOME. Calculating with dc. Redirection of Input and Output. Locating Files of a Specific Size: -size n and Displaying the Path Names of Found Files: -print. Finding Information About Disk Utilization with du and df : Summarizing Disk Usage with du. Executing a UNIX Command on the Found Files: -exec cmd \. Entering Commands Too Long for One Line. Finding the Date and Time. Reporting Blocks and Files with df.. How the Shell Interprets Commands. Switching Accounts with su. Search Criteria. Negating Expressions to Find Files That Don't Meet Criteria. Pipeline Connection. Shell Programming. Defining Your Own (UserDefined) Variables. Inputoutput Redirection. Executing a UNIX Command on Found Files. Controlling Input and Output: Output Redirection. Writing Found Files to a Device: -cpio device. Input File Redirection. Substituting the Results of Commands in a Command Line. Searching for Files on Only the Current File System: -mount. Specifying More Than One Path to Search. Conditional Variable Substitution with Error Checking. Changing Shell Options with set. Entering Data from the Shell. Learnig More About Commands with man. Substitution of Variable Data. Combining Search Criteria. Positional Variables or Parameters. Unit 8: Shell Programming Introduction. IFS. Filename Substitutions on the Command Line. Redirecting Error Messages. How File Substitution Works: The find Command. Variables. Finding Files with a Specific Name: name fname. The finger Command. Using Pipes to Pass Files Between Programs. 43 .Pattern Matching on a Group of Characters.. Maintenance of Variables. Substitution of Filenames. The Functions of a Shell: Program Initiation. Locating Files of a Specific Size: -size n. Unit 7: Other Popular Tools in UNIX Introduction. Environment Control. Displaying a Monthly or Yearly Calendar with cal . Making Calculations with dc and bc: Calculating with bc. Shell Options: The Restricted Shell. Entering Multiple Commands on One Line. Altering the Search Path with –depth. Search Qualifiers. Substituting Default Values for Variables. But Querying First: ok cmd \. Pattern Matching on Character Sets. Entering Simple Commands. Conditional Variable Substitution. Getting Information About Users: The who Command. Special Variables in the Bourne Shell: Environment Variables.
The ifthen Statement. Filename substitutions. Syntax improvements.MAIL. Testing Conditions with test. Extending a command over multiple lines. Combining and Negating test Conditions. Preventing Variables from Being Changed. Command editing. The if-then-else Statement. Displaying the Program Name. Reading Data into a Program Interactively. Substitution of variables. The Null Command. Nested if Statements and the elif Construct. Entering Comments in Shell Programs. Invoking C Shell. Job processing. Directory Management. 44 . MAILCHECK. PATH.Wildcard expressions. Command aliases and Commad details: Command history. Repeating Within an until Loop. Shell Programming: What Is a Program?. Doing Arithmetic on Shell Variables. Repeating Within a for Loop. Entering multiple commands on one line. Privileged mode switching. PS1. MAILPATH. Shell Basics: Redirection of input and output. PS2. Testing Numeric Data. Conditional Command Execution with the And/Or Constructs. Overview of C Shell: A Little History. Arithmetic expressions.Passing Arguments to Shell Programs. Coprocessing. Repeating Within a while Loop. Building Repetitions into a Program. Data Output from Shell Programs. Testing Character Data. Getting Out of a Loop from the Middle. The Shell as a Language. Testing for Files. Structured Shell Programming Using Functions. TERM. Handling the Unexpected with trap. Escaping and quoting. Using Data Variables in Shell Programs. Command substitutions. A Shorthand Method of Doing Tests. The case Statement. Decision Making in Shell Programs.
The Serial or Linear Sequential Development Model. Modular decomposition. The repository model. Unit 2: Software Design Processes Introduction. Object identification. Software Reuse. Object Interface Design: Design evolution. The client–server model. The abstract machine model. Design description. Design strategies. Semantic data models. Data –flow design. Definitions of Software Engineering. An object-oriented design example. The Parallel or Concurrent Development Model. Object models. What is meant by Software Engineering?. Inheritance models. Inheritance. 45 . Service usage models. Domain-specific architectures. Unit 3: Software Reliability Introduction. System Models: Data-flow models. Structural Decomposition: Detailed design. Object Oriented Design: Objects. Unit 5: Object Oriented Design Introduction. Iterative Development Model. Design Methods. Software Applications. Object aggregation. Evolving Role of Software. Design quality. The incremental Development Model. Object Classes & Inheritance. Service Usage. Control models. Architectural Design: System structuring. Programming for Reliability: Fault avoidance. Object aggregation. Software Design: The design process. Unit 4: Software Design Principles Introduction. Software reliability metrics.THIRD SEMESTER i) Software Engineering MC0071 (4 Credits) Book 1: Software Engineering Unit 1: Software Development Approaches Introduction. Data Dictionaries. Fault tolerance. Function oriented design. Software Characteristics. Hacking.
Managing Testing Functions. Testing software changes. Validation Test Criteria. Version management tools. Software Testing Strategy. Maintainability measurement. Testing GUIs. Change Management. Software Testing Fundamental. Software Refactoring. Principles of Testing. Stress testing. Regression testing. White box testing (glass-box testing). Thread testing. Life-Cycle Models:The waterfall Model. Unit 10: Case Study Introduction. Computation. Risk-Reduction Models: The Prototyping 46 . Control Structure Testing. System Requirements. System documentation. Black Box Testing. and Evaluation. Software Reengineering. Maintenance costs. Software Maintenance. Testing Principles. Metrics Collection. Verification and Validation: Validation Testing. Black-box testing (Functional testing). Unit 8: Software Testing Assurance Introduction. Book 2: Advanced Software Engineering Unit 1: Software Development Strategies – I Basic Planning and Control Introduction. Test and QA plan. Test Plan: Test Documentation. Back-to-back testing. Unit 7 : Software Testing Techniques Introduction. Testing Documentation and Help Facilities. Architectural Alternatives. Incremental and Iterative Models. The maintenance process. Testing methods and tools: Testing through reviews. Boundary Value Analysis. System Testin. Unit 9: Software Testing Strategies Introduction. White Box Testing. Release management. Bottom-up Integration. Test Strategies: Top-Down Testing. Bottom-Up Testing. Version and Release Management: Version identification. Unit Testing: Unit Test Considerations. Top-down Integration.Unit 6: Configuration Management Introduction. Organizing for software testing. Characteristics of software Development Strategies.g Acceptance Testing. Additional requirements in testing OO Systems.
Unit 2: Software Development Strategies – II Tools. The Clean Room Model. Implications of the New Business Model. The Spiral Model. Aspect oriented Development. Personal and Team software development Models. Interdisciplinary Resources. Open Source development Model. The Need for a business model in Software engineering. Most Users Do not Understand Computer Languages. Unit 3 : Software Development Strategies – III Process Improvement Introduction. Case Tools. Commercial Off-the-shelf Model (COTS). and Reuse Introduction. The E-Business Revolution. Object-oriented and Reuse Model: Object-Oreinted Model. Software Technology as a Limited Business Tool – What Computers Cannot Do?: People Have Different Needs That Change over Time. The Dimension of time. Workflow Application Model. The Reengineering Model. Software Technology as Enabling Business Tool – What Computers Can Do ?: Exponential Growth in Capability. Second Assumption: Software or Business Processes. Classic Invalid assumptions: First Assumption: Internal or External Drivers. Third Assumption: Processes or Projects. Unit 5: An Assessment of Process Life-Cycle Models Introduction. Unit 4: Software Development Strategies – IV Reinventing How It Is Done Introduction. Role of the Problem-Solving Process in This Approach: Data. Time. The capability Maturity Model. Rational Unified Process Model. Tools and Capabilities. Rapid Application Development Model.Model. Businesses View Software Technology as a Black Box for Creating 47 . Objects. Human factors in Development Models. Connectivity Power. Portability Power. Agile Software Development. Redefining the Software Engineering Process: Round-Trip Problem-Solving Approach. Fourth Assumption: Process Centered or Architecture Centered. Unit 6: Software Technology and Problem Solving Introduction. Overview of the Assessment of Process. Goals. Decisions and Problems – Complex and Ill Structured. Activities. Problem Definition. Business Problem-Solving Optimization. Productivity-Driven Dynamic Process Modelling.
Integration – Not Differentiation: Investing in Diversification. Partial Knowledge. Unreliable Sources of Information. Factors That Affect Interdisciplinary Ignorance. The Hidden Value of Differences. Human driven software engineering. The people factor – Multidisciplinary aspects. The team factor. Diversity in Problem Solver Skills at the Project Management Level. Understanding Diversification in Software Engineering: Driving Forces of Diversity in Development Strategies. The customer factor. Lack of Communication. The importance of people in problem solving process: The Rolers of Users in Problem definition. Unit 7: Diversification of Problem-Solving Strategies in Software Engineering Introduction.Economic Value. Interorganizational Ignorance. 48 . A View of Problem Solving and Software Engineering. Unit 8: People and Software Engineering Introduction. Traditional Software Engineering.
Conceptual Framework for Interactive Graphics. Polynomial Method. Random Scan Display Processor. Image Processing as Picture Analysis. Overview of Simple Raster Graphics Package: Displays with Frame Buffers and Display Controllers. Grayscale. Input Technology. Moving pen. Trigonometric Method. Boundary Fill algorithm. Circle Drawing Algorithms. Midpoint circle drawing Algorithm.ii) Computer Graphics MC0072 Unit 1: Introduction to Computer Graphics Introduction. Architecture of a Vector Display. Types of polygons. Unit 3 : Raster Graphics Algorithms Introduction. Approximation by thick polyline. Digital Differential Analyzer. Midpoint Line Algorithm. Video Mixing. Line Drawing Algorithms. Architecture of a Raster Display. Line Style and Pen Style. Software Technology. Flood Fill algorithm. Filling Rectangles. Bresenham‘s Line Algorithm. Classification of Applications. DDA Circle Drawing Algorithm. Display with only Frame Buffer. Unit 4: Filling Rectangles and Polygons Introduction. Polygon Filling: Seed fill. Color Tables. Raster Display System with Peripheral Display Processor. Representation of a Circle. The Video Controller. Graphics Workstation. Pattern filling. Scan Converting Circles: Basic Concepts in Circle Drawing. Development of Hardware and Software for Computer Graphics: Output Technology. Bresenham‘s Circle Drawing Algorithm. 49 . The advantages of Interactive Graphics. Thick primitives: Replicating pixels. Unit 2: Graphics Hardware Introduction. Direct-view storage tubes. Filling areas between boundaries. Color and Grayscale Levels. Filling Polygons. Representative Uses of Computer Graphics. Scan Converting Lines: Basic Concepts in Line Drawing. Scan Line algorithm.
Eneralized Clipping with Cyrus-beck Algorithm. Y Shear. Liang-Barsky Line Clipping Algorithm. Window to View-port Transformation or Viewing Transformation: Normalization Transformation. Homogeneous Coordinates and Matrix Representation of 2D Transformations: Homogeneous Coordinates for Translation. Matrix Representations of 3D Transformations: Translation. Shearing Relative to Other Reference Line. Composition of 2D Transformations: Rotation About and Arbitrary Point. Shear. Homogeneous Coordinates for Scaling. Starbust method. X shear. Composition of 3D Transformations: Rotation about Arbitrary Axis. Scaling. Types of Perspective Projection. Rotation. Bitmap method. Efficiency. Three Dimensional Viewing. Two dimensional transformations: Translation. Orthographic Projection. Inverse Transformations. Reflection with Respect to xyplane. Clipping Lines: Sutherland and Cohen Subdivision Line Clipping Algorithm. Clipping Polygons: Sutherland – Hodgeman Polygon Clipping. Oblique Projection. Reflection with Respect to Any Plane. Projection: Parallel Projection.Unit 5: Clipping Introduction. Workstation Transformation. Unit 7: Viewing in 3D Introduction. Unit 6: Geometrical Transformations Introduction. Reflection. Shear. Reflection with Respect to Given Plane. Rotation. Specifying an Arbitrary 3D View. Scaling. Types of Parallel Projections. Clipping Circles and Ellipses. Homogeneous Coordinates for Rotation. Generating characters: Stroke method. 50 . Transformation from World Coordinate to Viewing Coordinates. Perspective Projection.
Examples: MASM Macro Processor. 51 . Addressing Modes: Addressing modes for CISC (Motorola & Intel). Difference between CISC and RISC. Assembly Language. Introduction to RISC & CISC machines. Macro Definition and Expansion: Conditional Macro Expansion. Unit 2: System Software and Machine Architecture Introduction. Binding and Binding Times. Introduction to Data Formats. Basic Assembler Functions. Flow chart of Design of Macro Preprocessors Implementation. Language Processor Development Tools. Software and compiler boot straping. Bootstrap loaders. Bootstraping: Boot strap loading. Fundamentals of Language Processing. Unit3: Assemblers Introduction. Fundamentals of Language Specification: Programming Language Grammars. Implementation Examples: A Linker for MS-DOS. Unit 5: Linkers Introduction. Addressing modes of RISC Machines. Examples: MASM Assembler and SPARC Assembler. Design of a Linker. Design Specification of Assembler: Data Structures. Classification of Grammars. Unit 4: Macros and Macro Processors Introduction. Relocation and dynamic linking. Macro Parameters. Design of Multi-pass(two pass) Assemblers Implementation. The C Preprocessor for GCC version 2. pass1 & pass2 Assembler flow chart. Design of Single Pass Assembler.iii) System Programming MC0073 (4 Credits) Unit 1: Language Processors Introduction. Nested and Recursive Macro Calls and its expansion.
Storage or Memory Allocations: Static Memory Allocations. Dynamic Memory Allocations. Heap Storage & Garbage Compaction. Unit 8 : Compilers & Interpreters Introduction. Motivation for a Retargetable loader (RL). Compiler writing tools. Code Optimization. Interpreters. Difference between compiler and interpreter. Phases of Compilation: Lexical Analysis. Syntax Analysis. Unit 10: Software Tools Introduction. Basic Loader Functions: Design of an Absolute Loader. 52 . Non-Deterministic Finite Automata. Editors. Interpreters. Programming Environments: IDE. Operator Precedence Parser. A Simple Bootstrap Loader.Unit 6 : Loaders Introduction. Debuggers. Simple Precedence Grammar. Finite State Automata(FSA): Deterministic Finite Automata. Binding and binding times: Memory Allocation in Block Structured Languages. YACC Compiler-Compiler. Moore Machine and Mealay Machine. Generalized Non-Deterministic Finite Automata (GFNA). Java Compiler and Environment. Relocation. Intermediate Code Generation. Tools that deal with machine code instructions. Stack Based Allocations. Parsing: Types of Parsers. Operator Precedence Grammar. Context Free Grammar. Code Generation. Java and its Garbage collection. Advantages of Finite State Automata. Software Tools for Program Development: Compilers. Unit 9 : Memory Allocations Introduction. User Interfaces. Unit 7 : Scanning & Parsing Introduction.
Poisson distribution. Functions of random variable. Exponential distribution. Moments. Unit 2: Random Variables Introduction. Two-dimensional random variable. 53 . Sampling theory. Uniform distribution. Discrete and continuous random variable. Rounding off numbers to significant digits. Unit 7: Errors in Numerical Calculations Introduction. Unit 5: Statistics Introduction. Marginal and conditional probability distribution. Marcov-chains Introduction. Normal distribution. Accuracy and Significant digit. Correlation coefficient. Point estimation. Bernoulli Poisson process. Chi-square distribution. Unit 6: Stochastic process. Skewness. relative and percentage errors. Features of random experiment. Graphical representation. Definition of some basic terms. Curve fitting. Gamma distribution. Unit 3 : Distribution Introduction. Mathematical expectation and variance. Absolute. Moment generating function. Classification of stochastic process. Errors and their computation. Stochastic process. Markov chains. Baye‘s theorem. Sampling theory and estimation Introduction. Unit 4: MGF. Conditional probability. Covariance. Bernoulli trials. One-dimensional random variable.iv) Statistical & Numerical Methods using C++ MC0074 (4 Credits) Unit 1: Probability Introduction. Regression. Kurtosis. Measures of central tendency.
Newton‘s forward and backward difference interpolation formulae. Different type of matrices. Unit 13: Introduction to Mathematical Software used for Numerical Analysis Introduction to MATLAB: Key Features of MATLAB. Iteration method. Operations on matrices. Numerical Algorithms Group (NAG). Unit 11: Numerical Differentiation and Integration Introduction. Initial value problem. Divided differences. Vectors/Matrices. Numerical differentiation. Determinant of matrices. Solution to a system of linear equations. Lagrange‘s interpolation formula. Graphics. Unit 9: Solution of Algebraic and Transcendental Equations Introduction. Unit 12: Numerical Solution of Ordinary Differential Equation Introduction. Method of false position. Unit 10: Interpolation Introduction. Derivatives using Newton‘s forward and backward difference interpolation formulae. Syntax of MATLAB. Rank of a matrix. Finite differences. Bisection method. Eigen values and Eigen vectors. Euler‘s method. Runge-Kutta method of second and fourth order. Numerical integration. Limitations.Unit 8: Matrices and Linear System of Equations Introduction. Taylor‘s series method. Variables. 54 . Lab Exercise. Generalized Newton method. Modified Euler‘s method. NewtonRaphson method. Semicolon. History of MATLAB.
WDM – Wavelength division multiplexing. 55 . The TCP/IP Reference Model. Definition of a Computer Network: What is a Network?. Ring Topology. Unit 4: Physical Layer Introduction. Network standardization: Who's who in the telecommunication world?. Implementation of packet switching. Simplex. Half duplex & full duplex. Data transmission modes. Networks for people. Social Issues. Considerations when choosing a Topology. Wide area networks. Metropolitan area networks. Who's who in the Internet standards world?. Star Topology.v) Computer Networks MC0075 (4 Credits) Book 1: Computer Networks Unit 1: Introduction To Computer Networks Introduction. Components of a computer network. Unit 2: Network Software &Network Standardization Introduction. Dispersion. Design issues for the layers. Theoretical basis for communication: Fourier analysis. Multiplexing: FDM – Frequency division multiplexing. Networks Software: Protocol hierarchy. Synchronous & Asynchronous transmission. Merits and De-merits of Layered Architecture. Band limited signals. Reference models: The OSI Reference Model. Transmission impairments: Attenuation distortion. Based on the their scale. Use of Computer networks: Networks for companies. Classification of networks: Based on transmission technology. Who's who in the standards world. Local area networks. Delay distortion. Network topologies: Linear Bus Topology. Maximum data rate of a channel. Wireless networks. Comparison of the OSI & the TCP/IP Reference Models. Service Primitives. Comparison of switching techniques. Message switching. TDM – Time division multiplexing. Packet switching. Hierarchical or Tree Topology. Topology Comparison. Noise. Switching: Circuit switching. Unit 3: Data Communications Introduction. Serial & Parallel. Relationship between Packet Size and Transmission time.
Radio transmission. CSMA Protocol. Routing. 56 . m) flamming code. Principles of Routing: Types of routing algorithms. Optimality principle. Twisted pair. Slotted ALOHA or Impure ALOHA Protocol. Comparison of fiber optics and copper wire. Closed loop solution. ARQ strategies. Framing. General principles of congestion control. Distance vector routing. Routing algorithms: Shortest path algorithm. Binary exponential Algorithm. Unit 6 : Data Link Layer Introduction: Goal of DLL. Hierarchical routing. Classes of routing algorithms. Congestion: Factors of congestion. Microwave transmission. Data Link layer protocols: Transmission control protocols. Internal organization.Unit 5: Transmission Medium Introduction. The channel allocation problem: Static channels allocation. Internetworking. Comparison of flow control and congestion control. Gigabit Ethernet. Link state routing. Dynamic channels allocation in LAN‘s and MAN‘s. Fast Ethernet. Comparison of channel access protocols. Link Management. Wireless transmission: Electromagnetic spectrum. Single bit error correction or (n. Error Detection or Cyclic Redundant Code (CRC). Error control. Flow control. Optical fiber. Transmission medium: Guided & Unguided Transmission medium. Unit 8: Network Layer Introduction. HDLC. IP protocol (IPV4). Flooding. CSMA/CD Protocol. Properties of routing algorithms. IEEE 802. IEEE standards: Ethernets. Comparison of routing algorithms. Unit 7: Medium Access Control Sub Layer Introduction. Importance of flamming distance for error correction. Multiple access protocols: Pure ALOHA or Unslotted ALOHA Protocol.3 frame format. Design issues of DLL: Services provided to the Network layer. Coaxial cable. Design issues of Network layer: Nature of the service provided. Error Detection and correction: Parity bits.
Different classes of IP addresses: Primary classful addresses. Universal identifiers. Wireless router. Connection establishment. Protocols and Significance for internetworking: Protocols for internetworking. Port Density. Comparison of switching methods. Proxy Server. Hubs: Classification of Hubs. Unit 2: Internet addresses Introduction. IP Addressing scheme. Bridges: Bridge Implementation Considerations. Switches: Switching Methods. Broadcast on LOCAL network. Advantages and Disadvantages of dedicated hardware routers. Motivation for internetworking: How networks differ. A Host on THIS NETWORK. Unit 10: Networking Devices Introduction: Goal of networking devices. Range of addresses in each class. Drawbacks of Routers. Types of Bridges. Special IP addresses: Interpreting all Zero to mean ―THIS HOST‖. Significance of internetworking. Internet architecture. Broadcast on DISTANT network. Gateways Functionality. Class C. LOOPBACK. Class A. Internet services. Wireless Access Point (WAPs). Cables Connecting Hubs and Switches. Book 2: Advanced Computer Networks Unit1: Internetworking Introduction. Gateways: Advantages of gateways. Other classes. Internet layering model. Limitations to Classful Addressing. USB Hub. Repeaters: Uses of Repeaters.Unit 9: Transport Layer Introduction: Services of Transport layer: Service primitives. Managed Hubs and Switches. Working with Hubs and Switches. Brouter. Internetworking. Dotted decimal representation. Connection Release. Other Devices: Modems. Routers: Dedicated Hardware versus Server-Based Routers. Class B. Internet addressing authority. Stackable Hubs. Transport Protocols: TCP protocol. Future growth and technology. UDP protocol. 57 .
Subnet masks: Implementation of subnet using subnet masks. ICMP message format. Variable length subnets: Advantage. Types of address resolution: Resolution through Direct mapping. Unit 4: Subnet and Classless Addressing Introduction. CIDR address blocks and CIDR notations. ARP protocol: ARP Implementation. Subnet address extension. Resolution through Dynamic Binding. Minimizing network numbers: Transparent Routers. Disadvantage. RIP. Limitations. RARP protocol: RARP request. Benefits of subnets. OSPF: Goals. Link state update. ARP frame format: ARP request frame. Proxy ARP. Subnet addressing. 58 . Supernetting: Effect of supernetting on routing or CIDR. Subnet address format.Unit 3: ARP and RARP Introduction. Detecting circular or long routes: Time exceeded message format. ARP reply frame. ARP cache: ARP time outs. Link state acknowledgement. Flexibility in Subnet address assignment. Reports of Unreachability. Example on CIDR. Example on subnetting. Types of Messages: Principle ICMP messages. Disadvantage of fixed length subnetting. Address Resolution problem. Hello protocol. Congested and Datagram Flow control: Source quench format. ICMP: ICMP Encapsulation. Reporting other problems. Obtaining a subnet mask: Address mask request or reply message format. RARP reply. CIDR address blocks and Bit masks. Clock Synchronization and transit time estimation: Time stamp request or reply message format. Unit 6: Routing in the Internet: Interior gateway protocol Introduction. OSPF message formats: Hello. Representation of subnet masks. IGP: Definition. Maintenance of subnet masks. Link state request. Database description. Route change requests from routers: Redirect message format. CIDR reserved for private networks. Router solicitation: Router solicitation message format. Testing Destination Reachability and Status: Echo Request and Echo Reply message format. Unit 5: Internet Control Message Protocols Introduction. OSPF message header. Router discovery: Router advertisement message format.
BGP message types: Open message. EGP: BGP Characteristics. E-mail Services. PEM.Unit 7: Routing in the Internet: Exterior gateway protocol Introduction. GOPHER. User agents. 59 . Notification message. Unit 9: Internet Security Introduction. Header format. BGP message types. Symmetric key algorithm: Product cipher. Common URLs. Digital signatures: Benefits of digital signatures. Network security. Unit 8: Internet Applications Introduction. Update message. Electronic mail: Architecture. S/MIME. Multimedia. Substitution cipher. Transposition cipher. FTP: FTP features. Time to live message. FTP process Model. XML security. Cryptography: Encryption model. BGP functionality. Differences between WWW and hypertext system. DES. Web Model. Key restriction of EGP. IRC: Basic IRC Commands. Veronica: Types of information resources included in the index. Different ways to convey e-mail. E-mail security: PGP. World wide web: Architectural overview. Drawbacks of digital signatures. BGP message header. Transfer modes.
Evaluation. Management information system as a discipline: Relationship of MIS to Reference Discipline. Organization and Management: What Are Organizations?. Storing Information. Data communication technology. Information as the Opposite of Uncertainty. Information and Levels of Management. Demands on Organizations in an Information Society: Components of an organizational information system. Communicating Information. 60 . Organizational Needs. Human Unit 3 Information needs of Organisation and Individuals Introduction. The concept of information: Meaning: Information as Processed Data. Design. Unit 2 . The Need for Information Systems: Individual Needs. Information as a Commodity. Information Required for the Process of Management: Functions of Managers. Retrieving Information. Management. Resources Marketing. Hardware. Implementation. Information as an Asset. The Cost of Information: Acquiring Information. Information needed by different levels of management. Database Management Systems. How information are selected and organized: The Components of Perception.Semester IV MC0076 – Management Information Systems Unit 1 Introduction to Management Information Systems Introduction. Managing Information in a Global Environment: Information management model: Diagnosis. Information as a Meaningful Signal. Functional Information Needs: Accounting. Humans Versus Computers. Development of Organisational Computing. The Manager‘s Job in a Global Environment: Management and Managers.Management Information System from Managerial Outlook Introduction. Finance. Information Technology: The Role of Information Technology. Processing Information. Organizational Design for Knowledge Work. Operations. Managerial Needs. Interpretation of MIS Concept. Components of Information Technology: Software. What are Management Information Systems?: Introduction. Uses of information: Information as a Resource. Informational responses to the new environment.
Time Management Needs. Michael Porter's Generic Strategies for Competitive Advantage. International Corporation. Unit 5 Information Needs for Strategic Planning Introduction. Storing Information. Security. Types of Organizational Information: Transaction Processing Systems. Management Reporting Systems: Characteristics of MRS. Organization Structure and Information: International Strategy: Multinational Corporation. Information Management Requirements. 61 . Information and the Situational Analysis: Major issues to consider in situational analysis: Potential Internal Strengths. Expanding Globally. Communicating Information. Controlling Costs. Creating Strategic Alliances. Cost Leadership. Transnational Corporation. Strategies for Competitive Advantage: Differentiation. Focus. Information Leadership. Organizational Requirements of Information: Cost. Enhancing Personal Productivity. Challenges of Information Management: Dealing with Quantities of Information. Capabilities of information system in an organizational view. Potential Internal Weaknesses. Acquiring Information.Mechanisms for Acquiring and Distributing External Information. Improving Quality. Potential External Threats. Enhancing Personal Productivity. The Role of Expert System. Michael Porter's Competitive Force Model. Executive Information Systems: Characteristics of Executive Information Systems. Value Streams: Michael Porter's Value Chains. Global Corporation. Linkage. Reliability. Potential External Opportunities. Career-Related Needs. Retrieving Information. Information and Organizational Strategy: Strategy. The Strategic Use of Information System. The components of MIS. Ensuring Privacy and Security Unit 4 The Structure of MIS Introduction. Information for Management: Internal versus External Information. Reporting by MRS. Using Information for Strategic Advantage: Reacting to Market Conditions. Office Information Systems. Facing Insufficient or Conflicting Information. Decision Support Systems: Characteristics of DSS. Improving Customer Service. Accessibility. The Individual at Work: The Information Needs of Individual Job Holders: Task-Related Needs.
Unit 6 Impact of IT – Managing in 21st Century Introduction. Common Business Exposures. Benefits of the ERP. Development of long range plans of the MIS: Contents of MIS Plan. Ethical and social issues with network: Home Office: The Value of Telecommuting. The architecture of the MIS. Individual Limits to Rational Decision Making. Other Remote Options. Characteristics of ERP Solution. Technology. Management of Quality in the MIS Unit 8 Business Process Re-engineering Introduction. Risks of Internet to Organizations. The system development schedule. Decision Making: Rational decision making and its limits: Organizational Limits to Rational Decision Making. Knowledge Information. Major threats to IT installations. Business System. Data Security and Data Privacy. ERP Solution Evaluation. Ascertaining the class of information: Organisational Information. Decision Support Information. Value stream model of organisation. Ethical and Social issues with ECommerce. EMS and MIS. Relevance of Information Technology (IT). Business process. 62 . Process model of the Organisation. ERP Model and Modules: ERP Basic Features: General Features. Technology Evaluation Factor. MIS plan is linked to the business plan: MIS goals and objectives. Business Decisions and Information Assurance: Introduction. What do Mangers Accomplish?: Managerial Roles and Their MIS Support. Implementation. Enterprise Resource Planning (ERP) System: ERP Architecture. Unit 7 Quality and Privacy Issues Introduction. Redesigning of Processes: What delays the business process?. MIS and BPR Unit 9 Manager and Decision Making Introduction. Operational Information. Privacy and Databases. Enterprise Management System (EMS): Business needs of today. Functional Information. Strategy for the plan achievement. ERP Solution Structure: Business Operations. Organisation and Business Process Reengineering: Definition and Approach. Hardware and software plan. Implementation of the Management Information System. ERP Selection: Vendor Evaluation Factors.
Projection Operation. Query Optimizer. How to Measure Index Selectivity?. How DSS are developed?. Classification of DSS: Data Access Systems. Third Normal Form. Systems Based on Representational Models. How DSS are Deployed?. Database models. Capabilities of DSS. Object Database Models. Boyce-Codd Normal Form. Query Plan. Domain/Key Normal Form. Systems Based on Optimization Models. Building a decision support system: DSS Technology. Post-relational Database Models. Replication Unit 2 Query Processing Introduction. Query Planning for Nested SQL queries. Implementation. Manually measure index selectivity.Cost Estimation. Organisational aspects of DSS and EIS. The model Management Subsystem.Individual differences and cognitive styles: Creativity in decision making by individuals and groups: Software that assists your creativity. Normal Forms: First Normal Form. When should you use the decision support approach?: Ill structured problems. Data Analysis Systems. Systems Based on Accounting Models. Developmental trends in DSS. Pipelined Multi-way 63 . Transactions and Concurrency. Second Normal Form. Selection Operation. Flat Model: Hierarchical Model. How to choose Composite Indexes?. Forecast-Oriented Data Analysis Systems. The Dialog Management Subsystem. MC0077 Advanced Database Systems Unit 1 Introduction Introduction.Database Internals: Indexing. Who builds a DSS. Guidelines for choosing columns for composite indexes: Join Strategies for Parallel Processors: Parallel-Join. Unit 10 DSS and EIS Introduction. Heuristics of Query Optimizations: Equivalence of Expressions. Measuring Index Selectivity: Index Selectivity. Dimensional Model. Relational Model: Relational Operations. History. Network Model. Executive Information Systems. Components of DSS: Data Management Subsystem. Fourth Normal Form. Natural Join Operation: Join Ordering.
MPEG-7. Systems. Result Presentation: Ordering Query Results – Ranking. The Evolution of Data Management Systems. Data Collection. Context Metadata.Image Objects. An example SQL3 query. Query Optimization. Data Management Functions. 64 . Administrative Database Management Systems. Unit 3 Advanced Data Management Systems Introduction. Selectivity. Relationship Types. Data Value Constraints. Image Retrieval Systems. Uniformity. Identifying Shapes . Optimizing SQL Query Processing: Introduction. Multiple Media Documents. CIDOC-CRM. Declarative Data Models. Query Optimizing: Indexes. Database Design & Creation. Disjunctive Clauses. MIRS. Characteristics of Images.Database Tuning. Management of Web Databases. Accessing Large Objects. Characteristics of Text Documents. Concepts & Components. Model Types: Relational. Utilizing User Defined Data Types (UDT). Structural Metadata. Accessing Multi-Valued Structures. Measuring Retrieval Quality . Efficient SELECT statements. Result Presentation. Text Retrieval Using SQL3/TextRetrieval: Text Document Retrieval. Methodology. Query Processing.Recall and Precision. CBIR: Using Content Descriptors. Attribute-Based Image Retrieval. New Features in SQL3: Accessing Hierarchic Structures. Information & Data Retrieval. W-DBM Unit 4 Advanced Data Modeling Introduction. Join Selectivity. Text-based Information Retrieval. Database Query Language. Attribute Types.Join. Translation to Relational Constructs. Image Retrieval: Using Extended SQL3 for Image Retrieval. A Brief History. Domain Specification. Retrieval using Context Metadata. Standards for Metadata Specification: Dublin Core. Text-Based Image Retrieval. A Structural Semantic Data Model – SSM: SSM Concepts: Entity Types. Cardinality Specifications. Multiple Media Information Retrieval Systems. Entity-Relationship. Object-Oriented. Physical Organization. Improving Result Quality. Color And Texture. Text Retrieval by Semantic Content. Metadata for Mulltimedia: Semantic Metadata. Views. Streamed Image Retrieval – Video. Modeling Multiple Media Data Collections: Metadata. Graphic vs. Modelling Multimedia Collections in SSM Unit 5 SQL 3 – Querying Complex Objects Introduction. SSM Syntax. Query by Image Content.
Relational Database Implementation: DB Components. Unit 7 Data Warehouse & Data Mining Introduction. Direct and Indirect Connections. Data Replication: Availability. Groups. Query Processing in Object-Oriented Database Systems: Type System. SQL3 DB specification: Complex Structures. Associations. Meta Knowledge. Relationships. Site Autonomy. Introduction to Data Mining. Transparency in a Distributed Database System. Encapsulation. Disconnected Computing. Network Load Reduction. Data Storage Methods. Clustering/Segmentation. Advantages of using Data Warehouse. Heterogeneous Distributed Database Systems: The Mechanics of a Heterogeneous Distributed Database. Performance. Data Mining Techniques: Cluster Analysis. Object Models. Complex Objects and Inheritance. 65 . Schema Architecture. Data Mining Functions: Classification. Induction. Unit 9 Distributed Database Systems and Data Replication Introduction. Fuzzy Sets: Basic Concepts: Introduction. Definition. Large OBjects. Applications That Use Replication: Replication Objects. Schema Objects and Naming in a Distributed Database. DB Design: From Requirement Analysis to DB Specification. Data Warehouse Architecture. Mass Deployment. OLAP Example. Storage of LOBs. Sequential/Temporal patterns. Object . On-line Analytical Processing. LOBs. Classification of Data. Decision Trees. Clients. Implementation. Fuzzy Databases: Need for Fuzzy Databases. Remote and Distributed Transactions. Servers and Nodes. Database Links. Techniques for implementation of Fuzziness in Databases. Hierarchical Structures. Comparison of OLAP and OLTP. Data Visualization Unit 8 Fuzzy Dimension to Databases Introduction. Fuzzy Querying to Relational Databases: The proposed model. Realization of Fuzzy SQL.Unit 6 Object Oriented Databases Introduction. Statements and Transactions in a Distributed Database: Remote and Distributed Statements. History of Data Warehousing. Uncertainty: A Modern Outlook. Neural Networks. Query Processing Architecture: Query Processing Methodology. Data dredging. Fuzzy Set Operators and Fuzzy Logic. IBM . Rule Induction.Market Basket Analysis example.
Distributed Directory (Catalog) Management. Deadlock Handling: Deadlock Prevention. Management of Distributed Data with Different Levels of Transparency: Distribution or Network Transparency. Two-Phase Commit Protocol. Locking Protocols for Concurrency Control in Distributed Databases: SingleLock-Manager Approach. Replication Sites.and Sites: Replication Objects. Three-Phase Commit Protocol: Recovery in Three-Phase Commit Protocol: Site Failures. Primary Copy. Relative Advantages of Distributed Databases over Centralized Databases: Organizational and Economic Reasons.Master Replication. Coordinator Failure Protocol. Replication Transparency. Two-Phase Locking Algorithm. Complex Physical Structures and Efficient Access. Materialized View Replication. Deadlock Detection. Decentralized Control. Incremental Growth. Elimination of ―Prepare‖ Message: Increasing Efficiency by Using Defaults. Data Independence. Recovery and Concurrency Control. Problem Areas of Distributed Databases. Distributed Query Processing. Types of Replication Environments: Multi . Optimistic Algorithm. Procedural Replication. Multiple Coordinators. Failure of the Coordinator. Replication Group. Centralized Databases or Differences in Distributed & Centralized Databases: Centralized Control vs. 66 . Remote Recovery Information Problem. Biased Protocol. Privacy and Security. Models of Failure. Concurrency Control Techniques: Timestamp-Based Algorithms. Hierarchical Deadlock Detection. Classification of Concurrency Control Techniques. Concurrency Control (Serializability). Structure of Distributed Database Management Systems. Distributed Deadlock Detection: False Deadlock. Failure of Coordinator. Reduction of Redundancy. Other Options for Multi-Master Replication: Synchronous Replication. Features of Distributed vs. Conflict Detection and Procedural Replication Unit 10 Transaction Management in Distributed Database Management Introduction. Recovery in TwoPhase Commit Protocol: Site Failures. Reliability and Availability. Centralized Deadlock Detection. Network Partitions. Multi-Master and Materialized View Hybrid Configurations. Majority Protocol. Performance Considerations. Fragmentation Transparency. Integrity. Reduced Communication Overhead. Conservative Timestamp Ordering Algorithm. Transaction Processing Framework.
Invoke methods. Control Flow Statements. Package and Interface Inheritance. The abstract class. Common Exceptions.MC0078 (A) Java Programming Unit 1 Getting Started Features of Java. Logical Operators. The main method. Variables in Java. Standard for coding. Readers and Writers. Comparison Operators. Random Access Files.while‘ statement. Interfaces verses abstract classes Unit 5 Exception Handling Definition of an Exception. Switch Statement. The Abstract Streams. Exception Handling Techniques Unit 6 Streams in Java Introduction to Streams. While Statement. Arithmetic Operators. Why Generalize?. Interface. Primitives Data Types. Ifelse statement. Implementing Inheritance in Java. Using classes in java. Compiling Java Programs. ‗Continue‘ Statement Unit 4 Inheritance. Data Types in Java. Serialization 67 . Executing a Java Program Unit 3 Playing with Java Introduction. Abstract/Derived Data Types. Exception Classes. Packages. Naming Variables. ‗do…. Types of Relationships. Operators. What is Inheritance?. Understanding CLASSPATH. Declaring methods in java. How does it work?. Operator Precedence. How to Save a Java Program. Some uses of interfaces. Defining an Interface. ‗Break‘ statement. ‗for‘ Loop. Defining a Package. Java Magic: Byte Code Unit 2 Basics of Java Introduction-Keywords. Access Specifiers. Increment and Decrement operators. How to include comments. Code to display Test Value.
What are Applets?. The BeanBox. Adding Components to user interface. Introduction. Adapter Classes. Inner Classes. Mechanism for connecting to a back end database. How to test a JSP?. Servlet Life Cycle 68 . Event-Handling. Running the BeanBox Unit 10 JSP and Servlets JSP. What is Java IDL?.Unit 7 Creating Front End Applets.AWT Controls. Example: The Hello Client-Server.The Applet Class. How does JSP look?.Event Handling.Life Cycle of an Applet. Web Architecture. History of Web Application. CORBA and Java Beans RMI. CORBA.Objectives. Servlets. Anonymous Classes Unit 8 JDBC Database Management. RMI Terminology.User Interfaces for Applet.Painting the Applet.The Applet and HTML. Event Listener.The Graphics Class. Introduction. Components of an Event. What is needed to write JSP based web application?. Event Classes. Java Beans. Load the ODBC driver Unit 9 RMI.
Creating a Client Program. Writing an RMI Server. Implementing the Server's main Method. Writing the Server Side of a Socket. Writing a Simple Bean. The Java Thread Model. Providing Implementations for Each Remote Method. Implementing a Remote Interface. . Synchronization The Main Thread. Creating Multiple Threads. What is a Datagram?. Declaring the Remote Interfaces Being Implemented. Datagram. Reading from and Writing to a Socket. What Is a Socket?. Properties.MC0078 (B) Advanced Java Programming Unit 1 Multithreading Processes and Threads. Compiling the Example Programs. Bound Properties.Servlet Life Cycle. Running the Example Programs Unit 3 Networking Socket. Thread Priorities. Passing Objects in RMI. Making the Remote Object Available to Clients. How does JSP look?. Web Architecture. Simple Properties. Designing a Remote Interface. How to test a JSP? Unit 5 Servlets History of Web Application. Inter-thread Communication Unit 2 RMI Introduction. Introspection 69 . Creating and Installing a Security Manager. Indexed Properties. Creating a Thread. The Java Servlet Development Kit Unit 6 Java Beans Using the NetBeans GUI Builder. Writing a Datagram Client and Server Unit 4 JSP What is needed to write JSP based web application?.
The Stock Application. Interface versus Implementation Hierarchies. Retrieving Values from Result. Implementation Type Checking. Object Implementations Providing an Implementation. Packaging Object Running the Sample Implementations Object Adapters. Implementing a Server Using the Java 2 ORB. Sets. Differences Between Server Implementations.x. Implementing a Server Using VisiBroker 3. Creating Complete JDBC Applications. A Relational Database Overview. Implementing a CORBA Client. Applications Unit 8 CORBA What is CORBA?. Activation on Demand by the Basic Object Adapter (BOA) Unit 9 Introduction to AJAX Defining Ajax. Updating Tables. How Does Ajax Work? Unit 10 Introduction to Java Struts How Does Struts Work? 70 .Unit 7 JDBC JDBC Product Components.
Linear Programming. Some special cases Unit 6 Network Analysis and PERT-CPM Introduction. Mathematical Analysis of Queuing Process. Methodology of Operations Research. Some basic definitions. Graphical Methods to Solve the LP Unit 3 The Simplex Method Introduction. Project Management – PERT Unit 7 Queuing Theory Models Introduction. General Structure of Queuing System.MC0079 Computer Based Optimization Methods (Statistics / Applied OR) Unit 1 Operations Research: The Science towards Excellence Introduction. PERT / CPM Network components and precedence relationships. The Standard form of LPP. Multiple Service Channels. Determination of Floats. Determination of critical path. Finite Queuing Models 71 . Hungarian Method. Special case of Transportation Problem. The Structure of Mathematical Model Unit 2 Linear Programming Introduction. Basic difference between PERT and CPM. The Simplex Algorithm. Modified Distribution Method Algorithm. Sensitivity Analysis Unit 4 Transportation Problems Introduction. Flowchart and C/C++ Programs. Duality Concept. Scope of Operations Research (OR). Phases of operations Research. Solution of the LPP – Simplex Method. Penalty cost Method or Big-M Methods. Erlang Family of Distribution of Service Times. Mathematical Formulation of Transportation Problem. The significant features of OR. Queuing Theory. Critical path Calculations. Degeneracy in Transportation Problem Unit 5 Assignment Problems Introduction. Two Phase Method. Methods of finding Initial Basic Feasible Solution. Poisson-Exponential Single Server Model (Infinite Population). Analysis of a Queuing Process.
Graphical Method Unit 10 Simulation Introduction. Dominance.Unit 8 Integer Programming Problem Introduction. The Branch and bound technique Unit 9 Game Theory Models Introduction. Random Numbers Allocation. Gomory‘s all IPP Method. Some Miscellaneous Example 72 . Maximin – Minimax Principle and Saddle Point. Process of Simulation. Simulation Procedure. All IPP algorithm. Competitive Games and Strategies. Construction of Gomory‘s Constraints. All and Mixed IPP.
Analysis of Algorithms – Simple Examples. The Notation. Insertion. Recursive Constructs. Divide-and-Conquer. The Notation . Average – Case and Amortized Analysis. Linked lists. Zig Step Unit 4 B – Trees Introduction. Quick Sort. Best First Search & Minimax Principle. Binary Search Trees. Modular Arithmetic / Mod function. Traversing Trees. Breadth-First Search. Integer Multiplication. Unit 3 Elementary Data Structures Introduction. Collision resolution by chaining. Rotations. Matrix Multiplication. Recursion. The Notation . Binary Search. Mathematical Expectation in average case analysis. Example of an Algorithm. Data Structures for Disjoint Set Unit 5 Graph Algorithms Introduction. Outline of Algorithmics. Sorting in Linear Time. Augmenting Data Structures.MC0080 – Analysis of Algorithms Unit 1 Elementary Algorithms Introduction. Unit 2 Mathematical Functions & Notations Introduction. Determining the rank of an element. Medians and Order Statistics. The height of a B – Tree. Well known Sorting Algorithms. Analysis of First – Averages. Fibonacci Heaps. Mathematical Expectation. Concept of Efficiency of an Algorithm. Notation for expressing algorithms. Hash tables. Binomial Heaps. Functions & Notations. Depth-First Search. Binomial trees. Stacks and queues. Procedure and Recursion. The Notation . Problems and Instances. NIM/Marienbad Game. Characteristics of an Algorithm. How to augment a data structure. Splay tree. Divide and Conquer Technique. Properties of B – Trees. Maintaining subtree sizes. Role and Notation for comments. Red-Black Trees. Topological Sort 73 . Sorting. Well known Asymptotic Functions & Notations. Building Blocks of Algorithms.
Formal Language & Grammar. Pushdown Automata (PDA) Unit 10 Models for Executing Algorithms – III: TM Introduction. Prim‘s Algorithm. The Principle of Optimality. Other Undecidable Problems Unit 12 Complexity of Algorithms Introduction. Instantaneous Description and Transition Diagrams. Some Examples. Prelude to Formal Definition. Context Free Grammar (CFG).Unit 6 Dynamic Programming Introduction. Regular Expressions. Undecidable Problems for Context Free Languages. The Problem of Making Change. Classification of Problems. Turing Machine: Formal Definition and Examples. Reduction. Finite Automata Unit 9 Models for Executing Algorithms – II: PDFA & CFG Introduction. Observations. Chained Matrix Multiplication. Matrix Multiplication using Dynamic Programming Unit 7 Greedy Techniques Introduction. Kruskal‘s Algorithm. Notations for the Growth Rates of Functions. Chomsky Classification for Grammar. Establishing NP-Completeness of Problem 74 . Minimum Spanning Tree. Formalization of Greedy Technique. Djikstra‘s Algorithm Unit 8 Models for Executing Algorithms – : FA Introduction. Undecidability of Post Correspondence Problem. Regular Languages. Reduction to Another Undecidable Problem. The Halting Problem. Turing Machine as a Computer of Function Unit 11 Algorithmically Unsolvable Problems Introduction. Decidable and Undecidable Problems. Some Formal Definitions. NP-Complete and NP-Hard Problems.
Cookies in ASP.Semester V MC0081 – DOT Net Technologies Unit 1 Introduction to Microsoft . Connection Strings using ADO. Connecting to a Data Source using ADO. XML & ADO.NET Introducing the ASP. Application File Unit 6 State Management using ASP.Net Framework Introduction to .NET. Creating a Web Form Unit 4 ASP. Basic ADO. Master Pages.asax. The Global.NET Applications Anatomy of an ASP. ADO.NET.NET. Session State.NET). Application State Unit 7 ADO.Net Platform. The Web.Net.NET Architecture.NET Namespaces and Classes Fetching the data: DataAdapter. Creating your first C# Program. Components of .Net Platform.NET State Management. Creating a Simple Windows Form. Understanding Properties & Indexes. Features of . Developing Web Forms: An introduction.NET 75 . Control Statements.NET Application. Connection String Builders (ADO. Introducing Data Types. Building Connection Strings from Configuration Files.config File. Web Form Life Cycle. Exception Handling Unit 3 Building Windows and Web Forms Introduction.NET Features. Delegates and Events.NET Introduction.Net ASP. Architecture. Assemblies Overview Unit 2 Introducing C# Programming Introduction. Themes & Control Skin Unit 5 ASP.
Authorization and Roles. Web Service.NET Application Unit 10 Security The ASP. Services and Complex Data Types.Unit 8 Web Services Introduction to Web Services. The Web Services Description Language (WSDL). Web. Forms Authentication. Profile. Cryptography. Testing a Web Service. Your First Web Service. Membership. Client. IIS 6.0).0. Web Service Discovery – DISCO. A Simple Web Service. Windows.NET Security Model. Web Service Clients. Custom Membership Provider 76 . Web Services and Code-Behind. Deploying Your ASP. A brief overview of Web Service Standard Unit 9 Website Deployment Internet Information Services (IIS). Authentication. Managing Application Pools in IIS 6. Creating Application Pools (IIS 6. Web Service Proxies. Discovery – UDDI.0 Architecture (IIS 6.0).
Proof Techniques: Unit 4 Graphs and Binary Trees Introduction. Trees. Conversion from NDFA to DFA. Moore and Mealy Machines: Unit 8 Further Problems on DFA and NDFA Introduction. Non-Deterministic Finite Automata. Definitions and Examples. Classification of Grammars: Unit 6 Deterministic Finite Automata Introduction. Sequences and Strings. Recursive Functions. Transition System (Transition graph). Problems on NDFA. Problems on DFA. Equivalence Relations. Sets and Cartesian product of sets. Isomorphism. Closure Relation: Unit 2 Recursive Functions. Basic Terms. Difference between DFA and NDFA 77 . Grammars and Languages. Language accepted by a NDFA. Matrix Representations. Deterministic Finite Automaton (DFA). Language accepted by a DFA: Unit 7 Non Deterministic Finite Automata Introduction. Integer Functions. Rooted Tree: Unit 5 Formal Languages and Grammars Introduction. Growth Function: Unit 3 Methods of Proof Introduction.MC0082(A) – Fundamentals of Theory of Computer Science Unit 1 Mathematical Preliminaries for Computer Science Introduction. Functions and Relations. Strings and Growth Functions Introduction.
Derivations. CFG for various types of CFL. Applications of Pumping Lemma: Unit 11 Context Free Grammars Introduction. Pumping Lemma. Ambiguous Grammar: 78 .Unit 9 Regular Expressions and Regular Languages Regular expressions. Closure Properties of Regular Sets. Regular Expressions accepted by the Language. Finite Automaton from Regular Grammar. Regular Grammar from Finite Automata Unit 10 Properties of Regular Languages and Pumping Lemma Introduction.
MC0082(B) –Theory of Computer Science Unit 1 Mathematical Fundamentals for Computer Science Introduction. Moore and Mealy Machines: Unit 7 Regular Expressions and Regular Languages Introduction. Deterministic Finite Automata (DFA). Walks and Paths. Recursive Functions. Applications of Pumping Lemma: 79 . Functions and Relations. Language accepted by a DFA: Unit 6 Nondeterministic Finite Automata (NFA) Introduction. Grammars and Languages. Pumping Lemma. Regular Expressions accepted by the Language. Basic Terms. Nondeterministic Finite Automata. Transition System (Transition graph). Trees. Types of Grammar: Unit 5 Deterministic Finite Automata (DFA) Introduction. Directed Graphs: Unit 4 Grammar and Formal Languages Introduction. Equivalence Relations . Construction from NFA to DFA. Strings and Growth Functions: Unit 2 Proof Techniques Introduction. Finite Automata from Regular Grammar. Closure Properties of Regular Sets. Regular expressions. Binary Trees. Proof Techniques Unit 3 Trees and Binary Trees Introduction. Language accepted by a NFA. Graphs. Sets and Properties. Regular Grammar from Finite Automata: Unit 8 Regular Languages-Properties and Pumping Lemma Introduction.
Deterministic and Non-deterministic PDA: Unit 11 Context Free Languages . Applications of Pumping Lemma for CFL.Construction Introduction. Design or Construction of a Turing Machine: 80 . CFG for various types of CFL. Definition of PDA and Moves. Turing Machine Model. Graphical Representation.Unit 9 Context Free Grammars Introduction. Ambiguous Grammar: Unit 10 Pushdown Automata (PDA) Introduction.Properties Introduction. Construction of Pushdown Automata. Derivations. Pumping Lemma. Language Accepted by a Turing Machine. Closed Properties of CFL Unit 12 Turing Machines.
Object oriented systems development methodology. Inheritance. Consumer-producer association. Why We Model. The Booch Methodology. Object persistence. Prior to Industry Convergence. Scope of the UML. An object-oriented philosophy. Objects are grouped in classes. Rumbaugh et al. Case Study: A payroll program. Polymorphism. Objectoriented systems development: A use case approach. Object relationships and associations. Building high-quality software. Methodologies. The Unified Approach Unit 5 UML Summary Overview. Attributes: Object state and properties. Reusability: Unit 4 Object Oriented Methodologies Introduction. Frameworks. Advantages of Object Orientation. Motivation to Define the UML. Patterns.MC 0083 Object Oriented Analysis and Design using UML Unit 1 An Overview of Object-Oriented Systems Development Introduction. Object and Identity. The object-oriented approach. Static and dynamic binding. Primary Artifacts of the UML. UML-defining Artifacts.‘s Object Modeling Technique. Goals of the UML. Industry Trends in Software. Advanced topics. Class hierarchy. Aggregation and object containment. Objects respond to messages. Outside the Scope of the UML. Two orthogonal views of the software. Objects. Multiple inheritance. Features of the UML 81 . The software development process. Object behavior and methods. Overview of the Unified Approach (UA): Unit 2 Object Basics Introduction. The Jacobson et al. Meta classes Unit 3 Object Oriented Systems Development Life Cycle Introduction. Comparing UML to Other Modeling Languages. Development Project Artifacts. Encapsulation and information hiding. Structured Approach.
Implementation diagrams: 82 . Package Structure Levels of Formalism. Association. Composition. and Generalization. Four-Layer Meta model Architecture. Multiplicity and Qualifier. and Label. Data Types: Unit 7 Behavioral Elements Behavioral Elements Package. Core. Model Management Package. Mechanisms. Invisible Hyperlinks and the Role of Tools String. Note. Properties. Utility and Metaclass. State Machines. Subsystem. Drawing Paths. Type and Implementation Class. Naming Conventions and Typography. Foundation Package. Binary. Association Class and N-ary Association. Constraint and Comment. Enumeration. Object and Composite Object. (Template). Stereotype Declaration and Powertype. Interfaces and Parameterized Class. and Association End. Class Pathnames.Unit 6 UML Architecture and Foundation Language Architecture and Language Formalism. Attribute and Operation. Element. Extension. Model. Keywords. Dependency and Derived Element: Unit 10 Other UML Diagrams Use Case Diagrams. Collaborations. Interaction Diagrams. Name Compartment and List Compartment. Collaboration Diagrams. Nested Class Declarations. Activity Graphs. General Extension Mechanisms. Stereotypes: Unit 9 Static Structure Diagrams Class Diagram and Object Diagram. Bound Element. Common Behavior. Activity Diagrams. Graphs and Their Contents. Type-Instance Correspondence. Expression. Sequence Diagram. Name. State chart Diagrams. Use Cases. Model Management: Unit 8 UML Notation Guide Diagram Elements. Link. Accessing or Importing a Package. Association.
Stereotypes and Notation. Introduction. Simple visitor Example: Unit 13 Object Constraint Language Specification OCL PART – 1 Overview. UML Profile for Business Modeling. Introduction. Activity Diagrams. Objects and Properties: Unit 14 Object Constraint Language Specification OCL PART – 2 Collection Operations. Implementation diagrams: Unit 12 UML Example Profiles UML Profile for Software Development Processes. Summary of Profile. Grammar: 83 . Stereotypes and Notation. Basic Values and Types. Introduction. Relation to the UML Metamodel. Summary of Profile. The Standard OCL Package.Unit 11 UML Diagrams – Part II State chart Diagrams. Predefined OCL Types. Example for Existence Dependency and classes found in Business.
Hierarchical. COCOMO model. Software Cost Estimation Methods. Cost Estimation Guidelines. Comparison of Methods. Process. Automated Tools 84 . IT and Organizational Structures. Product. Networked Organizational Structure.MC 0084 (A) Software Project Management and Quality Assurance Unit 1 An Introduction to Software Development Organization and Roles Introduction. T-Form Organization. Job Roles in Software Development: Unit 2 Overview of Project Management Introduction to Software Project Management. Capital budgeting. Project Communication. Flat Organizational Structure. Project Management activities. The Intermediate COCOMO Model Introduction to COCOMO II. Software Cost Estimation. Tasks in Project Planning. Matrix Organizational Structure. Gantt Chart. Stakeholders. NPV. ROI. Project charter. Payback models: Phases. Project Manager. Development Life cycle models. Budgeting. Organizational Structures. Project. Project Development Management Associations Unit 3 Project Planning Introduction. Scheduling Techniques. Critical Path Method. Statement of Work (SOW). A generic project model: Unit 4 Estimation and Budgeting of Projects Introduction. The Basic COCOMO Model. Factors influencing Project Management. The Management Spectrum – People. Project Unit 5 Project Scheduling Introduction. PERT Technique. Organizational Structure. Work Breakdown Structures (WBS).
An Assessment of Team Organizations. Goals of SCM: Unit 8 Team Development and Conflict Management Introduction.2: Nokia software factories. Software Configuration Management. Identification of objects in the Software Configuration.Unit 6 Risk Management Introduction. Types of standards. Baselines. Conflict management Unit 9 Introduction to Software Quality Assurance Introduction. Organization. Creating the Software Quality Assurance Plan: Unit 10 Project Closure Introduction. Sample closure analysis report 85 . Quality. Risk categories. Goals of Software Assurance. Case study: Open-source development team organization. Organization. Closure Analysis Report. Team discipline. Performing Closure Analysis. The Role of Closure Analysis. Software Configuration Items. Risk Components and drivers. Effective Risk Management. Centralized-Control Team Organization. Software Configuration Management process. Risk Management Activities as applied to project management. Software Quality Assurance Activities Software qualities. Version Control Status Reporting. Project Closure Analysis. Standards and Procedures. Aids for Risk Identification. Formal Technical Reviews. Supportive activities involved in the software life cycle. Case study 8. Concepts of Risks and Risk Management. Mixed-Control Team Organization. Cost of quality. Risk Prioritization: Unit 7 Configuration Management Introduction. Self Assessment Questions. Decentralized-Control Team.
Control Hierarchy. Modularity. System Testing . IEEE recommended steps for process improvement. Metrics and Indicators. Project Metrics. Roles in Software Testing Unit 4 Software Process and Project Metrics Introduction.Advanced Software Project Management and Quality Assurance Unit 1 Project Monitoring and Controlling Introduction. Evolution of Software Design. Testing Life Cycle. Measure. Why use Metrics?. Integration Testing . Stress Testing . Control Structure Testing. Boundary Value Analysis. Flow Graph Notation. Big Bang. S/w validation. Alpha and Beta Testing. Cohesion. Software Design Process. Top-down Integration . Unit Test Considerations . Performance Testing . Design Concepts. Design Principles. Manual Testing. Automated Testing. Functional Independence. Validation Test Criteria S/w. Earned Value Analysis (EVA). Bottom-up Integration. Steps to Process Improvement. Information Hiding. Coupling: 86 . Structural Partitioning. Metrics for Software Quality Unit 5 Software Design and Principles Introduction. Verification and Validation. Refinement. Abstraction. Cyclomatic Complexity. Software Measurement . Software Procedure. Steps for Debugging . List of Testing Tools: Unit 3 Software Testing Strategies Introduction. Project Status Reporting.MC 0084 (B) . Advantages and Disadvantages of White Box Testing. Recovery Testing . Process Metrics. Configuration review. Cause – Effect Graphing Techniques. Deriving Test Cases. Unit Testing. Debugging. Software Architecture. Data Structure. Design and Software Quality. Basis Path Testing. Black Box Testing Equivalence Partitioning. White Box Testing Techniques. Project Metrics. Security Testing . Project Communication Plan & Techniques. Six Sigma: Unit 2 Testing Techniques Introduction. Types of Software Testing. Effective Modular Design.
Formal Specification Languages. Cleanroom Design: Unit 7 Software Quality Assurance Introduction. Integrated CASE Environments. Growing problems of software maintenance.Unit 6 Clean Room Software Engineering Introduction. Mathematical Preliminaries. Functional Specification. Architecture of CASE Environment. SEI – Capability Maturity Model. Black-Box Specification. Technical Problems of Reengineering. Mathematics in Software Development. The Ten Commandments of formal languages Unit 10 Re-Engineering Introduction. Comparison between ISO & SEI CMM. CASE support in Software Life Cycle. Other Standards and Initiatives: Unit 8 CASE (Computer Aided Software Engineering) Tools Introduction . Standards. ISO Standards for Software Organization. The Cleanroom Strategy. Redevelopment or Reengineering. Steps for CASE Tool Implementation. Software Qualities. Business Process Reengineering. Terminology of Software Reengineering. What Makes Cleanroom Different?. Classification of CASE Tools. Software Reengineering Process Model. CASE Repository Unit 9 Formal Methods Introduction. Clear-Box Specification. State-Box Specification. Software Quality Assurance Activities. 87 .
Load – Sharing Approach. Parameter Passing. Process Addressing. DSM – Design and Implementation Issues. Complicated RPC. Call. Transparency of RPC. Distributed Computing System Models. Issues in IPC by Message Passing. Distributed Algorithms. Semantics. 88 . Fixed Distributed – Server Algorithm. Centralized – Server Algorithm. Clock Synchronization Algorithms. Thrashing. Deadlock. Task assignment Approach. Synchronization. 4. Issues in Designing Distributed Operating Systems.7 Memory Consistency models. Election Algorithms. Marshaling Arguments and Results. Memory Coherence (Consistency) Models.MC 0085 Advanced Operating Systems (Distributed Systems) Unit 1 Introduction Distributed Computing Systems. Implementing Sequential Consistency. STUB Generation. Implementing under RNMBs Strategy. Unit 6 Resource Management Introduction. Distributed Computing Environment. Distributed Operating Systems. Server Management. Unit 2 Message Passing Introduction. Dynamic Distributed Server Algorithm. Features of Message Passing. Load – Balancing Approach . Advantages of Distributed Systems. Failure Handling. RPC Messages. Granularity – Block Size. Event Ordering. The RPC Model. Communication Protocol for RPCs. Structure of Shared Memory Space in a DSM System. Unit 3 Remote Procedure Calls Introduction. Buffering. Unit 4 Distributed Shared Memory Introduction. Distributed Shared Memory Systems (DSM). Desirable Features of a Good Global Scheduling Algorithm. Unit 5 Synchronization Introduction. Security. Mutual Exclusion. Implementation of RPC Mechanism. Clock Synchronization. Group Communication. Client-Server Binding.
File Access Semantics. Fundamental Terminologies and Concepts.Unit 7 Process Management Introduction. Desirable Features of a Good Naming system. The Key Challenges of Distributed Systems. Name Caches. Design Principles. Process Migration. Server‘s Perspective Implementation. Caching. Digital Signatures. Naming and Security. Access Control. Human – Oriented Names. Unit 9 Naming Introduction. Replication. Ceph. System Oriented Names. Potential attacks to Computer Systems. Unit 8 Distributed File Systems Introduction. Client‘s Perspective: File Services. Authentication. Stateful Versus Stateless Servers. 89 . Cryptography. Threads. Object – Locating Mechanisms. Unit 10 Security in Distributed Systems Introduction.
Unit 4 . Unit 2 . Imaging in the Visible and Infrared Bands.Image Enhancement Introduction . Regions and Boundaries. A Simple Image formation Model. Edge Crispening: Linear Technique. Non Linear Noise Cleaning.MCA 6th Semester MC0086 . Some Basic Relationships between Pixels: Neighbors of a Pixel. Image Sensing and Acquisition. Zooming and Shrinking Digital Images. Image Acquisition using Sensor Strips. Statistical Differencing. Brightness Adaptation and Discrimination. Image Acquisition using a Single Sensor.Image Sampling and Quantization Introduction. Multispectral Image Enhancement. Aliasing and Moiré Patterns.Digital Image Processing Unit 1 Digital Image Processing – An Introduction Introduction. Noise Cleaning: Linear Noise Cleaning. Image Acquisition using Sensor Arrays. Spatial and Gray-Level Resolution. Imaging in the Microwave Band. Adjacency. Elements of Visual Perception: Structure of the Human Eye. X-ray Imaging. Linear and Nonlinear Operations. Unit 3 . Pseudo Color. False Color. Basic concepts in Sampling and Quantization: Representation of Digital Images. Imaging in the Radio Band. 90 . Image formation in the Eye. Contrast Manipulation : Amplitude Scaling. Components of an Image Processing System. Light and the Electromagnetic Spectrum.Digital Image Fundamentals Introduction. The Origins of Digital Image Processing. Connectivity. Fundamental Steps in Digital Image Processing. Color Image Enhancement: Natural Color Image enhancement. Imaging in the Ultraviolet Band. Distance measures. Examples of Fields that use Digital Image Processing: Gamma-ray Imaging. Histogram Modification.
Morphological algorithm operations on binary images: Shrinking. Second-Order Derivative Edge Detection. Properties of Dilation and Erosion. Thinning. Texture Definition. Wiener Filter. Thickening. Line and Spot models. Edge Detection Methods. Detection of Discontinuities: Point Detection. Unit 8 . Photographic Process Models: Monochromatic Photography. Unit 6 . Color Edge Detection. Texture Features: Fourier Spectra Methods. 91 . Autocorrelation Methods. Optical system Models. Line Detection. Edge. Continuous Image Spatial Filtering Restoration: Inverse Filter. Morphological algorithm operations on gray scale images: Gray Scale Image Dilation and Erosion. Indirect Estimation Methods. Unit 7 . Transform Coefficient Features. Global processing via Graph-Theoretic Techniques. Blind Image Restoration: Direct Measurement Methods. Edge Detection.Image Segmentation 1 Introduction.Morphological Image Processing Introduction. Global processing via the HOUGH transform.Edge Detection Introduction. Close and Open. Subtractive operators. Basic operations: Dilation. Gray Scale Image Close and Open Operators.Image Feature Extraction Introduction. Edge-Fitting Edge Detection. Amplitude Features. Line and Spot Detection. Color Photography. Image Feature Evaluation. Hit-or-miss transformation: Additive operators.Unit 5 .Image Restoration Introduction. Unit 9 . Visual Texture Discrimination. Edge Linking and Boundary Detection: Local Processing. General Image Restoration Models. First-Order Derivative Edge Detection: Orthogonal Gradient Generation. Skeletonizing. Erosion. Luminance Edge Detector Performance: Edge Detection Probability.
Discrete Wavelet transform in one dimension. Perimeter and Area Measures. Scaling functions . Shape Orientation Descriptors. Distance. Image Pyramids. Unit 11 . Wavelet transforms in two dimensions: Standard decomposition.Image Segmentation Introduction. Non-Standard decomposition. Fourier Descriptors. Unit 12 . 92 . Perimeter and Area Measurements: Distance Measures. Global Thresholding.Wavelets and Multi Resolution Processing Introduction. Adaptive Thresholding. Wavelet functions. Thresholding: Foundation.Unit 10 . Haar transform.Continuous Wavelet Transform. Region-Based Segmentation: Basic Formulation.Shape Analysis Introduction. Region Growing. The Role of Illumination. Topological Attributes. Region Splitting and Merging. Series Expansion: Windowed Fourier transform. Thinning and Skeletonizing. Subband coding. Spatial Moments: Discrete Image Spatial Moments. Multiresolution processing and wavelets.
IP Routing Table. Classical IP over ATM. IP Routing: Direct Routing. Basic NAT. Network Address Port Translation (NAPT). The IP Address Exhaustion Problem. Internet Control Message Protocol (ICMP): ICMP Messages. Unit 4 . Broadcasting. NAT limitations. Point-to-Point Protocol (PPP). Unit 2 .Internetworking with TCP/IP Unit 1 . Integrated Services Digital Network (ISDN). Basic NAT translation mechanism. Frame relay: Frame Format.MC0087 . ARP Detailed Concept. Serial Line IP (SLIP). Fragmentation. The TCP/IP Protocol Suite: Network Interface Layer. DHCP Lease Renewal Process. Multicasting. Intranets: Private IP Addresses.25. Internet Protocol (IP): IP Datagram. X.Internetworking Protocols-1 Introduction. Reverse Address Resolution Protocol (RARP).Internetworking Protocols-2 Introduction. Unit 3 . IP Addressing.Architecture of TCP/IP Introduction. Ethernet and IEEE 802 Local Area Networks (LANs). IP Datagram Routing Options. Any casting. Reusing a previously allocated network address. Internet Layer. IP Routing Algorithm. Address Resolution Protocol (ARP): ARP Overview. Asynchronous Transfer Mode (ATM): Address Resolution. Dynamic Host Configuration Protocol (DHCP): DHCP Message Types. Interconnect issues. Network Address Translation (NAT): Traditional NAT. Methods of Delivery: Unicast. The Internet Standard Process. Application Layer. Transport Layer. IP Datagram Format. Bootstrap Protocol (BOOTP). Classless Inter-Domain Routing (CIDR): CIDR implementation. 93 .Network Interfaces Introduction. Indirect Routing. TCP/IP Terminology. Fiber Distributed Data Interface (FDDI).
Distance vector routing. Center-based tree algorithm. TCP Congestion Control Algorithms. Link state routing. Multicasting between network segments. RIP-2 limitations. Sockets. Guaranteed Service. OSPF stub areas. User Datagram Protocol (UDP): UDP Datagram Format. IBGP and EBGP Path selection. The multicast backbone: MBONE routing. PIM sparse mode. Why QoS?. Multicast OSPF (MOSPF). Enhanced Interior Gateway Routing Protocol (EIGRP): Features of EIGRP.Routing Protocols Introduction. Open Shortest Path First (OSPF): OSPF terminology. Routing Information Protocol (RIP): RIP packet types. Unit 8 . Calculating distance vectors. OSPF neighbor state machine. Autonomous systems. Multicast applications. DVMRP tunnels.Unit 5 . Multicast addressing: Multicasting on a single physical network. Neighbor communication. Border Gateway Protocol (BGP): BGP concepts and terminology. OSPF route. Path vector routing. IGMP operation. Building and maintaining multicast delivery trees. RIPng for IPv6: Differences between RIPng and RIP-2.Transport Protocols Introduction. IP Routing: Static routing. Integrated Services 94 . Exterior Gateway Protocol (EGP).Quality of Service Introduction. The Resource Reservation Protocol (RSVP). Hybrid routing. Integrated Services: Service classes. Multicast forwarding algorithms: Reverse path forwarding algorithm.IP Multicast Introduction. Multicast delivery tree. EIGRP packet types. RIP packet format. Routing Information Protocol Version 2 (RIP-2): RIP-2 packet format. OSPF route summarization. RIP modes of operation. Interconnecting multicast domains: Multicast Source Discovery Protocol (MSDP). Multicast routing protocols. Controlled Load Service. Distance Vector Multicast Routing Protocol (DVMRP): Protocol overview. Ports and Sockets: Ports. Transmission Control Protocol (TCP): TCP Concepts. RIP limitations. redistribution. Internet Group Management Protocol (IGMP): IGMP messages. Protocol Independent Multicast (PIM): PIM dense mode. Unit 6 . Unit 7 . UDP Application Programming Interface. Border Gateway Multicast Protocol.
Secure Sockets Layer (SSL): SSL overview. SSL protocol. IP Security Architecture (IPSec): Concepts. Network Virtual Terminal. Security exposures and solutions: Common attacks against security. Integrated Services (Intserv) over Diffserv networks. The Distributed Name Space. Mapping domain names to IP addresses. Telnet Command Structure. Differentiated Services: Differentiated Services architecture.TCP/IP Security Introduction. Solutions to network security problems. Principle of Operation. Unit 10 . Network security policy. Telnet: Telnet Operation. Types of firewalls. Secure Electronic Transaction (SET): SET roles. Combining IPSec protocols. Kerberos authentication and authorization system: Assumptions. Fully Qualified Domain Names (FQDNs): Generic Domains. Firewalls: Firewall concept. Secure Shell (1 and 2): SSH overview. Remote Execution Command Protocol (REXEC and RSH). Naming. SOCKS: SOCKS Version 5 (SOCKSv5). Kerberos authentication process. The SET certificate scheme. Using the DNS Uniform Resource Identifiers (URI). Internet Key Exchange (IKE) protocol. Authentication Header (AH). Option Negotiation. Domain Name Server Operation.Remote Execution Introduction. Domain Name Resolver Operation. Domain Name Stub Resolver. Unit 11 . Encapsulating Security Payload (ESP). Domain Name System Resource Records. 95 . Differentiated Service Domains. Virtual private networks (VPNs) overview: VPN introduction and benefits.outlook. Mapping IP Addresses to Domain Names: Pointer Queries. Telnet Basic Commands. Implementations of security solutions. SET transactions.Domain Name System Introduction. Components of a firewall system. Unit 9 . Country Domains. Domain Name Resolution: Domain Name Full Resolver. Domain Name System Messages: Message Compression.
Mail Applications Introduction. Simple Mail Transfer Protocol: How SMTP Works. TFTP Packets. FTP Operations.FTP and TFTP Introduction. Security Issues. Unit 14 . Trivial File Transfer Protocol (TFTP): TFTP Usage. 96 . SMTP Messages. File Transfer Protocol (FTP): An overview of FTP.Unit 12 . Internet Message Access Protocol (IMAP4): Fundamental IMAP4 Electronic mail models. Session Description Protocol. Control Protocol. Mail Header Format. Stream Control Transmission Protocol. Display devices and control gateway. Sample SIP message flow. Data Modes. CODEC (encode and decode). IP (TV) transport. SMTP Mail Transaction Flow. IPTV overview. IMAP4 messages.Voice over Internet Protocol Introduction. TFTP Multicast Option. Mail Exchange. Media Gateway Control Protocol (MGCP). VoIP functional components.261. Functional components: Content acquisition. Real-Time Transport Protocol (RTP). An Additional Example. Real-Time Moving Picture Experts Group (MPEG) standards. SIP protocol architecture. Session Initiation Protocol (SIP) technologies: SIP request and response. IPTV technologies: Summary of protocol standards. Protocol Description. Post Office Protocol (POP). The SMTP Destination Address. Unit 13 . H. IMAP4 states.
Data Warehousing and Data Mining – Relation. Noisy Data. Data Mining and Statistics. Data Mining Technologies.Introduction to Data Mining Introduction. Unit 2 . Data Mining and knowledge Discovery. Business Intelligence Infrastructure. Snowflake. Unit 5 . OLAP Operations in the Multidimensional Data Model. A Multidimensional Data Model: Stars. Data Transformation. Dimensionality Reduction. Discretization and Concept Hierarchy Generation: Segmentation by Natural Partitioning. Business Intelligence Tools. Data Mining Techniques: Association Rules. Unit 4 . Data Cleaning: Missing Values.Data Mining Techniques – An Overview Introduction. Introducing Concept Hierarchies. and Fact Constellation Schemas. Data Mining and OLAP. Unit 3 . Data Warehouse Architecture: The Design of a Data Warehouse: A Business Analysis Framework. 97 . A Three – Tier Data Warehouse Architecture. Data.Data Mining Unit 1 . and Fact Constellations. Regression. Snowflakes. Data Mining Vs DBMS.MC 0088 . Inconsistent Data. Meaning and Working of Data Mining. Business Intelligence VS Data Mining. Data Integration and Transformation: Data Integration. Neural Networks. Types of OLAP Servers: ROLAP versus MOLAP versus HOLAP. Examples for Star. Data Reduction: Data Cube Aggregation. Numerosity Reduction.Data Preprocessing Introduction.Business Intelligence Introduction to Business Intelligence. Clustering. Data Mining Software.Data Warehousing and OLAP Introduction. Information and knowledge. Data Warehouse: Operational Database Systems versus Data Warehouses. Classification. Business Intelligence VS Data Warehouse.
Hierarchical Clustering. Approaches to Mining Multilevel Association Rules. Agent Based and Data Base approaches. Partition Algorithm. Pincers – Search Algorithm. Classification and Prediction. Dynamic Itemset Counting Algorithm. Mining Multidimensional Association Rules Using Static Discretization of Quantitative Attributes. Unit 8 . Constraint – Based Association Mining. Clustering and Segmentation Software.Associations Rule Mining Introduction. Methods to Discover Association Rules.Web Mining Introduction. Tree Pruning. Comparing Classification Methods. Text Mining. Cluster Analysis. Mining Quantitative Association Rules. Clustering Methods: K-means. Applications of Web Mining. Divisive Clustering. Agglomerative Clustering. Web Structure Mining. Checking for Redundant Multilevel Association Rules. Market Basket Analysis. Terminologies.Classification and Prediction Introduction. Evaluating Clusters. Unit 10 . Unit 7 . Clustering. Multimedia Data Mining. Mining Multilevel Association Rules from Transaction Databases: Multilevel Association Rules. Mining Multidimensional Association Rules from Relational Database and Data Warehouses: Multidimensional Association Rules. Categories of Web Mining: Web Content Mining.Multimedia and Text Mining Introduction.Clustering Introduction. Extracting Classification Rules from Decision Trees.Unit 6 . Association Rule Mining: A Road Map. From Association Analysis to Correlation Analysis. Web Usage Mining. Issues Regarding Classification and Prediction: Preparing the Data for Classification and Prediction. A Priori Algorithm. Association Rule. Web Mining Software. Classification by Decision Tree Induction: Decision Tree Induction. Fp – Tree Growth Algorithm. 98 . Unit 9 .
Business Applications using Data Mining. New Applications. Unit 12 .Case Study: Data Mining Techniques in Healthcare Industry.Applications of Data Mining Introduction. Scientific Applications using Data Mining. 99 .Unit 11 .
This action might not be possible to undo. Are you sure you want to continue?
We've moved you to where you read on your other device.
Get the full title to continue listening from where you left off, or restart the preview.