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