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