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