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