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