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