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