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