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