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