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