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