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