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