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