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