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