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