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