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