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