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