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