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