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