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