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