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