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