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