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