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