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