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