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