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