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