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