SIKKIM MANIPAL UNIVERSITY OF HEALTH, MEDICAL & TECHNOLOGICAL SCIENCE (SMU) Directorate of Distance Education Department Of Information Technology

Dossier
MASTER OF COMPUTER APPLICATIONS MCA – REVISED FALL 2007

Detailed Curriculum:
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

04

02

04

02

MC0064 Basic Web Development (Internet, HTML, Style-sheets & Basics of Multimedia) MC0065 Financial Management & Accounting

04

01

B0724

Financial Management and Accounting – Edition: Fall 2007

04

01

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

04

02

04

02

MC0069 System Analysis & Design (SAD) MC0070 Operating Systems with Unix

04 04

01 02

1. B0682 1. Operating Systems – Edition: Fall 2007 2. B0683 2. Advanced Operating System with UNIX – Edition: Fall 2007

1

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

04

01

MC0073 System Programming MC0074 Statistical & Numerical Methods using C++ MC0075 Computer Networks

B0811 B0812

04 04

01 01

1.B0813 1. Computer Networks – Edition: Fall 2007 2.B0814 2. Advanced Computer Networks – Edition: Fall 2007 Fourth Semester

04

02

MC0076 Management Information Systems MC0077 Advanced Database Systems MC0078 Java Programming

B0901 B0882

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

B0902

Computer Based Optimization Methods (Statistics/Applied OR) – Edition: Fall 2007 Analysis & Design of Algorithms – Edition: Fall 2007

04

01

B0891

04

01

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:

2

smude. Advanced Object Oriented Analysis using UML 1. B0959 Management and Quality Assurance . Advanced Data Warehousing and Data Mining MC0089 Project 08 04 02 04 02 04 02 MC0088 Data Warehousing & Data Mining Detailed Curriculum is given on the web site (www. Data Warehousing and Data Mining 2. Theory of Computer Science – Edition: Fall 2007 MC0083 Object Oriented Analysis & Design using UML B0969 1.Edition: Fall 2007 2. B0958 1.in). Digital Image Processing MC0087 Internetworking with TCP/IP – do – 1. Fundamentals of Digital finalized Image Processing 2. Object Oriented Analysis & Design 2. TCP/ IP Protocol Suite 2. Internetworking with TCP/IP – do – 1. 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. Software Project 2.Fall 2007 2.edu. 3 .

Unit 4: Some More Data Types Floating-point Numbers. The type cast Operator . Backslash Character Constants. Concept of an Integer and Variable. A simple C program. Unit 5: Input and Output operators Computer Components. Mixed-mode Expressions. Interactive Programming. Relational and Logical operators. String Constants. Library functions. Bitwise operators. The type char. Formatted input. The size of operator. More simple C programs. Assigning values to variables. Declaring an Integer Variable. Precedence of operators. Converting Integers to Floating-point and vice-versa. The Conditional operator. Formatted output. Variables and Declarations Constants: Integer Constants. The increment and decrement operators. Unit 2: Constants. Unit 3: Operators and Expressions Arithmetic operators. The gets() and puts() functions. The rules for naming Variables. Basic structure of C programs. Character Constants. Character Input and Output.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. Unary operators. Real Constants. 4 .

5 . Book 2: Advanced Programming in C Unit 1: Pointers Basic pointer operations. The continue statement. Unit 8 Functions Function Basics. Unit 11: Pointers. Recursion. The do…while loop. The if statement. Unit 10: Arrays and Strings One Dimensional Arrays. Passing Arrays to Functions. Pointers and Strings.Unit 6: Making Decisions in C The goto statement. Pointers and two-dimensional arrays: Arrays of Pointers. Structures and Unions Basics of Pointers. Structures and functions. Nesting of if statements. Pointer Subtraction and Comparison. Null pointers. Automatic or local variables. The switch statement. Strings. Static variables. The break statement. Arrays of structures. Global variables. Unions. Pointers and one-dimensional arrays: Pointer arithmetic. Unit 7: Control Statements The while loop. Basics of structures. Function Prototypes. Unit 9: Storage Classes Storage Classes and Visibility. Multidimensional Arrays. The nesting of for loops. Pointers as Function Arguments. Similarities between Pointers and One-dimensional arrays. The if-else statement. The conditional expression. Function Philosophy. External variables. The for loop.

Pointers to structures. Conditional Compilation. The Concept of linked list: Inserting a node by using Recursive Programs. Deleting the Specified Node in a Singly Linked List. Nesting of Macros. Sorting and Reversing a Linked List. 6 . Applications of Queues. Unit 3: Dynamic memory allocation and Linked list Dynamic memory allocation: Allocating Memory with malloc. Command line arguments. Applications of Stacks. Unit 5: The Preprocessor File Inclusion. Stack as an Abstract Data Type: Array Implementation of a Stack. Abstract Data Types.Unit 2: Structures and Unions Basics of structures. Implementation of a Queue Using Linked List Representation. Unit 4: File Management Defining and opening a file. Reallocating Memory Blocks. Freeing Memory. Self-referential structures. Unit 6: Advanced Data Representation Exploring Data Representation. Error handling during I/O operations. Arrays of structures. Closing files. Macro Definition and Substitution: Macros with Arguments. Implementation of a Stack Using Linked Representation. Queue as an Abstract Data Type: Array Implementation of a Queue. Input/Output operations on files: Predefined Streams. Allocating Memory with calloc. Circular Queues. Structures and functions. Pointer Safety. Unions. Random access to files.

Hexadecimal to Octal Conversion. NOR Logic. Binary to Octal Conversion. Distributive Law. Logical Gates and Truth Tables: NOT Logic. Binary Coded Decimal (BCD) Numbering system: BCD Addition. 7 . Binary Logic Functions. The Hexadecimal Numbering System: Hexadecimal to Binary Conversion. 1‘s and 2‘s Complements. NOR Gate as Universal Gate. Binary Arithmetic: Binary Addition. Octal to Decimal Conversion. Sum of Weight Method. Boolean Rules and Laws: Commutative law. Ex – NOR Logic. Repeated Multiplication. Binary Subtraction. Complementary numbering systems. Hexadecimal to Decimal Conversion. Repeated Division Method. Binary Multiplication. Product of Sum Form. Decimal to Octal Conversion. Repeated Division Method. Octal to Binary Conversion. The Binary Numbering System: Counting in Binary. Boolean Rules. AND Logic. Decimal to Binary Conversion: Sum of Weight Method. Computer Organization &Architecture MC0062 Book 1: Digital Systems Unit 1: Number Systems The Decimal Number System. Repeated Multiplication. Realization of Boolean Functions using Universal Gates. Binary subtraction using 1‘s complementary Method. Sum of Weight Method. Decimal to Octal Conversion. Canonical Logic Forms: Sum of Products Form. Repeated Multiplication.ii) Digital Systems.The Octal Numbering System: Counting in Octal. OR Logic. Timing Diagrams and Synchronous Logic. Unit 2: Boolean Algebra Addition and Multiplication in Boolean algebra. Binary to Decimal Conversion. DEMORGAN‘s Theorem. Binary Division. NAND Logic. Unit 3: Combinational Logic Realization of switching functions using logic gates. Binary subtraction using 2‘s complementary Method. Universal Gate: NAND Gate as Universal Gate. Associative Law. Repeated Division Method. Ex – OR Logic. Realization of Combinational circuits from the truth table. Binary to Hexadecimal Conversion.

Edge triggered J-K Flip-Flop (J-K FF).Counters: Two bit Synchronous Binary Counters. Parallel Binary Adders. BCD Adders. Asynchronous inputs: PRESET and CLEAR. Down. A Four-bit Synchronous Binary down-counter. Decoders: Basic Binary Decoder. Prime implicant chart. 8 . IC 7490 – A Decade Counter. Gray code to Binary Conversion. Negative edge triggered 2-bit ripple up/down-counter. Gray Code. Parity Generators and Parity Checkers: Parity. Binary Comparator or Magnitude Comparator.Unit 4: Combination logic realization Karnaugh Map or K – Map. Octal to Binary Encoder. Multiplexers as logic function generators. A Three-bit Synchronous Binary Upcounter. Gated Latches: Gated S-R Latches. Binary to Gray Conversion. Full adder. Active Low S-R Latch ( NAND Gate S-R Latch). Binary Subtractor: Half subtractor.Counters: Two bit Synchronous Binary Counters. Full subtractor. Unit 6: Latches and Flip Flops Latches: The S-R Latch: Active HIGH S-R Latch (NOR gate S-R Latch). Integrated Circuit Asynchronous Ripple Counter: IC 7493 – A 4-bit Binary Counter. Logic expression simplification with grouping cells. Gated D-Latch or D-flip-flop. Unit 8: Synchronous Counters Up. Plotting a Boolean expression. Code conversion: BCD to Binary conversion. Master-Slave J-K Flip Flop. Quine McClusky Method: Prime implicants. A Three-bit Synchronous Binary down-counter. Cascading of Ripple Counter. Unit 7: Asynchronous Counters Asynchronous Counters: Negative edge triggered 2-bit ripple Up-counter. Synchronous Decade Up-counter. Negative edge triggered 2-bit ripple Down-counter. Edge triggered D-Flip-Flop (D-FF). Priority Encoder: Decimal to BCD priority encoder. Multiplexers or Data Selectors. A Four-bit Synchronous Binary Up-counter. Detecting an Error. 3 line to 8 line Decoder. Unit 5: Analysis and Design of Combinational Logic Binary adders: Half adder. Encoders: Decimal to BCD encoder. Demultiplexers. Edge triggered Flip-Flops: Edge triggered S-R Flip-Flop (S-R FF). Design of modulus counters.

Serial out Shift operation – 3 register combination. Von Neumann Architecture. Basic instruction Cycle state diagram. Dual Slope Integrator Type. Parallel In. 9 . Instruction cycles: Basic instruction cycle. Serial In. Analog to Digital Converters (ADC): Flash Type ADC. Input/Output and I/O Interface. Unit 10: Data Converters Digital to Analog Converters (DAC): Binary Weighted Input Method. Arithmetic Logic Unit. Parallel out Shift Register. Practical Considerations of ADCs: Resolution. Memory Unit. Register Organization of different machine: The Zilog Z8000 machine.Control and Status Registers. CPU organization in 8085 microprocessor. Motorola 68000 machine. The R-2R Ladder DAC. Conversion Rate or Sample Frequency. CPU Organization: Fundamental Computer Architecture. 74LS395 – A Universal Shift Register: Serial in. Successive Approximation Method. Step Recovery. Ring counters. Slope Integrator Type: Single Slope Integrator Type.Unit 9: Shift Registers Shift Register Classification. Parallel out Shift Register. Serial-in. Serial In. Control Unit. Serial in. Staircase Ramp or Digital Ramp Type. System interconnection. Unit 2: CPU and Register Organization Introduction: User-visible Registers. Intel 8086 machine. Bus Structure.Program Status Word (PSW). Serial Out Right Shift Operation of 74LS395. Johnson counters. Serial Out Left Shift Operation of 74LS395. Structure of a computer system: Central processing Unit. Book 2: Computer Organization & Architecture Unit 1: Basic Structure of a Digital Computer Mechanical and Electromechanical ancestors. Serial-out shift register: Timings in Serial Shift operation.

Floating Point Numbers: Floating Point Variables. Static and dynamic memories. Subtraction.Unit 3: Interconnection Structures Types of exchange of information: Modules of a System. Another Note on Overflow. Unit 6: Memory Unit Characteristics of Memory Systems. Stack addressing. Instruction types. Unsigned Integer Multiplication: A More Efficient Method. Main Memory:Types of Random-Access Semiconductor Memory. IBM 370 Data types. Number Representations: Non-negative Integers. Bus width. Allocation of bits. Types of Operands: Data types. VAX Data types. Subroutines. Register Indirect addressing mode. Floating Point Arithmetic. Indexing. Rational Numbers. Different types of transfers. Unit 4: Instruction sets: Addressing Modes and formats. Infinite-Precision Ten's Complement. Number of addresses. Method of arbitration. Register addressing mode. I/O. Unit 5: ALU and Binary Arithmetic: Arithmetic Logic Unit. Multiplication. Real Numbers. Bus Timing. Negative Integers. Time for Floating-Point Addition. Division.The Bus Standard. Organization. Addition of Floating-Point Numbers. Base Register addressing Mode. Pipelined Floating-Point Addition. Transfer of control. Stacks & Subroutines: Stacks.Design of memory subsystem using 10 . Binary Addition. Relative addressing mode. Types of Buses . Displacement addressing mode. Instruction formats: Instruction Length. Positive Integer Multiplication. Unsigned Integer Multiplication: Straightforward Method. System Control. Bus Structure: Single Bus System. Types of Operations: Data transfer. Two Bus Organization. Arithmetic. Finite-Precision Ten's Complement. Elements of Bus Design: Bus Types. Bus Speed. Variable length instruction.Other additional addressing modes. Instruction representation. Conversion. Indirect addressing mode. Addressing Modes: Direct addressing mode. Signed Integer Multiplication. Introduction: Instruction Characteristics. Immediate addressing mode. Logical. Memory system considerations:Design of memory subsystem using Static Memory Chips. Instruction Set Design. Binary Arithmetic: Overflow in Integer Arithmetic. system control. Finite-Precision Two's Complement.

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.

11

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.

12

iii) Discrete Mathematics

(4 Credits)

MC0063

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.

13

Unit 7: Fuzzy Sets and Fuzzy Logic Fuzzy sets. Method of Repeated Squares.Book 2: Modern Applications using Discrete Mathematical Structures Unit 1: Preliminaries Sets. Uniqueness of finite Boolean algebras. Arithmetical Functions. Parity Check. Unit 3: Formal Languages Grammars and Languages. Unit 8: Graphs Preliminary Definitions and Notations. Fuzzy Relations. Algorithms. Applications to Cryptography. Non – Determinants Finite State Automaton (NDFSA). Backus – Naur Form (BNF). Unit 5: Finite – State Automata Finite State Machine. 14 . Boolean Expressions and Normal forms. Unit 6: Algebraic Codes Preliminaries. Algebraic Systems. Fuzzy Truth Qualifier. Derivation Trees. Congruence. Classical logic and Fuzzy logic. Classification of Grammars. Logical circuits and applications. Languages accepted by an automation. Turing Machine. Linear Codes. Unit 2: Theory of Numbers and Introduction to Cryptography Divisibility and Factorization. Boolean lattices and Boolean algebras. Generator Matrices. Hamming Distance. Linguistic variable. Equivalence Relations. Functions. Unit 4: Boolean Algebras and Logical Circuits Posets and Lattices.

Euler‘s Digraphs. Algorithms for Chromatic Number. Unit 10: Traversability Eulerian Graphs. Coloring and Partitioning Planar and Dual Graphs. Algorithms for Spanning Trees. Partitioning. Rooted Trees and Applications. 15 . Unit 11: Planarity. Matrix Representation of Digraphs. Path Matrix. Hamiltonian Paths and Circuits. Binary relation as a digraph.Unit 9: Trees and Algorithms Characterization of Trees. Unit 13: Directed Graphs Definitions and Examples. Circuit Matrix. Unit 12: Representations of Graphs Adjacency matrix and Incidence Matrix. Spanning Trees. Coloring. Traveling Salesman problem.

Point to-Point networks. 3 The Network Layer. User ID-Telephone Ratio. Multiple Login Facility. Internet Technologies.server model : Introduction . ISDN. ISDN Advantages. and Leased Line Connections. The Transport layer. Roles of each layer. Advantages of using star topology. Advantages and Disadvantages of LAN. Token Ring. From the Technical Angle. The Session Layer. TCP/IP Software. Different Types of Connections: Dialup Connections. Java. Media Access Control: Ethernet. Who Owns and cares for the Internet?. Metropolitan Area Networks (MANs). The seven layers in the ISO model. URLS and 16 . Jini. Network Protocols: SPX/IPX for DOS. Class B: Larger nets. The Physical layer.iv) Basic Web Development (Internet. HTML. For TCP/IP Account. E-commerce. OSI Model of ISO: Introduction. XML. Server. TCP/IP for UNIX. Address in Internet: Introduction. News servers. Support. Wireless communication. Internet Service Providers: Choosing an ISP. Owning of internet. Client. Interface simplicity. Protocol Dial-up (TCP/IP Account). The Bus. IP Addresses. ADSL. Discounts on renewal. IRC servers. How Internet Works?. Major drawbacks. Getting Connected: Accessing the internet via your local network. Roaming Facility. Style-sheets & Basics of Multimedia) MC0064 (4 credits) Unit 1: Introduction to Internet What is Internet?: Definition. Evolution of Internet. Conventional Dial-UP Shell Account. What is TCP/IP?. For Shell Account. Requirements for connections. How old is the Internet?. PPP and SLIP. FTP servers. From the practical Angle. Choosing a modem. Brochure-speak. Wide Area Networks. The Presentation layer. Local Area Networks. Cable & DSS Internet accounts. Introduction to RFC. Internet Applications. Major disadvantages. Subnet masks. Sending and Receiving messages. LAN Hardware. Internet from practical and technical angle. Who Cares for Internet?. Choosing a computer. Other Classes. Special Packages. The Domain name system and DNS Servers. Working of internet. Mail servers. Networks: Computer Networks. The Application Layer. Data link layer. The Ring. Unit 2: Connecting to Internet Client. Resource Addressing: URL (Uniform Resource Locator). Classes of Networks: Class A: over 16 million Served. Web Browser. Advantages of bus topology. DialUP or On-Demand TCP/IP link through your LAN. Class C: Addresses. Topologies: The Star.

Mail Protocols: SMTP. Introduction to URIs. Advantages. How to Access the Mail System: Ways of Accessing E-Mail. Mechanism of the web. Document overview . Internet. Describing Documents with the Head Element. Intranets vs. HTML. E-mail Networks. The individual pull-down menus are. The Web Browser's Window. Including Attributes. Definitions . Web Sound and Video Sounds. Elements of HTML Syntax. History List. XML. HOW does a web Browser works. MIME and S/MIME. Drawbacks. LANs. URLS and Port numbers. POP. Closed user groups. Relative URIs. Unit 3: Email Intranet and Internet: Introduction to intranet . Personalization of Browsers. Common ways to personalize your browser environment. Printing Displayed Pages and Forms. Basic Features of Browsers. HTTP. How does E-Mail Works?. Text. Saving Web Pages. Java and JavaScript. E-Mail Services. Basic E-Mail Functions. Interim Solutions for crisis on the net: Classless Internet Domain Routing. Difference between E-mail and paper mail. Naming Documents with the Title Element. IMAP. E-Mail Basics. Uses of Email. Evolution of WWW. WWW Servers. Common E-mail Terms. URLS. Message Body. HTML: Introduction. Understanding Internet E-Mail Addresses. Introduction.HOST names. Using E-Mail from Shell Program. Meaning and definition of email. Unit 5: Introduction to HTML What is the World Wide Web: Introduction. VBScript and ActiveX Controls. SGML. Gateways. 17 . History of HTML. Definitions. Parts of an E mail Message: Components of Email. Signature. Unit 4: Web Browsers Terminologies used with reference to web browsers: Clients and Servers. Menu Bar. Basic Structure of an HTML Document: Defining HTML Documents with the HTML Element. Emotions and Abbreviations. or CIDR. Pathnames . Applying Structure Tags. Multimedia. The Internet's next Generation of Addressing Ipng. Using Smileys. Headers. Constructs used in HTML. Fragment identifiers. WWW Browsers: Introduction. Bookmarks. Keeping Track of Your Favorite Web Sites. Adding Tags. UUCP. Reading a Web Page.

</I>. TFOOT..</BIG>.</SAMP>.CITE.</OL>.</U>...Tag: <DFN> ..</INS>.. Preformatted text: The PRE element. Controlling line breaks...</MENU>. Cells that span several rows or columns . Subscripts and superscripts: the SUB and SUP Elements.. Table Captions: The CAPTION element. The COL element. Tag: <U> .. Table directionality. Text Tags: Using Block-Level Elements to Structure the DOCUMENT. Lines and Paragraphs: Paragraphs: the P element. Tag: <SMALL> ..</B>. Tag: <DEL> . Viewing the HTML Source. Introduction to tables.. Quotations: The BLOCKQUOTE and Q elements. Sample table. Choosing Colours for Text and Links.. Controlling the overall Appearance of the page: Displaying wallpaper in the Background.</ACRONYM>.<IEM>. Tag: <INS> .. Table formatting by visual user agents: Borders and rules. Tag: <STRIKE> .. Lists: Tag: <LI>. Using Text-Level Elements. Cell margins. Presentation Controls / Text presentation Tags. Tag: <KBD> .</UL>. Tag: <DT>.. Table rendering by non-visual user agents: Associating header information with data cells. Tag: <DIR> .....Tag: <EM> . Tag: <DL> .<NAR>.</DL>. Tag. Footer.</KBD>. Column groups: the COLGROUP and COL elements: The COLGROUP element.. Two Categories of Body Elements.</STRONG>. Tag: <MENU> .Tag: <VAR> ... Unit 6: Elements of HTML Introduction.... Horizontal and vertical alignment... . Tag: < DD>. Tag: <TT> . Row groups: the THEAD. Prohibiting a line break .</DFN>.. Tag: <STRONG> . Hyphenation.Tag: <OL> ……..Table cells: The TH and TD elements. Tag: <SAMP> . HTML's Rules of Nesting.. Categorizing cells.. 18 .. Tag: <ABBR> .</DEL>.. and TBODY elements.. Attribute definitions.. <BIG> . CODE.. Table rows: The TR element. Tag: <I> ..</DIR>..</STRIKE>. Unit 7: Tables Introduction. Tag: <UL> .</ABBR> or <ACRONYM> .. Forcing a line break: the BR element .. Tag: <B> .</TT>.</SMALL>..Wrapping Your Content with the Body Element.. Elements for constructing tables: The TABLE element.

Unit 9: Frames and Style Sheets Introduction. Use id or name. Setting the initial contents of a frame . Alternate content: The NOFRAMES element. and applets. and Option elements. Anchors with the id attribute. Controls: Control types. Layout of frames: The FRAMESET element. Links and search engines. Specifying anchors and links. Object initialization: the PARAM element. Pre-selected options. Link titles. White space around images and objects. Visual rendering of a frame . Including an image: the IMG element. How to specify alternate text. Visual presentation of images. Object declarations and instantiations. The ISINDEX element. Introduction to objects. Links and external style sheets. Labels: The LABEL element. Adding a Link to your Email Address. Adding structure to forms: the FIELDSET and LEGEND elements. The FRAME element. Header style information: the STYLE element. Media types. The BUTTON element. Including an applet: the APPLET element. Giving focus to an element: 19 . The TEXTAREA element. images. Other link relationships. Notes on embedded documents. Target semantics. and applets: Width and height.Unit 8: Links and Anchors Introduction. Setting the default style sheet language. The INPUT element: Control types created with INPUT. Introduction to links and anchors: Visiting a linked resource. Unit 10: Forms Introduction. Introduction to style sheets: HTML 4 provides support for the following style sheet features. Unavailable and unidentifiable resources. Adding style to HTML. OPTGROUP Attribute definitions. Specifying target frame information: Setting the default target for links. Server-side image maps. OPTION Attribute definitions. SELECT Attribute definitions. Optgroup. Examples of forms containing INPUT controls. Inline frames: the IFRAME element. Introduction to forms. Borders. Introduction to frames. Rules for rendering objects. The FORM element. Generic inclusion: the OBJECT element. Internationalization and links. objects. The Select. Document relationships: the LINK element: Forward and reverse links. Image maps. Long descriptions of frames. Client-side image maps: the MAP and AREA elements. Global naming schemes for objects. Nested frame sets . Alignment. Inline style information. The A element: Nested links are illegal. Sharing data among frames .

Access keys. Audio (hearing). 20 . Multimedia Authoring. Themes and Styles. Overview of Multimedia Software Tools: Digital Audio. Determining Form Content: Information Issues. Interactivity Technical Design. Form submission. Challenges for Multimedia Systems. Issues in Multimedia Applications Design: (writing). Basic Layout. Usability Issues. Content Design. Multimedia Authoring Paradigms. Read-only controls . Pace and Running length. Understanding Widgets. an authoring system?. Creating Forms. Components of a Multimedia System. Animation. Make the Form Easy. Multimedia Multimedia Authoring. Music Sequencing and Notation. Unit 11: Multimedia Introduction. Disabled controls. Short checking list for hardware/software requirements. Trends in Multimedia. Selling the < form > Environment. Provide Incentives. Characteristics of a Multimedia System. Desirable Features for a Multimedia System. (interacting). Group Similar Categories.Visual Design. What is Multimedia?: Definitions . Image/Graphics Editing. Disabled and read-only controls.Tabbing navigation. Applications. Processing form data. Successful controls. Design Issues. Multimedia Systems. Scripting Graphics (illustrating). What is HyperText and HyperMedia?. Animation (wiggling). History of Multimedia Systems. Multimedia Why should you use Programming vs Authoring: Systems and Applications : What is an Authoring System? . Form submission method.

Systems of Accounting. Classification from the View point of Users. Meaning of Financial Management accounting. Classification of Liabilities. Errors affecting two or more accounts. Sources and 21 . Funds from operations. Uses and Limitations of Ratio Analysis. Suspense Account. Rules of debit and credit. Classification of Ratios: Traditional Classifications of ratios. Unit 3: Understanding Financial Statements Introduction . Rectification of Errors: Errors affecting one account.v) Financial Management & Accounting MC0065 Unit 1: Introduction to Accounting Introduction. Unit 2: Trial Balance and Rectification of Errors Introduction. Purpose and objectives of financial statements. Functional Classifications of ratios. Classification of Assets and Liabilities. Accounting conventions. Components of Fund Flow statement: Computation of changes in Working Capital. Purposes of Trial Balance. Classification of Assets. Profit and Loss Account/Income Statement. Format of ledger. Meaning and uses of financial statements: Meaning of financial statements. Meaning and format of Fund Flow Statement. Unit 5: Funds Flow Statement Introduction. Combined Ratios. Utility of journal. Ledger: Meaning and features of ledger. Classification of accounts. Features of Trial Balance. Journal: Meaning and features of journal. General Classification of errors. Balance Sheet: Meaning of Balance sheet. Unit 4: Understanding Ratio Introduction. Contents of Trial Balance. Balance Sheet Ratios. How to journalise. Meaning and classification of Accounts: Meaning of accounts. Format of journal. Classification of Errors: Introduction. Trial Balance: Definition and Meaning of Trial Balance. Meaning and objectives of Ratios. Errors disclosed by Trial Balance. Errors not disclosed by Trial balance. Accounting Principles: Accounting concepts. Revenue Statement Ratios.

Advantages of Marginal Costing. Types of Budgets. Determination of total cost.P. Drawbacks of Fund flow statement. Meaning of Budget. Cash Flow Statement. Cash flow from investing activities. Concept of Profit/Volume Ratio. Unit 7: Understanding Cost Introduction. Break Even Point (B. Difference between Funds flow statement and Balance Sheet. Non cost items. Unit 9: Budgetary Control Introduction. Unit 6: Cash Flow Analysis Introduction.Application of Funds. Basic concept of marginal costing: Meaning and Features of Marginal costing. Funds Flow Statement Vs. Cash flow from financing activities. Concept of Profit and Contribution. Uses and Limitations of Break Even Analysis. Limitations of Marginal Costing. Steps in Budgetary Control. Break-Even Chart. Estimation of Cost. 22 . Classification of Overheads. Use of Fund flow statement. Illustration. Classification of Cash flows: Cash flow from operating activities. Overheads and Non-cost Items: Overheads .): Methods of calculating Break Even Point. Merits and Demerits of Budgetary Control. Difference between Funds flow statement and P & L A/C. Meaning. IlIustration. On the basis of elements of the cost. Essentials and Objectives of Budgetary Control. Preparation of Flexible Budget. Cost sheet: Proforma of cost sheet.E. Meaning of cash flow statements. Assumptions. Factors affecting Break Even Point and Margin of safety. Classification of Cost: On the basis of behaviour of cost. Limitations of Cash Flow Statement. Unit 8: Marginal Costing & Break-even Analysis Introduction. Features of cash flow statements: Information required for Cash flow statement. Uses and Limitation of cash flow statement: Uses of cash flow statement.

Historical Costing Vs Standard Costing.Unit 10: Standard Costing Introduction. Standard Costing Vs Budgetary Control. Material and Labour Cost Standards. Variance Analysis : Material Cost Variance. 23 . Utility and Limitations of Standard Costing.

Structures in C++. Creating classes and objects. Constructors and Destructors. Operator Overloading in C++. Overloading binary operators. Strings and String related Library Functions. Unit 3: Arrays and Strings in C++ Introduction. Introduction to Functions. Break. Selection control statements in C++. continue and exit statements in C++. Evolution of Programming methodologies. Basic components of a C++ Program and program structure. Iteration statements in C++. Compiling and Executing C++ Program. Overloading Unary Operators. Unit 2: C++ Basic Programming Statements Introduction. Introduction to Arrays. Static variables and Functions in class. 24 . Unit 5: Objects and Classes Introduction. Unit 6: Operator Overloading Introduction. Passing Data to Functions. Introduction to OOP and its basic features. Unit 4 Functions and Structures in C++ Introduction. Scope and Visibility of variables in Functions.SECOND SEMESTER i) OOPS using C++ MC0066 (4 Credits) Book 1: OOPS Using C++ Unit 1: Introduction to OOP and C++ Introduction. Multidimensional Arrays.

Checking the I/O Status – Flags. Manipulators. Types of Inheritance. Inheritance in C++. Friends: Friend Functions. Objects and Pointers. Understanding the C++ iostream hierarchy: Standard Input/Output Stream Library. 25 . Virtual Functions And Polymorphism Introduction. Unit 2: This Pointer. Dealing with Binary Files. Managing I/O Streams: Opening a File – Different Methods. Checking for Failure with File Commands. Some Useful Functions. Elements of the iostream Library. Introduction to Pointers. Virtual Functions. Unit 3: The iostream Library Introduction. Introduction to Virtual Functions. Basic Programming using Streams: Basic Stream Concepts. Organization. Your Very First Program. Inheritance. Friend Classes. Static Functions. Polymorphism.Unit 7: Inheritance and Pointers Introduction. Friend Scope. Friends. Introduction to Polymorphism. Derivation and Inheritance: Derivation. Character and String input and output to files. Introduction to Multiple Inheritance. and Polymorphism – Revisited Introduction. Reading a File. Book 2: Advanced Concepts of OOPS using C++ Unit 1: Inheritance. and Static Functions Introduction. Unit 9: File Input and Output in C++ Introduction. Multiple Inheritance. The this Pointer. Command Line Arguments and Printer Output. Unit 8: Multiple Inheritance. Virtual Functions.

Functors. Deque. Strings. Implementing class template member functions. Exception specifications: unexpected(). Function templates: Implementing function templates. Actor. Using template functions. Templates and friends. Uncaught exceptions: terminate(). Classes. Extends. Template class partial specialization. Sequence Diagram. Extensibility Mechanisms: Stereotypes. Unit 5 : Exception Handling Introduction. Catching an exception: The try block. Allocators. Aggregation and Composition. Containers. Static members and variables. Associative Containers: Map and Multimap. Queue.Templates and multiple-file projects. Programming with exceptions: When to avoid exception. Sequence Adapters: Stack. History. Tagged Value. Rethrowing an exception. Template instantiation: Class template specialization. Algorithms and Functions: Algorithms. set_terminate(). Container Caveats. Class Diagrams: Packages. 26 . Set and Multiset.Unit 4: Templates Introduction. Includes. Unit 6: Standard Template Library Introduction. Dependencies. Iterators. Standard exceptions. Implementation Diagrams – Component and Deployment. Using a class template. State Diagram. Generalization. Template parameters.Throwing an exception. STL Components. Constraints. Functions and Function Objects. What is UML?. Sequence Containers: Vector. Interaction Diagrams: Instances and Messages. Associations. Iterators. Use Case Diagrams: Use Case. Iterator Adapters. set_unexpected(). Collaboration Diagram. Object Diagrams. Generalization. Class templates: Implementing a class template. Using exceptions. Interfaces. Algorithms. Termination vs. Template function specialization. Resumption. Catching any exception. Attributes. Operations. Unit 7: Introduction to UML Introduction. Activity and State Diagrams: Activity Diagram. Exception handlers. Priority Queue. Associations. Applications of Use Case Diagrams. List.

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

27

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.

28

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.

29

Entity Sets. Relationship types. Entity Types.Relational Mapping Algorithm. Concurrency Control Techniques: Two-phase Locking Techniques for Concurrency Control. Weak Entity Types. An example Database Application. Mapping EER Model Constructs to Relations: Mapping of Specialization or Generalization. and DBMS Buffers. Relationship sets. Placing File Records on Disk: Records and Record Types. Magnetic Tape Storage Devices. Role Names.and EER-to-Relational Mapping Elational Database Design Using ER-To-Relational Mapping: ER. Unit 5: Introduction to Transaction Processing-Concepts and Theory Transaction Processing: Transactions. Why Recovery is Needed: Commit Point of a Transaction. Record Blocking and Spanned Versus 30 . Attributes Of Relationship Types. Buffering of Blocks. And Instances. The Update Operation. Sets. Commit Point of a Transaction. Entity Types. Desirable Properties of Transactions. Relational Model Constraints and Relational Database Schemas : Relational Databases and Relational Database Schemas. Attributes. Entity Sets. Keys. Tuples. The Insert Unit 4: Relational Database Design by ER. roles and Structural Constraints: Relationship Types. and Variable-Length Records. Characteristics of Relations. Unit 6: Fire Organizations and Indexes Computer Storage Media: Memory Hierarchies and Storage Devices. Types of locks and system lock tables . Other Types of Constraints. Files. and Relations. Fixed-Length Records. Attributes and Keys : Entities and attributes. Relationship Degree. And Value Sets. Read and Write Operations. And Recursive Relationships.Unit 2: Data Modeling Using the Entity Relationship Model Using High Level conceptual Data Models for Database Design. The Delete Operation. Database Recovery Concepts: Recovery Outline and Categorization of Recovery Algorithms. Initial Conceptual Design Of The COMPANY Database. Update Operations and Dealing With Constraint Vioations: Operation. Relational Model Notation. Unit 3: The Relational Data Model and Relational Database Constraints Elational Model Concepts: Domains.to.

File Headers. Other Types of Indexes. Allocating File Blocks on Disk. Files of UnOrdered Records (Heap Files). 31 . Indexing Structures for Files: Types of Single-level Ordered Indexes.Unspanned Records. Operations on Files. Hashing Techniques: Internal Hashing. Files of Ordered Records (Sorted Files).

Pointers. Unit 3: Overview of Stack Introduction. Initialization of structure. Pre and Post Conditions: Preconditions. Pointers and Arrays. Using an Array and Lists as a Data Structure. Unit 2 Overview of Data Structures Introduction: What is a Data Structure?. Delete/pop operation. Implementation Checks Preconditions. Elementary Data Structures. Structure used with an Array. Sample C programs to represents the Stack Implementation. Programming with Abstract Data Types. Pointers used in an Array. Declaring a pointer variable. Applications of stack. Hash Tables. Queues and its Operations. The Application Level. What the application needs ?. [Matrix]. Generic Abstract Data Types. Implementation methods. Data Types and Structured Data Type: Common structure. Single – Dimensional Arrays (One Dimensional Array). Stack implementation using arrays. Stacks using structures.Two Dimensional Arrays. Implementation Level. Operations of Stack. Linear Data Structure: The Array Data Structure. 32 . Binary Tree. Non Linear Data Structures: Trees.Insert / Push operation. Checking Pre & Post Conditions. Definition of data structure.:Pointer Operators. Sample C programs to represents the Queue Implementation. Postconditions. Definition and concept of an Array: Array Used in „C‟ Language. Structures. Abstract Data Types. Different types of queues: Ordinary queue. Display. Unit 4: Overview of Queues Introduction.iii) Data Structures using C MC0068 (4 Credits) Book 1: Data Structures using C Unit 1: Arrays. Structures: Declaration of Processing of Structure. Double ended queue (Deque). Properties of Abstract Data Types. The Abstract Level. Disadvantage of ordinary queue. Pointers used in function. Pointers and Structures Introduction. Circular queue.

Doubly linked lists: Insert a node at the front end. How do you sort?. Overview of Graphs. Linked list: Typical basic linked-list operations. Tree Sort. Insert a node at the rear end. Internal Sorting: Insertion Sort. 2-Way Merge Sort. External Sorts: Merge Sort. Insert a node at the rear end. Delete a node from the front end. Spanning Trees. Storage representation of a binary tree. To find minimum value in a BST. Shell Sort. Count nodes in a tree. Binary tree: Strictly binary tree. Singly-Linked Lists. Count leaves in a tree. Height of tree. Overview of Sorting Methods. Illustration of C programmes. To find maximum value in a tree BST. Various operations on binary trees using linked representation: Insertion Operation. Binary Search. Adjacency lists & Adjacency Matrix: Adjacency lists. Unit 9: Sorting Methods Introduction. Overview of Tree Concept. Other operations. Circular singly linked list: Insert a node at the front end. Delete a node from the tree. Basics Searching Techniques. Almost complete binary tree. Adjacency Matrix. Delete a node from the rear end. Binary search tree (BST): Insertion Operation. Evaluating a Sorting Algorithms: Stability on Sorting algorithm. Bubble Sort. Unit 8: Searching Methods Introduction. Algorithmic Notation: Sequential Search [Linear search]. Quick Sort. Breadth – First Traversal. Searching. Linear list. Unit 7: Graphs Introduction.Unit 5: Linked Lists Introduction. Delete a node from the front end. Unit 6 : Trees Introduction. Traversals. 33 . Selection Sort. Complete binary tree. Depth – First Traversal.

Terminology. Forest. Adjacency List. Big-O Notation: Application of Big-O notation to algorithm analysis. Traversing the Nodes of a BST: Preorder Traversal. Uniform-cost search. Finding Shortest Paths using BFS. Topological Sort Problem. Depth-limited search . Dijkstra Algorithm. Overfencing. Worst case height of an AVL tree with n Nodes. Insertions into a Binary Heap. Build Heap -. Relaxation. Complete Graph. Directed Graph. The Order of Insertion Determines the BST's Topology. Lemma.Book 2: Advanced Data Structures using C Unit 1: Advanced Topics in Trees and Their Applications Introduction. AVL Trees: Definition. Deleting Nodes from a BST. Strongly Connected Components problem. Binary Search Trees in the Real-World. Examples of Graph Problems: Telecommunication. Adjacency Matrix. Safest Path. Kruskal's Algorithm. Depth-first search. Big- and Big-:Properties of the sets O(f(n)) and (f(n)). Implicit Representation. Bipartite Graph. Bellman-Ford Algorithm. Euler Path. Uninformed Search: Breadth-first search. The Cost of Recursion. Postorder Traversal. Spanning Trees: Minimum spanning trees. How to find minimum Spanning Tree?: Lemma. Knight moves. Other useful mathematical formulae. Connectedness. Analyzing the BST Search Algorithm. Euler Cycle. Representation. MiniMax Distance. Inserting Nodes into a BST. Why minimum spanning trees. Height Balanced Trees: AVL Trees. Paths. Inorder Traversal. Other Graphs: Graph Transpose Problem. MaxiMin Distance. The A-A tree. Single-source shortest paths in Directed Acyclic Graph (DAG). Iterative deepening search. Sub graphs. Sample Problem: Riding The Fences. Bidirectional search. Floyd Warshall and Variants:Transitive Hull. Deletions from a Binary Heap. Prim's algorithm. Unit 3: Graphs and their Applications – I Introduction to Graphs.building a tree from a collection of forests. 34 . The Binary Heap: Definition. Graph Representation: Edge List. Unit 2: Minimum Spanning Trees and Algorithms Introduction. Deletions from a Red-Black tree. Special Graphs: Rooted tree. Analysis of Insertion Algorithm. Red-Black Trees. Insertion into a red-black tree.

Addition Chains. B.Tree Index Files. Sequential files. Depth First with Iterative Deepening (DF-ID): Complexity. Balance Theorem. Comparison of DFS. Inverted files. Splay Trees. 35 . Udder Travel . B . Other Theorems : Working Set Theorem. A* Search. Informed Search: Best First Search. BFS & DFS+ID. Multi-lists. Threaded lists. An Application of Graph.Tree File Organization. Basic terminology. Index-sequential files.Unit 4: Graphs and their Applications – II Introduction. Breadth First Search (BFS) Implementation. Scatter storage or hash addressing. Dynamic Optimality Conjecture. Static Finger Theorem. Amortized Analysis: Aggregate Analysis. Depth First Search (DFS) Algorithm: Sample Problem: n Queens [Traditional]. Insertion. Trees. Strong Access Lemma. Logical or Physical Organization and Data Independence. Cellular multi-lists. Depth First Search (DFS) Implementation. Dynamic Finger Theorem. Unit 5: Splay Trees (Self-adjusting Search Trees) Introduction. The potential method. Ring structures. Desert Crossing. Complexity. Deletion. The Dynamic Hash Table. Unit 6: File Structures Introduction. Breadth First Search (BFS): Sample Problem: Knight Cover [Traditional]. Sample Problems: Super-prime Rib. Clustered files. Betsy's Tour . Join. Dynamic Hashing: How does it work?. A Dynamic Hash Table that both expands and contracts. Properties of the Potential Function. Sequential Access Theorem. Access lemma. A language for describing file structures. Static Optimality Theorem . Complexity.

Terms And Concepts: Classifiers. Unit 2: Basic Structural Modeling Introduction. Interfaces. Other Features. Relationships in the UML. and Polymorphic Elements. Common Mechanisms in the UML: Specifications. Grouping Things. Abstract. Other Adornments. Aggregation. The UML Is a Language for Visualizing. Leaf. Where Can the UML Be Used?. 36 . Multiplicity. The UML Is a Language for Constructing. Organizing Attributes and Operations. Role.iv) System Analysis & Design (SAD) MC0069 (4 Credits) Unit 1:The Context of Systems Analysis and Design Introduction. Generalization. Things in the UML: Structural Things. Name. Dependency. The UML Is a Language for Documenting. An Overview of the UML: The UML Is a Language. Operations. Multiplicity. Generalization. Common Modeling Techniques: Modeling New Building Blocks. Common Modeling Techniques: Modeling the Vocabulary of a System. Unit 3: Relationships Introduction. Diagrams in the UML. And Roles. The UML Is a Language for Specifying. Terms and Concepts: Notes. Modeling Structural Relationships. Constraints. Scope. Common Modeling Techniques: Modeling Webs of Relationships. Modeling the Distribution of Responsibilities in a System. Realization. Principles of Modeling: Object-Oriented Modeling. Rules of the UML. Association. Template Classes. Adornments. Unit 4: Common Mechanisms Introduction. Advanced Relationships. Tagged Values. Association. Stereotypes. A Conceptual Model of the UML: Building Blocks of the UML. Attributes. Behavioral Things. Types. Modeling New Semantics. Root. Terms And Concepts: Dependency. Advanced Classes. Common Modeling Techniques. Standard Elements. common Modeling Techniques: Modeling Simple Dependencies. Modeling Single Inheritance. Terms And Concepts. Standard Elements. Operations. Modeling New Properties. Attributes. Visibility. Terms And Concepts: Names. Responsibilities.

Unit 6: Class Diagrams Introduction.Terms and Concepts. Deployment Diagram. Representation.Terms And Concepts: Names. Common Modeling Techniques: Modeling the Lifetime of an Object. Signals. Modeling Exceptions. Transitions. Component Diagram. Modeling Different Levels of Abstraction. Advanced States and Transitions. Modification. Forwarding And Reverse Engineering. and Destruction. Types and Roles. Modeling Static and Dynamic Types. Common Modeling Techniques: Modeling a Flow of Control. Forward and Reverse Engineering. Terms And Concepts: Kinds of Events. Terms And Concepts: Context. States. Operations. Common Modeling Techniques: Modeling the Seams in a System. Substates. Statechart Diagrams. Objects and Roles. Collaboration Diagram. Unit 8: Events and Signals Introduction. Unit 5: Diagrams Introduction. 37 . Common Modeling Techniques: Modeling Simple Collaborations. Terms And Concepts: Context. Links. Object Diagram. Messages. Terms And Concepts. Relationships.Structural Diagrams: Class Diagram. Common Modeling Techniques: Modeling reactive Objects. Time and Change Events. Creation. Activity Diagram. Terms And Concepts. Sequencing. Behavioral Diagrams: Use Case Diagram. Common Modeling Techniques: Modeling Different Views of a System. Common Modeling Techniques: Modeling Object Structures. Understanding an interface. Forward And Reverse Engineering. Object Diagrams. Common Modeling Techniques: Modeling a Family of Signals. Sequence Diagram. Call Events. Sending and Receiving Events. Modeling A Logical Database Schema. Unit 7: Interactions Introduction. State Machines. Modeling Complex Views. Terms And Concepts: Common Properties. Statechart Diagram.

Modeling Systems of Systems. Modeling a Fully Distributed System. Behavior. Common Modeling Techniques: Modeling Source Code. Organizing Collaborations. Modeling a Mechanism. Standard Elements. 38 . Common Uses. Terms And Concepts: Names. Modeling Adaptable Systems. MODeling a Physical Database. Terms And Concepts: Common Properties. Components and Classes. Components Interfaces. Deployment Diagrams. and Binary Replaceability. Contents. the Common Modeling Techniques: Modeling the Realization of a Use Case. Common Uses. Terms And Concepts: Names. Modeling Realization of an Operation. Common Modeling Techniques: Modeling the Architecture of a System. Modeling Source Code. Unit 10: Systems And Models Introduction. Modeling an API. Structure. Kinds of Components. Files And Documents. Common Modeling Techniques: Modeling a Embedded System. Terms And Concepts: Common Properties. Forward and Reverse Engineering. Modeling an Executable Release. Contents. Organizing Components.Unit 9: Components Introduction. Components Diagrams. Terms And Concepts: Systems and Subsystems. Models and Views. Common Modeling Techniques: Modeling Executables and Libraries. Collaborations. Modeling a Client/Server System. Modeling Tables. Trace.

Operating Systems for Different Computers. Disadvantages of Threads over Multiple Processes. Introduction to Virtual Machines: Hardware Virtual machine. Threads: Processes Vs Threads. Why Threads?. Process Control Block. Application virtual machine. Real-time Operating System . Command Interpreter System. Machine Aggregation. Main-Memory Management . Multi Programmed Batch Systems . Resources Management Provide a effective user interface. Implementation Techniques: Emulation of the underlying raw hardware (native execution). 39 . Modules. What is an Operating System?. Emulation of a non-native system. File System Manipulation . Example: UNIX Process. Communications . Error Detection. Evolution of Operating Systems: Early Systems. Advantages of Threads over Multiple Processes. Context Switching. I/O Operations.v) Operating Systems with Unix MC0070 Book 1: Operating Systems Unit 1:Overview of Operating System Introduction to OS. Swapping. Unit 3: Process Management Introduction. Simple Structure. Secondary-Storage Management . Protection System. Process States: Five State Process Model. Operating System Services: Program Execution. Process Termination. Networking. File Management . Microkernels . Process Control: Process Structure. Simple Batch Systems . Process Creation. Unit 2: Operating System Architecture Introduction. What is a Process?. Functions of an Operating System: To hide details of hardware.Thread States. Seven State Process Model. Layered Approach. OS as an Extended Machine. UNIX kernel Components . Time Sharing Systems . Modes of Execution. Distributed Systems. I/O System Management . Virtual Environment. Types of Threads: User Level Threads. Operating System Components: Process Management . Kernel Level Threads.

Unit 6: Deadlocks Introduction. Mutual exclusion by disabling interrupts. Data Blocking . Operating System Examples. Replacement Policy. Symmetric Multithreading. Algorithm Evaluation. Fetch and write Mechanism: Demand fetch. Deadlock Prevention. Second-level Caches. Segmentation: Combined paging and Segmentation. Unit 8: File Systems and Space Management Introduction. CPU Scheduler. Priority Scheduling. Multi level page table. Associative Memory. File Systems. Unit 7:Concurrency Control Introduction. Write-through mechanism. Placement Policy. Unit 5: CPU Scheduling Introduction. Multilevel Queue Scheduling. Mutual Exclusion using Semaphore. Scheduling Algorithms: First-Come First-Serve Scheduling. Killing Zombies. Paging: Control bits. Access Modes. Scheduling Criteria. File Attributes. Write-back mechanism. Load Control. Replacement policy: Random replacement algorithm. Mutual Exclusion: Requirements for mutual exclusion. Thread Scheduling. Solutions to deadlock. FCFS. Mutual exclusion by using Lock variable. Optimizing the data cache performance: Principle of Locality. Memory Hierarchy. pre-fetch. Mutual exclusion by Strict Alternation. Selective fetch. File Structure: File Types. Frame locking. Critical Section. Fully Associative Mapping. Fetch Policy. 40 . Deadlock detection and recovery. Page buffering . Cache Performance. Write Operations. Semaphore Implementation. Semaphores: What are Semaphores. Algorithms. CPU-I/O Burst Cycle. Pipes. Least recently used algorithm for a Cache. What is concurrency?. Mutual exclusion by Peterson‘s Method:. FIFO replacement algorithms. Cleaning policy. Instruction and data caches. Multiple-Processor Scheduling: Approaches to Multiple-Processor Scheduling. Race Conditions. Livelock. Deadlock avoidance. Mutual exclusion by using Special Machine Instructions. Cache Memory: Basic Structure.Unit 4: Memory Management Introduction. Round Robin Scheduling. Cache Memory Organization.

Layers of UNIX Operating System.8 Fdisk. Book 2: Advanced Operating System with UNIX Unit 1: Review of Operating system Concepts What is an Operating System?. Hardware Management. Basic and dynamic disk storage. Disk Index. UNIX and Standards: UNIX for Mainframes and Workstations. Contiguous. Linked List. Part 1. Kernel mode. Reliability. Commands Connected Through Pipes.2. Introduction to the UNIX Philosophy: Simple. Making Changes to UNIX. Orthogonal Commands. I/O Control Strategies.Active Directory . The Boot Procedure. Part 2. Fsck: File System Checking. Interrupt-controlled I/O. Direct Memory Access. msdos or pcfs2. The History of UNIX: Berkeley Software Distributions. Unit 2: The Standard File Systems Introduction: root. Language & locale support. Directories. Windows 2000:History. Encrypting File System. Source Versions of "UNIX". Space Management : Block Size and Extents. UNIX Architecture. Accessibility support. Unit 10: Case Study on Window Operating Systems Introduction. The UNIX Operating System. Iso9660 or hsfs. swap. UNIX for Intel Platforms. Back-up Dumps. Deployment. File System Types: s5.Implementing File Systems : Files . mkfs. Performance. Environment Variables and Shells. Common functionality:NTFS 5. Process Control. Unit 9 Input-Output Architecture Introduction.Volume fault tolerance .Versions. File Index. The I/O address space. Help. Ext2. Recovery Console. Architecture of the Windows NT operating system line: 1 User mode. ufs. Bad-block Forwarding. A (Mostly) Common Option Interface Style. Server family functionality: Distributed File System . Architecture. File System Mounting and Un-mounting. Process Management . Consistency Checking: Transactions. I/O structure. System utilities. proc or procfs2.6 swap. No File Types . Introduction to the UNIX Philosophy. bfs The boot file system.2. Program-controlled I/O. Kernel. Free Space. Hardware Management. Swap. System 41 .

Listing Files Whose Names Contain Nonprintable Characters with –q. Removing Files with rm. Redirecting Input and Output. Listing Files and Directories: ls Revisited: ls The Short and Long of It. Creating Listing. Renaming Directories with mv. The Message Structure . Unit 5: UNIX File System Introduction. Working on the System: Erase. 42 . eof. Configuring Your Environment. After Login Succeeds. Logging In to the System. Unit 6: Managing Data Files in UNIX Introduction. Unit 3:Processes in Unix Introduction. and Viewing Files. The UNIX File Tree. Working with Files: Copying Files with cp. Moving Files with mv. Using Metacharacters When Referring to Filenames: Pattern Matching on a Single Character. The pipe() System Call. Reading A Message From The Queue . Message Queues: Creating A Message Queue . Shared Memory. File and Directory Names. The fork() System Call. Stop and Start. Configuring with rc files. Showing File Types with –F. Showing Hidden Files with –a. Creating Directories with mkdir .msgrcv(). Semaphore.struct msgbuf: Writing Messages Onto A Queue . Startup Scripts. Default File and Directory Permissions—Your umask. Backup Options. Backup & Restore: Tape Media and removal cartridge. Setting a processes priority. Managing Your Password. Hard and Symbolic Links. Inter Process Communication: Communications Via Pipes. Different Privileges for Different Users.msgsnd(). Child Process Termination. Logging Out. The Types of UNIX Files. Unit 4: Beginning with UNIX Introduction: User Account Setup. Using Shell Startup Files.Processes. Online Help. Removing a Directory with rmdir. Named Pipe: Creating A Named Pipe. Viewing and Setting Environment Variables.msgget(). dump. Other ls Options. Using Commands: What Is a Command?. Other Process Related Commands. Working with Directories: Creating Multiple Directories with mkdir. Keeping Secrets — File and Directory Permissions. Other Useful ls Options. Kill.

Substitution of Variable Data. How the Shell Interprets Commands. Unit 7: Other Popular Tools in UNIX Introduction. Finding Information About Disk Utilization with du and df : Summarizing Disk Usage with du. Special Variables in the Bourne Shell: Environment Variables.. The id Command. Search Qualifiers. How File Substitution Works: The find Command. Conditional Variable Substitution. Learnig More About Commands with man. IFS. Changing Shell Options with set.Pattern Matching on a Group of Characters. The Functions of a Shell: Program Initiation. Shell Programming. Making Calculations with dc and bc: Calculating with bc. Specifying More Than One Path to Search. HOME. Entering Commands Too Long for One Line. Redirecting Error Messages. Using Pipes to Pass Files Between Programs. Conditional Variable Substitution with Error Checking.. Locating Files of a Specific Size: -size n and Displaying the Path Names of Found Files: -print. Positional Variables or Parameters. Calculating with dc. Controlling Input and Output: Output Redirection. Executing a UNIX Command on the Found Files: -exec cmd \. Search Criteria. Input File Redirection. Getting Information About Users: The who Command. Combining Search Criteria. Entering Data from the Shell. Finding the Date and Time. Filename Substitutions on the Command Line. Entering Multiple Commands on One Line. Locating Files of a Specific Size: -size n. Writing Found Files to a Device: -cpio device. Displaying a Monthly or Yearly Calendar with cal . Entering Simple Commands. Inputoutput Redirection. Shell Options: The Restricted Shell. Environment Control. Substituting Default Values for Variables. Pipeline Connection. Reporting Blocks and Files with df. Redirection of Input and Output. Executing a UNIX Command on Found Files. Negating Expressions to Find Files That Don't Meet Criteria. The finger Command. Maintenance of Variables. 43 . Pattern Matching on Character Sets. Escaping from the Special Characters. Defining Your Own (UserDefined) Variables. Altering the Search Path with –depth. Switching Accounts with su. Finding Files with a Specific Name: name fname. Variables. Unit 8: Shell Programming Introduction. Substituting the Results of Commands in a Command Line. But Querying First: ok cmd \. The Kernel and the Shell. Searching for Files on Only the Current File System: -mount. Substitution of Filenames.

Privileged mode switching. Extending a command over multiple lines. Conditional Command Execution with the And/Or Constructs. PS2. Testing Conditions with test. Testing Numeric Data. Command substitutions. Arithmetic expressions. Using Data Variables in Shell Programs. PS1. Invoking C Shell. Entering Comments in Shell Programs. Reading Data into a Program Interactively. Shell Basics: Redirection of input and output. Decision Making in Shell Programs.Passing Arguments to Shell Programs. Repeating Within a for Loop. Overview of C Shell: A Little History.MAIL. A Shorthand Method of Doing Tests. MAILCHECK. Filename substitutions. Syntax improvements. The case Statement. Handling the Unexpected with trap. Repeating Within an until Loop. Repeating Within a while Loop. Testing Character Data. Preventing Variables from Being Changed. Command aliases and Commad details: Command history. Shell Programming: What Is a Program?. Getting Out of a Loop from the Middle. Building Repetitions into a Program. Substitution of variables. Entering multiple commands on one line. The Shell as a Language. Doing Arithmetic on Shell Variables. Displaying the Program Name. Combining and Negating test Conditions. MAILPATH. PATH. Coprocessing. The Null Command. Escaping and quoting.Wildcard expressions. TERM. Directory Management. Data Output from Shell Programs. 44 . Nested if Statements and the elif Construct. Structured Shell Programming Using Functions. Job processing. Testing for Files. Command editing. The ifthen Statement. The if-then-else Statement.

THIRD SEMESTER i) Software Engineering MC0071 (4 Credits) Book 1: Software Engineering Unit 1: Software Development Approaches Introduction. Unit 3: Software Reliability Introduction. The Parallel or Concurrent Development Model. Object Classes & Inheritance. Unit 2: Software Design Processes Introduction. Design description. 45 . Object aggregation. Software Reuse. An object-oriented design example. The client–server model. Software Characteristics. Function oriented design. Hacking. Design Methods. Software reliability metrics. Service usage models. Object Oriented Design: Objects. Modular decomposition. Unit 5: Object Oriented Design Introduction. Inheritance models. Structural Decomposition: Detailed design. Data Dictionaries. Software Design: The design process. Programming for Reliability: Fault avoidance. System Models: Data-flow models. The Serial or Linear Sequential Development Model. Control models. Design strategies. Definitions of Software Engineering. The incremental Development Model. Domain-specific architectures. What is meant by Software Engineering?. Software Applications. Iterative Development Model. The repository model. Architectural Design: System structuring. Semantic data models. Fault tolerance. Design quality. Object identification. Evolving Role of Software. Object aggregation. Inheritance. The abstract machine model. Data –flow design. Object models. Unit 4: Software Design Principles Introduction. Object Interface Design: Design evolution. Service Usage.

Control Structure Testing. Maintenance costs. Black Box Testing. Principles of Testing. Thread testing. System Requirements. System documentation. Bottom-up Integration. Bottom-Up Testing. Metrics Collection. Additional requirements in testing OO Systems. Change Management. Maintainability measurement. Software Reengineering. Architectural Alternatives.Unit 6: Configuration Management Introduction. System Testin. Unit 9: Software Testing Strategies Introduction. Testing Principles. Software Testing Fundamental. Characteristics of software Development Strategies. Back-to-back testing. Unit Testing: Unit Test Considerations. White box testing (glass-box testing). Testing GUIs. Test Plan: Test Documentation. Regression testing. Unit 7 : Software Testing Techniques Introduction. Testing software changes. Software Testing Strategy. Book 2: Advanced Software Engineering Unit 1: Software Development Strategies – I Basic Planning and Control Introduction. Release management. Verification and Validation: Validation Testing. Test Strategies: Top-Down Testing. Risk-Reduction Models: The Prototyping 46 . Version management tools. White Box Testing. Validation Test Criteria. Version and Release Management: Version identification. Top-down Integration. Life-Cycle Models:The waterfall Model.g Acceptance Testing. Black-box testing (Functional testing). Boundary Value Analysis. Managing Testing Functions. Testing methods and tools: Testing through reviews. Stress testing. Unit 10: Case Study Introduction. The maintenance process. Unit 8: Software Testing Assurance Introduction. and Evaluation. Computation. Incremental and Iterative Models. Test and QA plan. Software Maintenance. Organizing for software testing. Software Refactoring. Testing Documentation and Help Facilities.

Case Tools.Model. Human factors in Development Models. Unit 6: Software Technology and Problem Solving Introduction. Classic Invalid assumptions: First Assumption: Internal or External Drivers. Role of the Problem-Solving Process in This Approach: Data. Personal and Team software development Models. Problem Definition. Open Source development Model. Unit 2: Software Development Strategies – II Tools. Unit 3 : Software Development Strategies – III Process Improvement Introduction. The Reengineering Model. The Spiral Model. Fourth Assumption: Process Centered or Architecture Centered. Goals. Most Users Do not Understand Computer Languages. Workflow Application Model. Productivity-Driven Dynamic Process Modelling. Interdisciplinary Resources. The Clean Room Model. Unit 5: An Assessment of Process Life-Cycle Models Introduction. Tools and Capabilities. The Dimension of time. Time. Commercial Off-the-shelf Model (COTS). Activities. The capability Maturity Model. Overview of the Assessment of Process. Agile Software Development. Unit 4: Software Development Strategies – IV Reinventing How It Is Done Introduction. Business Problem-Solving Optimization. The Need for a business model in Software engineering. Redefining the Software Engineering Process: Round-Trip Problem-Solving Approach. Objects. Rational Unified Process Model. Software Technology as Enabling Business Tool – What Computers Can Do ?: Exponential Growth in Capability. The E-Business Revolution. Object-oriented and Reuse Model: Object-Oreinted Model. Rapid Application Development Model. and Reuse Introduction. Aspect oriented Development. Decisions and Problems – Complex and Ill Structured. Software Technology as a Limited Business Tool – What Computers Cannot Do?: People Have Different Needs That Change over Time. Businesses View Software Technology as a Black Box for Creating 47 . Second Assumption: Software or Business Processes. Portability Power. Third Assumption: Processes or Projects. Connectivity Power. Implications of the New Business Model.

Partial Knowledge. Unit 8: People and Software Engineering Introduction. The team factor. The customer factor. Unit 7: Diversification of Problem-Solving Strategies in Software Engineering Introduction. Unreliable Sources of Information. Traditional Software Engineering. The people factor – Multidisciplinary aspects. Interorganizational Ignorance. Human driven software engineering. Diversity in Problem Solver Skills at the Project Management Level. A View of Problem Solving and Software Engineering. The importance of people in problem solving process: The Rolers of Users in Problem definition. Lack of Communication. Integration – Not Differentiation: Investing in Diversification. Factors That Affect Interdisciplinary Ignorance. 48 . Understanding Diversification in Software Engineering: Driving Forces of Diversity in Development Strategies. The Hidden Value of Differences.Economic Value.

Architecture of a Vector Display. Video Mixing. Scan Converting Circles: Basic Concepts in Circle Drawing. The Video Controller. Unit 3 : Raster Graphics Algorithms Introduction. Filling areas between boundaries. 49 . Color Tables. Random Scan Display Processor. Pattern filling. Scan Line algorithm. Input Technology. Line Drawing Algorithms. Conceptual Framework for Interactive Graphics. Color and Grayscale Levels. Trigonometric Method. Image Processing as Picture Analysis. The advantages of Interactive Graphics. Thick primitives: Replicating pixels. Polygon Filling: Seed fill. Grayscale. Filling Rectangles. Representative Uses of Computer Graphics.ii) Computer Graphics MC0072 Unit 1: Introduction to Computer Graphics Introduction. Unit 2: Graphics Hardware Introduction. Development of Hardware and Software for Computer Graphics: Output Technology. DDA Circle Drawing Algorithm. Representation of a Circle. Direct-view storage tubes. Classification of Applications. Approximation by thick polyline. Line Style and Pen Style. Polynomial Method. Types of polygons. Digital Differential Analyzer. Flood Fill algorithm. Graphics Workstation. Software Technology. Scan Converting Lines: Basic Concepts in Line Drawing. Bresenham‘s Line Algorithm. Architecture of a Raster Display. Moving pen. Bresenham‘s Circle Drawing Algorithm. Unit 4: Filling Rectangles and Polygons Introduction. Overview of Simple Raster Graphics Package: Displays with Frame Buffers and Display Controllers. Midpoint circle drawing Algorithm. Filling Polygons. Circle Drawing Algorithms. Display with only Frame Buffer. Midpoint Line Algorithm. Boundary Fill algorithm. Raster Display System with Peripheral Display Processor.

Homogeneous Coordinates for Rotation. Projection: Parallel Projection. Reflection with Respect to Given Plane. Orthographic Projection. Unit 7: Viewing in 3D Introduction. Scaling. Types of Parallel Projections. Transformation from World Coordinate to Viewing Coordinates. Reflection. Bitmap method. Eneralized Clipping with Cyrus-beck Algorithm.Unit 5: Clipping Introduction. Clipping Lines: Sutherland and Cohen Subdivision Line Clipping Algorithm. Reflection with Respect to Any Plane. Efficiency. Rotation. Specifying an Arbitrary 3D View. Three Dimensional Viewing. Clipping Polygons: Sutherland – Hodgeman Polygon Clipping. Scaling. Types of Perspective Projection. Inverse Transformations. Composition of 2D Transformations: Rotation About and Arbitrary Point. 50 . Starbust method. Homogeneous Coordinates for Scaling. Window to View-port Transformation or Viewing Transformation: Normalization Transformation. Clipping Circles and Ellipses. Reflection with Respect to xyplane. Y Shear. Liang-Barsky Line Clipping Algorithm. Oblique Projection. Shearing Relative to Other Reference Line. X shear. Perspective Projection. Unit 6: Geometrical Transformations Introduction. Homogeneous Coordinates and Matrix Representation of 2D Transformations: Homogeneous Coordinates for Translation. Rotation. Shear. Matrix Representations of 3D Transformations: Translation. Workstation Transformation. Composition of 3D Transformations: Rotation about Arbitrary Axis. Generating characters: Stroke method. Shear. Two dimensional transformations: Translation.

Unit3: Assemblers Introduction. Bootstrap loaders. Software and compiler boot straping. Unit 2: System Software and Machine Architecture Introduction. Relocation and dynamic linking. Binding and Binding Times. Language Processor Development Tools. Fundamentals of Language Specification: Programming Language Grammars. pass1 & pass2 Assembler flow chart. Nested and Recursive Macro Calls and its expansion. Implementation Examples: A Linker for MS-DOS. Design of a Linker. Macro Definition and Expansion: Conditional Macro Expansion. Difference between CISC and RISC. Examples: MASM Assembler and SPARC Assembler. Addressing Modes: Addressing modes for CISC (Motorola & Intel). Introduction to RISC & CISC machines. The C Preprocessor for GCC version 2. Flow chart of Design of Macro Preprocessors Implementation. Design Specification of Assembler: Data Structures. Classification of Grammars. Fundamentals of Language Processing. Bootstraping: Boot strap loading.iii) System Programming MC0073 (4 Credits) Unit 1: Language Processors Introduction. Design of Multi-pass(two pass) Assemblers Implementation. Introduction to Data Formats. Examples: MASM Macro Processor. Addressing modes of RISC Machines. Unit 4: Macros and Macro Processors Introduction. Unit 5: Linkers Introduction. Assembly Language. Macro Parameters. Basic Assembler Functions. Design of Single Pass Assembler. 51 .

Dynamic Memory Allocations. A Simple Bootstrap Loader. Interpreters. Stack Based Allocations. Intermediate Code Generation. Interpreters. Code Optimization. Relocation. Context Free Grammar. Programming Environments: IDE. Editors. Phases of Compilation: Lexical Analysis. Finite State Automata(FSA): Deterministic Finite Automata. 52 . Unit 7 : Scanning & Parsing Introduction. Generalized Non-Deterministic Finite Automata (GFNA). Syntax Analysis. Simple Precedence Grammar. Unit 9 : Memory Allocations Introduction. YACC Compiler-Compiler. Advantages of Finite State Automata. Moore Machine and Mealay Machine. Storage or Memory Allocations: Static Memory Allocations. Motivation for a Retargetable loader (RL). Unit 10: Software Tools Introduction. Compiler writing tools. Tools that deal with machine code instructions. Debuggers. Parsing: Types of Parsers. Heap Storage & Garbage Compaction. Difference between compiler and interpreter. Non-Deterministic Finite Automata. Basic Loader Functions: Design of an Absolute Loader. Operator Precedence Parser. Code Generation. Binding and binding times: Memory Allocation in Block Structured Languages. Operator Precedence Grammar. User Interfaces. Java Compiler and Environment. Unit 8 : Compilers & Interpreters Introduction. Java and its Garbage collection.Unit 6 : Loaders Introduction. Software Tools for Program Development: Compilers.

Functions of random variable. Chi-square distribution. Marcov-chains Introduction. Graphical representation. Accuracy and Significant digit. 53 . Gamma distribution. Conditional probability. relative and percentage errors. Rounding off numbers to significant digits. Marginal and conditional probability distribution. Unit 5: Statistics Introduction. Point estimation. Unit 4: MGF. Skewness. Errors and their computation. Markov chains. Covariance. Unit 6: Stochastic process. One-dimensional random variable. Discrete and continuous random variable. Bernoulli Poisson process. Moments. Sampling theory. Exponential distribution. Sampling theory and estimation Introduction. Features of random experiment. Baye‘s theorem. Poisson distribution. Stochastic process. Uniform distribution. Normal distribution. Unit 7: Errors in Numerical Calculations Introduction. Classification of stochastic process. Two-dimensional random variable. Bernoulli trials. Regression. Measures of central tendency. Correlation coefficient. Mathematical expectation and variance. Definition of some basic terms. Absolute. Kurtosis. Unit 3 : Distribution Introduction. Curve fitting. Unit 2: Random Variables Introduction. Moment generating function.iv) Statistical & Numerical Methods using C++ MC0074 (4 Credits) Unit 1: Probability Introduction.

Unit 13: Introduction to Mathematical Software used for Numerical Analysis Introduction to MATLAB: Key Features of MATLAB. Bisection method. Iteration method. Runge-Kutta method of second and fourth order. Modified Euler‘s method. Lab Exercise. Divided differences. Finite differences. Generalized Newton method. Syntax of MATLAB. NewtonRaphson method. Numerical Algorithms Group (NAG). Eigen values and Eigen vectors. Lagrange‘s interpolation formula. Solution to a system of linear equations. Unit 12: Numerical Solution of Ordinary Differential Equation Introduction. Graphics. Unit 11: Numerical Differentiation and Integration Introduction. Limitations. 54 . Operations on matrices. Newton‘s forward and backward difference interpolation formulae. Vectors/Matrices. Derivatives using Newton‘s forward and backward difference interpolation formulae. Rank of a matrix. Unit 9: Solution of Algebraic and Transcendental Equations Introduction. Numerical integration. Euler‘s method. Method of false position. Semicolon.Unit 8: Matrices and Linear System of Equations Introduction. Initial value problem. History of MATLAB. Unit 10: Interpolation Introduction. Numerical differentiation. Taylor‘s series method. Different type of matrices. Variables. Determinant of matrices.

Reference models: The OSI Reference Model. Switching: Circuit switching. Serial & Parallel. TDM – Time division multiplexing. Message switching. Design issues for the layers. Unit 4: Physical Layer Introduction. Definition of a Computer Network: What is a Network?. Use of Computer networks: Networks for companies. Theoretical basis for communication: Fourier analysis. Noise. Band limited signals. Simplex. Relationship between Packet Size and Transmission time. Who's who in the standards world. Comparison of switching techniques. 55 . Synchronous & Asynchronous transmission. Multiplexing: FDM – Frequency division multiplexing. Considerations when choosing a Topology. Implementation of packet switching. Networks Software: Protocol hierarchy. Packet switching. Ring Topology. WDM – Wavelength division multiplexing. Data transmission modes. Local area networks. The TCP/IP Reference Model. Unit 3: Data Communications Introduction. Topology Comparison. Half duplex & full duplex. Network standardization: Who's who in the telecommunication world?. Network topologies: Linear Bus Topology. Maximum data rate of a channel. Metropolitan area networks. Who's who in the Internet standards world?. Transmission impairments: Attenuation distortion. Service Primitives.v) Computer Networks MC0075 (4 Credits) Book 1: Computer Networks Unit 1: Introduction To Computer Networks Introduction. Merits and De-merits of Layered Architecture. Based on the their scale. Social Issues. Comparison of the OSI & the TCP/IP Reference Models. Dispersion. Wireless networks. Delay distortion. Classification of networks: Based on transmission technology. Networks for people. Components of a computer network. Wide area networks. Star Topology. Unit 2: Network Software &Network Standardization Introduction. Hierarchical or Tree Topology.

Binary exponential Algorithm. Comparison of channel access protocols. Error control. Comparison of fiber optics and copper wire. Single bit error correction or (n. Coaxial cable. Importance of flamming distance for error correction. ARQ strategies. Internetworking. Closed loop solution. Link state routing. Optical fiber. Classes of routing algorithms. CSMA/CD Protocol. Congestion: Factors of congestion. IP protocol (IPV4). Data Link layer protocols: Transmission control protocols. The channel allocation problem: Static channels allocation. Internal organization. Radio transmission. Flow control. m) flamming code. Design issues of DLL: Services provided to the Network layer. Properties of routing algorithms.3 frame format. General principles of congestion control. Error Detection or Cyclic Redundant Code (CRC). Unit 6 : Data Link Layer Introduction: Goal of DLL. Unit 8: Network Layer Introduction. Routing. Principles of Routing: Types of routing algorithms. IEEE 802. Optimality principle. Distance vector routing.Unit 5: Transmission Medium Introduction. CSMA Protocol. Comparison of flow control and congestion control. Framing. Microwave transmission. Fast Ethernet. Multiple access protocols: Pure ALOHA or Unslotted ALOHA Protocol. Comparison of routing algorithms. 56 . HDLC. Wireless transmission: Electromagnetic spectrum. Twisted pair. Flooding. Error Detection and correction: Parity bits. Dynamic channels allocation in LAN‘s and MAN‘s. IEEE standards: Ethernets. Hierarchical routing. Design issues of Network layer: Nature of the service provided. Link Management. Unit 7: Medium Access Control Sub Layer Introduction. Transmission medium: Guided & Unguided Transmission medium. Gigabit Ethernet. Slotted ALOHA or Impure ALOHA Protocol. Routing algorithms: Shortest path algorithm.

Drawbacks of Routers. Other classes. Stackable Hubs. Wireless Access Point (WAPs). Port Density. Connection establishment. Internetworking. Connection Release. 57 . Internet services. Book 2: Advanced Computer Networks Unit1: Internetworking Introduction. Comparison of switching methods. Future growth and technology. Unit 2: Internet addresses Introduction. Working with Hubs and Switches. Switches: Switching Methods. Gateways: Advantages of gateways. UDP protocol. Bridges: Bridge Implementation Considerations. Broadcast on DISTANT network. Internet addressing authority. Class B. IP Addressing scheme. A Host on THIS NETWORK. Routers: Dedicated Hardware versus Server-Based Routers. USB Hub. Managed Hubs and Switches. Proxy Server. Cables Connecting Hubs and Switches. Advantages and Disadvantages of dedicated hardware routers. Other Devices: Modems. Gateways Functionality. Universal identifiers. Limitations to Classful Addressing. Motivation for internetworking: How networks differ. Class C. Internet architecture. Range of addresses in each class. Wireless router. Repeaters: Uses of Repeaters. Brouter. Different classes of IP addresses: Primary classful addresses. Dotted decimal representation. LOOPBACK. Protocols and Significance for internetworking: Protocols for internetworking. Internet layering model. Significance of internetworking. Class A. Special IP addresses: Interpreting all Zero to mean ―THIS HOST‖. Unit 10: Networking Devices Introduction: Goal of networking devices. Transport Protocols: TCP protocol. Broadcast on LOCAL network. Types of Bridges. Hubs: Classification of Hubs.Unit 9: Transport Layer Introduction: Services of Transport layer: Service primitives.

ICMP message format. Router discovery: Router advertisement message format. Types of address resolution: Resolution through Direct mapping. Limitations. Reports of Unreachability. CIDR reserved for private networks. Link state request. OSPF: Goals. Disadvantage. Congested and Datagram Flow control: Source quench format. Database description. Link state acknowledgement. Maintenance of subnet masks. Disadvantage of fixed length subnetting. Representation of subnet masks. Types of Messages: Principle ICMP messages. Benefits of subnets. Proxy ARP. Router solicitation: Router solicitation message format. Supernetting: Effect of supernetting on routing or CIDR. Variable length subnets: Advantage. Resolution through Dynamic Binding. RARP reply. Example on subnetting. ARP reply frame. RARP protocol: RARP request. RIP. ARP cache: ARP time outs. Example on CIDR. ARP frame format: ARP request frame. Reporting other problems. Subnet address extension. Route change requests from routers: Redirect message format. Detecting circular or long routes: Time exceeded message format. Unit 6: Routing in the Internet: Interior gateway protocol Introduction. OSPF message header. Subnet masks: Implementation of subnet using subnet masks. Subnet address format. Testing Destination Reachability and Status: Echo Request and Echo Reply message format. 58 . Unit 5: Internet Control Message Protocols Introduction. Unit 4: Subnet and Classless Addressing Introduction. IGP: Definition. Minimizing network numbers: Transparent Routers. ICMP: ICMP Encapsulation. Obtaining a subnet mask: Address mask request or reply message format. OSPF message formats: Hello. Hello protocol. CIDR address blocks and Bit masks. CIDR address blocks and CIDR notations. Flexibility in Subnet address assignment. Subnet addressing. Clock Synchronization and transit time estimation: Time stamp request or reply message format. Link state update. ARP protocol: ARP Implementation.Unit 3: ARP and RARP Introduction. Address Resolution problem.

Different ways to convey e-mail. World wide web: Architectural overview. BGP message header. BGP message types. Common URLs. Veronica: Types of information resources included in the index. BGP message types: Open message. Multimedia. Transposition cipher. DES. User agents. Header format. Unit 9: Internet Security Introduction. Cryptography: Encryption model. Symmetric key algorithm: Product cipher. Web Model. Digital signatures: Benefits of digital signatures. S/MIME. E-mail security: PGP. PEM. GOPHER. 59 . FTP: FTP features. EGP: BGP Characteristics. Electronic mail: Architecture. Network security. Transfer modes. IRC: Basic IRC Commands. FTP process Model. Time to live message. BGP functionality.Unit 7: Routing in the Internet: Exterior gateway protocol Introduction. E-mail Services. Unit 8: Internet Applications Introduction. Key restriction of EGP. Update message. Drawbacks of digital signatures. Notification message. Differences between WWW and hypertext system. Substitution cipher. XML security.

Hardware. Management.Management Information System from Managerial Outlook Introduction. Components of Information Technology: Software. Communicating Information. Implementation. Management information system as a discipline: Relationship of MIS to Reference Discipline. Managerial Needs. Information and Levels of Management. Storing Information. Humans Versus Computers. Processing Information. Managing Information in a Global Environment: Information management model: Diagnosis. What are Management Information Systems?: Introduction. The Manager‘s Job in a Global Environment: Management and Managers. Database Management Systems. Information Technology: The Role of Information Technology. Information as an Asset. Information as a Commodity. Human Unit 3 Information needs of Organisation and Individuals Introduction. Informational responses to the new environment. Information needed by different levels of management. Demands on Organizations in an Information Society: Components of an organizational information system. Organizational Design for Knowledge Work. Retrieving Information. Interpretation of MIS Concept. The concept of information: Meaning: Information as Processed Data. Design. Functional Information Needs: Accounting. Data communication technology. 60 . The Cost of Information: Acquiring Information. Organization and Management: What Are Organizations?. Information Required for the Process of Management: Functions of Managers. Information as the Opposite of Uncertainty. Evaluation. Uses of information: Information as a Resource. Unit 2 .Semester IV MC0076 – Management Information Systems Unit 1 Introduction to Management Information Systems Introduction. Organizational Needs. Development of Organisational Computing. Information as a Meaningful Signal. How information are selected and organized: The Components of Perception. Resources Marketing. The Need for Information Systems: Individual Needs. Operations. Finance.

Improving Quality. Storing Information. Information and the Situational Analysis: Major issues to consider in situational analysis: Potential Internal Strengths. Information for Management: Internal versus External Information. Cost Leadership. Information Management Requirements. Ensuring Privacy and Security Unit 4 The Structure of MIS Introduction. Potential External Opportunities. Strategies for Competitive Advantage: Differentiation. Enhancing Personal Productivity. Executive Information Systems: Characteristics of Executive Information Systems. Acquiring Information. Information Leadership. Challenges of Information Management: Dealing with Quantities of Information. Communicating Information. Improving Customer Service. International Corporation. Decision Support Systems: Characteristics of DSS. Expanding Globally. Types of Organizational Information: Transaction Processing Systems. Time Management Needs. The components of MIS. Organization Structure and Information: International Strategy: Multinational Corporation. Management Reporting Systems: Characteristics of MRS. Retrieving Information. Linkage. Information and Organizational Strategy: Strategy. Accessibility. Unit 5 Information Needs for Strategic Planning Introduction. Using Information for Strategic Advantage: Reacting to Market Conditions. Michael Porter's Competitive Force Model. Potential Internal Weaknesses. 61 . Reporting by MRS. Controlling Costs. Creating Strategic Alliances. Transnational Corporation. Value Streams: Michael Porter's Value Chains. The Strategic Use of Information System. Enhancing Personal Productivity. Office Information Systems. Organizational Requirements of Information: Cost. Capabilities of information system in an organizational view. Career-Related Needs. Potential External Threats. Security. Michael Porter's Generic Strategies for Competitive Advantage. The Individual at Work: The Information Needs of Individual Job Holders: Task-Related Needs. Facing Insufficient or Conflicting Information. Reliability. Focus. The Role of Expert System.Mechanisms for Acquiring and Distributing External Information. Global Corporation.

Operational Information. What do Mangers Accomplish?: Managerial Roles and Their MIS Support. Privacy and Databases. Technology Evaluation Factor. Ethical and social issues with network: Home Office: The Value of Telecommuting. Characteristics of ERP Solution. Risks of Internet to Organizations. Enterprise Resource Planning (ERP) System: ERP Architecture. MIS plan is linked to the business plan: MIS goals and objectives. Individual Limits to Rational Decision Making. ERP Solution Evaluation. Common Business Exposures. Major threats to IT installations. Decision Support Information. Decision Making: Rational decision making and its limits: Organizational Limits to Rational Decision Making. Ascertaining the class of information: Organisational Information. The architecture of the MIS. ERP Selection: Vendor Evaluation Factors. Hardware and software plan. Data Security and Data Privacy. EMS and MIS. Business System. MIS and BPR Unit 9 Manager and Decision Making Introduction. Functional Information. Management of Quality in the MIS Unit 8 Business Process Re-engineering Introduction. Redesigning of Processes: What delays the business process?. The system development schedule. Benefits of the ERP. Relevance of Information Technology (IT). Technology. Organisation and Business Process Reengineering: Definition and Approach. Enterprise Management System (EMS): Business needs of today. Knowledge Information. Implementation. Unit 7 Quality and Privacy Issues Introduction. Development of long range plans of the MIS: Contents of MIS Plan. Value stream model of organisation. Process model of the Organisation. ERP Solution Structure: Business Operations.Unit 6 Impact of IT – Managing in 21st Century Introduction. Business process. ERP Model and Modules: ERP Basic Features: General Features. Implementation of the Management Information System. Other Remote Options. Ethical and Social issues with ECommerce. Strategy for the plan achievement. Business Decisions and Information Assurance: Introduction. 62 .

Organisational aspects of DSS and EIS. Unit 10 DSS and EIS Introduction. Query Planning for Nested SQL queries. Relational Model: Relational Operations. Systems Based on Optimization Models. Query Plan. Fourth Normal Form. Who builds a DSS. Classification of DSS: Data Access Systems.Individual differences and cognitive styles: Creativity in decision making by individuals and groups: Software that assists your creativity. How to Measure Index Selectivity?. Flat Model: Hierarchical Model. Query Optimizer. Systems Based on Accounting Models. Executive Information Systems. Building a decision support system: DSS Technology.Cost Estimation.Database Internals: Indexing. Boyce-Codd Normal Form. Heuristics of Query Optimizations: Equivalence of Expressions. Implementation. Pipelined Multi-way 63 . Capabilities of DSS. MC0077 Advanced Database Systems Unit 1 Introduction Introduction. Domain/Key Normal Form. Systems Based on Representational Models. Manually measure index selectivity. Natural Join Operation: Join Ordering. Post-relational Database Models. Selection Operation. Object Database Models. Developmental trends in DSS. How to choose Composite Indexes?. Forecast-Oriented Data Analysis Systems. Normal Forms: First Normal Form. Components of DSS: Data Management Subsystem. Transactions and Concurrency. Replication Unit 2 Query Processing Introduction. Database models. The Dialog Management Subsystem. Projection Operation. Second Normal Form. Dimensional Model. Guidelines for choosing columns for composite indexes: Join Strategies for Parallel Processors: Parallel-Join. Third Normal Form. Measuring Index Selectivity: Index Selectivity. How DSS are developed?. Data Analysis Systems. Network Model. How DSS are Deployed?. When should you use the decision support approach?: Ill structured problems. History. The model Management Subsystem.

CBIR: Using Content Descriptors. Data Collection. Uniformity.Recall and Precision. Entity-Relationship. Efficient SELECT statements. Declarative Data Models. Result Presentation: Ordering Query Results – Ranking. Data Management Functions. Accessing Multi-Valued Structures. A Structural Semantic Data Model – SSM: SSM Concepts: Entity Types. Object-Oriented. New Features in SQL3: Accessing Hierarchic Structures. Query Processing. Attribute Types. Physical Organization. Query Optimization. Database Design & Creation. Standards for Metadata Specification: Dublin Core. Improving Result Quality. A Brief History. Modelling Multimedia Collections in SSM Unit 5 SQL 3 – Querying Complex Objects Introduction. Characteristics of Text Documents. Utilizing User Defined Data Types (UDT). Metadata for Mulltimedia: Semantic Metadata. SSM Syntax. Context Metadata. Retrieval using Context Metadata. Attribute-Based Image Retrieval. Database Query Language. Methodology. Domain Specification. Relationship Types. MIRS. Multiple Media Documents. Join Selectivity. Query Optimizing: Indexes. Image Retrieval Systems. Characteristics of Images. Cardinality Specifications. Text-based Information Retrieval. Disjunctive Clauses. Text Retrieval Using SQL3/TextRetrieval: Text Document Retrieval. Administrative Database Management Systems. Translation to Relational Constructs. Graphic vs. Accessing Large Objects. Management of Web Databases. 64 .Image Objects. W-DBM Unit 4 Advanced Data Modeling Introduction. MPEG-7. Concepts & Components. Image Retrieval: Using Extended SQL3 for Image Retrieval. Text-Based Image Retrieval. Views. Systems. Unit 3 Advanced Data Management Systems Introduction.Join. Color And Texture. Measuring Retrieval Quality . Text Retrieval by Semantic Content.Database Tuning. Data Value Constraints. Modeling Multiple Media Data Collections: Metadata. Information & Data Retrieval. Query by Image Content. Identifying Shapes . Optimizing SQL Query Processing: Introduction. The Evolution of Data Management Systems. Multiple Media Information Retrieval Systems. Result Presentation. CIDOC-CRM. Selectivity. Structural Metadata. Model Types: Relational. An example SQL3 query. Streamed Image Retrieval – Video.

Schema Architecture. History of Data Warehousing. Fuzzy Sets: Basic Concepts: Introduction. Data Storage Methods. Data Replication: Availability. Realization of Fuzzy SQL.Unit 6 Object Oriented Databases Introduction. Servers and Nodes. Disconnected Computing. Complex Objects and Inheritance. Clients. Data Visualization Unit 8 Fuzzy Dimension to Databases Introduction. Classification of Data. Object Models. Query Processing Architecture: Query Processing Methodology. Storage of LOBs. Implementation. 65 . Comparison of OLAP and OLTP. Mass Deployment. On-line Analytical Processing. OLAP Example. Large OBjects. Data Warehouse Architecture. Meta Knowledge. Techniques for implementation of Fuzziness in Databases. Transparency in a Distributed Database System. Rule Induction. Uncertainty: A Modern Outlook. Query Processing in Object-Oriented Database Systems: Type System. Heterogeneous Distributed Database Systems: The Mechanics of a Heterogeneous Distributed Database. Unit 7 Data Warehouse & Data Mining Introduction. Hierarchical Structures. Fuzzy Databases: Need for Fuzzy Databases. Database Links. Advantages of using Data Warehouse.Market Basket Analysis example. LOBs. IBM . Neural Networks. Sequential/Temporal patterns. Object . Fuzzy Querying to Relational Databases: The proposed model. Schema Objects and Naming in a Distributed Database. Site Autonomy. Encapsulation. Introduction to Data Mining. Remote and Distributed Transactions. Fuzzy Set Operators and Fuzzy Logic. Decision Trees. Data Mining Functions: Classification. Definition. Relationships. Unit 9 Distributed Database Systems and Data Replication Introduction. DB Design: From Requirement Analysis to DB Specification. SQL3 DB specification: Complex Structures. Groups. Performance. Network Load Reduction. Statements and Transactions in a Distributed Database: Remote and Distributed Statements.Relational Database Implementation: DB Components. Data dredging. Associations. Induction. Applications That Use Replication: Replication Objects. Direct and Indirect Connections. Clustering/Segmentation. Data Mining Techniques: Cluster Analysis.

Decentralized Control. Incremental Growth. 66 . Reduction of Redundancy. Replication Sites. Reduced Communication Overhead. Distributed Deadlock Detection: False Deadlock. Classification of Concurrency Control Techniques. Elimination of ―Prepare‖ Message: Increasing Efficiency by Using Defaults. Network Partitions. Replication Transparency. Conflict Detection and Procedural Replication Unit 10 Transaction Management in Distributed Database Management Introduction. Data Independence. Distributed Directory (Catalog) Management. Two-Phase Locking Algorithm. Recovery and Concurrency Control. Biased Protocol. Distributed Query Processing. Problem Areas of Distributed Databases. Failure of the Coordinator. Other Options for Multi-Master Replication: Synchronous Replication. Complex Physical Structures and Efficient Access. Recovery in TwoPhase Commit Protocol: Site Failures. Two-Phase Commit Protocol. Reliability and Availability. Transaction Processing Framework. Hierarchical Deadlock Detection. Conservative Timestamp Ordering Algorithm. Privacy and Security. Materialized View Replication. Performance Considerations. Models of Failure. Multi-Master and Materialized View Hybrid Configurations. Relative Advantages of Distributed Databases over Centralized Databases: Organizational and Economic Reasons. Failure of Coordinator.Master Replication.and Sites: Replication Objects. Centralized Databases or Differences in Distributed & Centralized Databases: Centralized Control vs. Replication Group. Primary Copy. Structure of Distributed Database Management Systems. Three-Phase Commit Protocol: Recovery in Three-Phase Commit Protocol: Site Failures. Majority Protocol. Types of Replication Environments: Multi . Integrity. Concurrency Control (Serializability). Centralized Deadlock Detection. Management of Distributed Data with Different Levels of Transparency: Distribution or Network Transparency. Concurrency Control Techniques: Timestamp-Based Algorithms. Features of Distributed vs. Optimistic Algorithm. Locking Protocols for Concurrency Control in Distributed Databases: SingleLock-Manager Approach. Deadlock Handling: Deadlock Prevention. Remote Recovery Information Problem. Fragmentation Transparency. Procedural Replication. Deadlock Detection. Coordinator Failure Protocol. Multiple Coordinators.

Access Specifiers.MC0078 (A) Java Programming Unit 1 Getting Started Features of Java. Logical Operators. Naming Variables. ‗Continue‘ Statement Unit 4 Inheritance. Packages. What is Inheritance?. Data Types in Java. ‗Break‘ statement. Comparison Operators. ‗do…. Readers and Writers. Common Exceptions. Using classes in java.while‘ statement. Invoke methods. Switch Statement. Control Flow Statements. Primitives Data Types. Increment and Decrement operators. Exception Classes. Defining an Interface. Executing a Java Program Unit 3 Playing with Java Introduction. Java Magic: Byte Code Unit 2 Basics of Java Introduction-Keywords. Random Access Files. Variables in Java. Interfaces verses abstract classes Unit 5 Exception Handling Definition of an Exception. Defining a Package. Code to display Test Value. The abstract class. How to Save a Java Program. How to include comments. Arithmetic Operators. Package and Interface Inheritance. Types of Relationships. Declaring methods in java. While Statement. Understanding CLASSPATH. Exception Handling Techniques Unit 6 Streams in Java Introduction to Streams. The main method. Operators. Ifelse statement. Abstract/Derived Data Types. Serialization 67 . How does it work?. Some uses of interfaces. Implementing Inheritance in Java. The Abstract Streams. Operator Precedence. Compiling Java Programs. Why Generalize?. Standard for coding. ‗for‘ Loop. Interface.

Web Architecture. What is Java IDL?. How to test a JSP?. History of Web Application. Event Listener.Event Handling. Example: The Hello Client-Server.The Applet Class. Event-Handling. Introduction. Adding Components to user interface. Java Beans. Introduction. Mechanism for connecting to a back end database. Servlet Life Cycle 68 .Life Cycle of an Applet.The Applet and HTML. Anonymous Classes Unit 8 JDBC Database Management.The Graphics Class. Adapter Classes.Painting the Applet.Objectives.Unit 7 Creating Front End Applets. How does JSP look?. RMI Terminology. Running the BeanBox Unit 10 JSP and Servlets JSP. CORBA and Java Beans RMI. The BeanBox.User Interfaces for Applet. CORBA.AWT Controls.What are Applets?. Inner Classes. Load the ODBC driver Unit 9 RMI. What is needed to write JSP based web application?. Event Classes. Servlets. Components of an Event.

Writing a Datagram Client and Server Unit 4 JSP What is needed to write JSP based web application?. Writing a Simple Bean. Compiling the Example Programs. Reading from and Writing to a Socket. Implementing the Server's main Method. Implementing a Remote Interface. The Java Servlet Development Kit Unit 6 Java Beans Using the NetBeans GUI Builder. Thread Priorities. Indexed Properties. Web Architecture. Datagram. Introspection 69 . Bound Properties. Declaring the Remote Interfaces Being Implemented. What Is a Socket?. Providing Implementations for Each Remote Method. . Simple Properties. Writing an RMI Server. Creating and Installing a Security Manager. Running the Example Programs Unit 3 Networking Socket. Synchronization The Main Thread.MC0078 (B) Advanced Java Programming Unit 1 Multithreading Processes and Threads. Creating a Client Program. Passing Objects in RMI. Making the Remote Object Available to Clients. Properties.Servlet Life Cycle. Creating a Thread. Creating Multiple Threads. The Java Thread Model. Designing a Remote Interface. What is a Datagram?. Inter-thread Communication Unit 2 RMI Introduction. Writing the Server Side of a Socket. How does JSP look?. How to test a JSP? Unit 5 Servlets History of Web Application.

x. A Relational Database Overview. Updating Tables. Applications Unit 8 CORBA What is CORBA?. Packaging Object Running the Sample Implementations Object Adapters. Implementation Type Checking. Interface versus Implementation Hierarchies. Retrieving Values from Result. Activation on Demand by the Basic Object Adapter (BOA) Unit 9 Introduction to AJAX Defining Ajax. Object Implementations Providing an Implementation. Differences Between Server Implementations. How Does Ajax Work? Unit 10 Introduction to Java Struts How Does Struts Work? 70 . Implementing a CORBA Client. Sets. Creating Complete JDBC Applications.Unit 7 JDBC JDBC Product Components. The Stock Application. Implementing a Server Using the Java 2 ORB. Implementing a Server Using VisiBroker 3.

Degeneracy in Transportation Problem Unit 5 Assignment Problems Introduction. The Structure of Mathematical Model Unit 2 Linear Programming Introduction. Methodology of Operations Research. Some basic definitions. Scope of Operations Research (OR). Methods of finding Initial Basic Feasible Solution. Multiple Service Channels. Mathematical Formulation of Transportation Problem. Duality Concept. Project Management – PERT Unit 7 Queuing Theory Models Introduction. General Structure of Queuing System. Phases of operations Research. Critical path Calculations. Hungarian Method. Erlang Family of Distribution of Service Times. Analysis of a Queuing Process. Solution of the LPP – Simplex Method. The significant features of OR. The Simplex Algorithm. Penalty cost Method or Big-M Methods. Sensitivity Analysis Unit 4 Transportation Problems Introduction. Two Phase Method. Basic difference between PERT and CPM. Finite Queuing Models 71 . Graphical Methods to Solve the LP Unit 3 The Simplex Method Introduction. Flowchart and C/C++ Programs.MC0079 Computer Based Optimization Methods (Statistics / Applied OR) Unit 1 Operations Research: The Science towards Excellence Introduction. Some special cases Unit 6 Network Analysis and PERT-CPM Introduction. The Standard form of LPP. Determination of Floats. Modified Distribution Method Algorithm. Special case of Transportation Problem. Queuing Theory. PERT / CPM Network components and precedence relationships. Determination of critical path. Linear Programming. Poisson-Exponential Single Server Model (Infinite Population). Mathematical Analysis of Queuing Process.

Gomory‘s all IPP Method. The Branch and bound technique Unit 9 Game Theory Models Introduction. All and Mixed IPP. Process of Simulation. Simulation Procedure. Random Numbers Allocation. Competitive Games and Strategies. Dominance. Maximin – Minimax Principle and Saddle Point. Graphical Method Unit 10 Simulation Introduction. All IPP algorithm. Some Miscellaneous Example 72 .Unit 8 Integer Programming Problem Introduction. Construction of Gomory‘s Constraints.

Binary Search Trees. Outline of Algorithmics. Unit 2 Mathematical Functions & Notations Introduction. Mathematical Expectation. Problems and Instances. Example of an Algorithm. The Notation . Splay tree. Notation for expressing algorithms. The Notation . Binomial Heaps. Characteristics of an Algorithm. Fibonacci Heaps. Depth-First Search. Unit 3 Elementary Data Structures Introduction. Role and Notation for comments. Insertion. Divide-and-Conquer. Well known Asymptotic Functions & Notations. Medians and Order Statistics. Quick Sort. Stacks and queues. Matrix Multiplication. How to augment a data structure. The height of a B – Tree. Collision resolution by chaining. Maintaining subtree sizes. Topological Sort 73 . Binary Search. Integer Multiplication. Building Blocks of Algorithms. Data Structures for Disjoint Set Unit 5 Graph Algorithms Introduction. Sorting. Well known Sorting Algorithms. Analysis of Algorithms – Simple Examples.MC0080 – Analysis of Algorithms Unit 1 Elementary Algorithms Introduction. Sorting in Linear Time. Rotations. Recursive Constructs. Hash tables. Procedure and Recursion. Mathematical Expectation in average case analysis. Linked lists. Analysis of First – Averages. Concept of Efficiency of an Algorithm. Best First Search & Minimax Principle. Recursion. The Notation . Zig Step Unit 4 B – Trees Introduction. The  Notation. Functions & Notations. Augmenting Data Structures. Average – Case and Amortized Analysis. Divide and Conquer Technique. Breadth-First Search. Traversing Trees. Determining the rank of an element. Properties of B – Trees. NIM/Marienbad Game. Binomial trees. Red-Black Trees. Modular Arithmetic / Mod function.

Pushdown Automata (PDA) Unit 10 Models for Executing Algorithms – III: TM Introduction. Classification of Problems. Matrix Multiplication using Dynamic Programming Unit 7 Greedy Techniques Introduction. Finite Automata Unit 9 Models for Executing Algorithms – II: PDFA & CFG Introduction.Unit 6 Dynamic Programming Introduction. Instantaneous Description and Transition Diagrams. The Principle of Optimality. Formal Language & Grammar. Djikstra‘s Algorithm Unit 8 Models for Executing Algorithms – : FA Introduction. NP-Complete and NP-Hard Problems. Prelude to Formal Definition. Notations for the Growth Rates of Functions. Undecidability of Post Correspondence Problem. Prim‘s Algorithm. Some Formal Definitions. Turing Machine: Formal Definition and Examples. Context Free Grammar (CFG). Establishing NP-Completeness of Problem 74 . Minimum Spanning Tree. Observations. Turing Machine as a Computer of Function Unit 11 Algorithmically Unsolvable Problems Introduction. Reduction. Some Examples. Regular Languages. Other Undecidable Problems Unit 12 Complexity of Algorithms Introduction. Undecidable Problems for Context Free Languages. Chained Matrix Multiplication. The Halting Problem. Kruskal‘s Algorithm. Formalization of Greedy Technique. Decidable and Undecidable Problems. Chomsky Classification for Grammar. The Problem of Making Change. Reduction to Another Undecidable Problem. Regular Expressions.

Net ASP. Exception Handling Unit 3 Building Windows and Web Forms Introduction.config File. Application State Unit 7 ADO.NET). Master Pages. Assemblies Overview Unit 2 Introducing C# Programming Introduction. Session State. The Global.Net Platform.Net Framework Introduction to . Control Statements. Cookies in ASP. Features of . XML & ADO. Themes & Control Skin Unit 5 ASP.NET Namespaces and Classes Fetching the data: DataAdapter. Architecture.NET Applications Anatomy of an ASP.NET. Understanding Properties & Indexes.Net Platform.Semester V MC0081 – DOT Net Technologies Unit 1 Introduction to Microsoft . Introducing Data Types.Net. Components of .NET State Management.NET Introduction. ADO.NET 75 .NET Introducing the ASP. The Web. Creating a Simple Windows Form.NET. Connection Strings using ADO.asax. Delegates and Events. Developing Web Forms: An introduction. Web Form Life Cycle. Creating your first C# Program. Basic ADO.NET Architecture.NET Features.NET. Connection String Builders (ADO. Application File Unit 6 State Management using ASP. Connecting to a Data Source using ADO. Building Connection Strings from Configuration Files.NET Application. Creating a Web Form Unit 4 ASP.

0. Web Service Proxies. Your First Web Service. Testing a Web Service. Deploying Your ASP. The Web Services Description Language (WSDL). Authorization and Roles. Web Service Discovery – DISCO. Web Services and Code-Behind. Authentication. Forms Authentication. A brief overview of Web Service Standard Unit 9 Website Deployment Internet Information Services (IIS). Profile.0).NET Security Model. Custom Membership Provider 76 . Client. Cryptography. Windows. Managing Application Pools in IIS 6. Web Service Clients. A Simple Web Service.NET Application Unit 10 Security The ASP. Services and Complex Data Types. Web. Membership. Web Service. Discovery – UDDI. Creating Application Pools (IIS 6.0).Unit 8 Web Services Introduction to Web Services.0 Architecture (IIS 6. IIS 6.

Deterministic Finite Automaton (DFA). Transition System (Transition graph). Sets and Cartesian product of sets. Closure Relation: Unit 2 Recursive Functions. Recursive Functions. Functions and Relations. Rooted Tree: Unit 5 Formal Languages and Grammars Introduction. Growth Function: Unit 3 Methods of Proof Introduction. Equivalence Relations. Grammars and Languages. Definitions and Examples. Isomorphism. Language accepted by a NDFA. Basic Terms. Moore and Mealy Machines: Unit 8 Further Problems on DFA and NDFA Introduction. Proof Techniques: Unit 4 Graphs and Binary Trees Introduction. Matrix Representations. Sequences and Strings. Trees.MC0082(A) – Fundamentals of Theory of Computer Science Unit 1 Mathematical Preliminaries for Computer Science Introduction. Problems on NDFA. Non-Deterministic Finite Automata. Strings and Growth Functions Introduction. Difference between DFA and NDFA 77 . Conversion from NDFA to DFA. Language accepted by a DFA: Unit 7 Non Deterministic Finite Automata Introduction. Classification of Grammars: Unit 6 Deterministic Finite Automata Introduction. Integer Functions. Problems on DFA.

Closure Properties of Regular Sets. Ambiguous Grammar: 78 . CFG for various types of CFL. Regular Grammar from Finite Automata Unit 10 Properties of Regular Languages and Pumping Lemma Introduction. Applications of Pumping Lemma: Unit 11 Context Free Grammars Introduction. Pumping Lemma.Unit 9 Regular Expressions and Regular Languages Regular expressions. Derivations. Regular Expressions accepted by the Language. Finite Automaton from Regular Grammar.

Binary Trees. Walks and Paths. Graphs. Types of Grammar: Unit 5 Deterministic Finite Automata (DFA) Introduction. Recursive Functions. Language accepted by a DFA: Unit 6 Nondeterministic Finite Automata (NFA) Introduction. Basic Terms. Pumping Lemma. Directed Graphs: Unit 4 Grammar and Formal Languages Introduction. Moore and Mealy Machines: Unit 7 Regular Expressions and Regular Languages Introduction. Strings and Growth Functions: Unit 2 Proof Techniques Introduction. Grammars and Languages. Sets and Properties. Language accepted by a NFA. Closure Properties of Regular Sets.MC0082(B) –Theory of Computer Science Unit 1 Mathematical Fundamentals for Computer Science Introduction. Finite Automata from Regular Grammar. Deterministic Finite Automata (DFA). Functions and Relations. Equivalence Relations . Proof Techniques Unit 3 Trees and Binary Trees Introduction. Trees. Regular Expressions accepted by the Language. Transition System (Transition graph). Regular expressions. Applications of Pumping Lemma: 79 . Construction from NFA to DFA. Regular Grammar from Finite Automata: Unit 8 Regular Languages-Properties and Pumping Lemma Introduction. Nondeterministic Finite Automata.

Construction Introduction. Design or Construction of a Turing Machine: 80 . Derivations. Applications of Pumping Lemma for CFL. Closed Properties of CFL Unit 12 Turing Machines. CFG for various types of CFL. Turing Machine Model.Unit 9 Context Free Grammars Introduction.Properties Introduction. Ambiguous Grammar: Unit 10 Pushdown Automata (PDA) Introduction. Definition of PDA and Moves. Construction of Pushdown Automata. Graphical Representation. Pumping Lemma. Language Accepted by a Turing Machine. Deterministic and Non-deterministic PDA: Unit 11 Context Free Languages .

Goals of the UML.‘s Object Modeling Technique. Objects. Building high-quality software. Two orthogonal views of the software. Overview of the Unified Approach (UA): Unit 2 Object Basics Introduction. The Jacobson et al. Encapsulation and information hiding. Prior to Industry Convergence. Consumer-producer association. Multiple inheritance. Advantages of Object Orientation. Case Study: A payroll program. The Booch Methodology. Aggregation and object containment. Methodologies. The software development process. UML-defining Artifacts. Outside the Scope of the UML. Advanced topics. Meta classes Unit 3 Object Oriented Systems Development Life Cycle Introduction. Frameworks. Development Project Artifacts.MC 0083 Object Oriented Analysis and Design using UML Unit 1 An Overview of Object-Oriented Systems Development Introduction. Objects are grouped in classes. Rumbaugh et al. Patterns. Object behavior and methods. Industry Trends in Software. Structured Approach. Objectoriented systems development: A use case approach. The Unified Approach Unit 5 UML Summary Overview. Why We Model. Object relationships and associations. Inheritance. Object oriented systems development methodology. Motivation to Define the UML. Objects respond to messages. Object persistence. Primary Artifacts of the UML. Polymorphism. Features of the UML 81 . Class hierarchy. An object-oriented philosophy. Reusability: Unit 4 Object Oriented Methodologies Introduction. Object and Identity. Attributes: Object state and properties. Static and dynamic binding. The object-oriented approach. Comparing UML to Other Modeling Languages. Scope of the UML.

Model Management: Unit 8 UML Notation Guide Diagram Elements. and Generalization. Common Behavior. Core. General Extension Mechanisms. Type-Instance Correspondence. Mechanisms. Extension. Bound Element. Binary. Sequence Diagram. Subsystem. Collaboration Diagrams. Activity Graphs. (Template). Attribute and Operation. Keywords. Naming Conventions and Typography. Utility and Metaclass. Object and Composite Object. Composition. Invisible Hyperlinks and the Role of Tools String. Nested Class Declarations. Data Types: Unit 7 Behavioral Elements Behavioral Elements Package. Properties. Element. Association. Link. Package Structure Levels of Formalism.Unit 6 UML Architecture and Foundation Language Architecture and Language Formalism. State Machines. Note. Association Class and N-ary Association. Interaction Diagrams. Dependency and Derived Element: Unit 10 Other UML Diagrams Use Case Diagrams. Stereotype Declaration and Powertype. Model. State chart Diagrams. Accessing or Importing a Package. Class Pathnames. Stereotypes: Unit 9 Static Structure Diagrams Class Diagram and Object Diagram. Association. Name. Implementation diagrams: 82 . Constraint and Comment. Four-Layer Meta model Architecture. Activity Diagrams. Multiplicity and Qualifier. Name Compartment and List Compartment. and Association End. Use Cases. and Label. Model Management Package. Collaborations. Enumeration. Expression. Graphs and Their Contents. Type and Implementation Class. Foundation Package. Drawing Paths. Interfaces and Parameterized Class.

Predefined OCL Types. Summary of Profile. Basic Values and Types. Introduction. Objects and Properties: Unit 14 Object Constraint Language Specification OCL PART – 2 Collection Operations. The Standard OCL Package. Introduction. Stereotypes and Notation. Activity Diagrams.Unit 11 UML Diagrams – Part II State chart Diagrams. UML Profile for Business Modeling. Implementation diagrams: Unit 12 UML Example Profiles UML Profile for Software Development Processes. Introduction. Summary of Profile. Simple visitor Example: Unit 13 Object Constraint Language Specification OCL PART – 1 Overview. Relation to the UML Metamodel. Stereotypes and Notation. Grammar: 83 . Example for Existence Dependency and classes found in Business.

Project. The Intermediate COCOMO Model Introduction to COCOMO II. Stakeholders. Tasks in Project Planning. The Management Spectrum – People. COCOMO model. Flat Organizational Structure. Hierarchical. Scheduling Techniques. Project Communication. Process. Automated Tools 84 . Capital budgeting. Organizational Structure. Job Roles in Software Development: Unit 2 Overview of Project Management Introduction to Software Project Management. NPV. Product. Organizational Structures. Matrix Organizational Structure. Project Management activities. T-Form Organization. Cost Estimation Guidelines. PERT Technique. IT and Organizational Structures. The Basic COCOMO Model. Factors influencing Project Management. Development Life cycle models. Budgeting. ROI. Comparison of Methods. Project Development Management Associations Unit 3 Project Planning Introduction. Project charter. Software Cost Estimation Methods.MC 0084 (A) Software Project Management and Quality Assurance Unit 1 An Introduction to Software Development Organization and Roles Introduction. Statement of Work (SOW). Payback models: Phases. Project Manager. Gantt Chart. A generic project model: Unit 4 Estimation and Budgeting of Projects Introduction. Software Cost Estimation. Work Breakdown Structures (WBS). Critical Path Method. Project Unit 5 Project Scheduling Introduction. Networked Organizational Structure.

Performing Closure Analysis. Effective Risk Management. Baselines. Organization. Closure Analysis Report. Decentralized-Control Team. Case study 8. Software Configuration Items. Cost of quality. Risk categories. Conflict management Unit 9 Introduction to Software Quality Assurance Introduction. An Assessment of Team Organizations. Self Assessment Questions. Goals of Software Assurance. Risk Components and drivers. Identification of objects in the Software Configuration. Software Quality Assurance Activities Software qualities. Concepts of Risks and Risk Management. Project Closure Analysis. Version Control Status Reporting. Organization. The Role of Closure Analysis. Creating the Software Quality Assurance Plan: Unit 10 Project Closure Introduction. Risk Management Activities as applied to project management. Goals of SCM: Unit 8 Team Development and Conflict Management Introduction. Risk Prioritization: Unit 7 Configuration Management Introduction. Sample closure analysis report 85 .Unit 6 Risk Management Introduction. Team discipline. Case study: Open-source development team organization. Standards and Procedures. Centralized-Control Team Organization. Mixed-Control Team Organization. Aids for Risk Identification. Types of standards. Supportive activities involved in the software life cycle. Formal Technical Reviews.2: Nokia software factories. Software Configuration Management. Quality. Software Configuration Management process.

Control Hierarchy. Basis Path Testing. IEEE recommended steps for process improvement. Software Measurement . Alpha and Beta Testing. Advantages and Disadvantages of White Box Testing. Metrics and Indicators. Metrics for Software Quality Unit 5 Software Design and Principles Introduction. Debugging. System Testing . Earned Value Analysis (EVA). Evolution of Software Design. Design Principles. Validation Test Criteria S/w. Design Concepts. Modularity. Software Procedure. Structural Partitioning. Automated Testing. Measure. Bottom-up Integration. Software Design Process. Boundary Value Analysis.MC 0084 (B) . Data Structure. Big Bang.Advanced Software Project Management and Quality Assurance Unit 1 Project Monitoring and Controlling Introduction. Manual Testing. Unit Testing. List of Testing Tools: Unit 3 Software Testing Strategies Introduction. Steps to Process Improvement. Performance Testing . Project Communication Plan & Techniques. Types of Software Testing. Project Metrics. Steps for Debugging . Black Box Testing Equivalence Partitioning. Roles in Software Testing Unit 4 Software Process and Project Metrics Introduction. Project Status Reporting. S/w validation. Abstraction. Cause – Effect Graphing Techniques. Process Metrics. Information Hiding. Cohesion. Software Architecture. Coupling: 86 . Design and Software Quality. Security Testing . Why use Metrics?. Unit Test Considerations . Testing Life Cycle. Cyclomatic Complexity. Integration Testing . Flow Graph Notation. Control Structure Testing. Verification and Validation. White Box Testing Techniques. Refinement. Effective Modular Design. Top-down Integration . Configuration review. Deriving Test Cases. Functional Independence. Project Metrics. Six Sigma: Unit 2 Testing Techniques Introduction. Recovery Testing . Stress Testing .

What Makes Cleanroom Different?. Software Quality Assurance Activities. Technical Problems of Reengineering. CASE Repository Unit 9 Formal Methods Introduction. ISO Standards for Software Organization. Classification of CASE Tools. Comparison between ISO & SEI CMM. Integrated CASE Environments. Software Qualities. Other Standards and Initiatives: Unit 8 CASE (Computer Aided Software Engineering) Tools Introduction . Formal Specification Languages. Mathematics in Software Development. Standards. CASE support in Software Life Cycle.Unit 6 Clean Room Software Engineering Introduction. 87 . Clear-Box Specification. Software Reengineering Process Model. The Ten Commandments of formal languages Unit 10 Re-Engineering Introduction. The Cleanroom Strategy. Mathematical Preliminaries. Architecture of CASE Environment. State-Box Specification. Terminology of Software Reengineering. Functional Specification. Black-Box Specification. Redevelopment or Reengineering. Cleanroom Design: Unit 7 Software Quality Assurance Introduction. Growing problems of software maintenance. Steps for CASE Tool Implementation. Business Process Reengineering. SEI – Capability Maturity Model.

Unit 5 Synchronization Introduction. Buffering. Clock Synchronization Algorithms. Features of Message Passing. Call. Distributed Operating Systems. Clock Synchronization. Distributed Computing System Models. RPC Messages. Failure Handling. Synchronization. Fixed Distributed – Server Algorithm. Issues in IPC by Message Passing. Implementing under RNMBs Strategy. Deadlock. Unit 3 Remote Procedure Calls Introduction.MC 0085 Advanced Operating Systems (Distributed Systems) Unit 1 Introduction Distributed Computing Systems. Client-Server Binding. Memory Coherence (Consistency) Models. Communication Protocol for RPCs. Structure of Shared Memory Space in a DSM System. Load – Balancing Approach . Event Ordering. Semantics. Task assignment Approach. Load – Sharing Approach. 88 . Group Communication. Complicated RPC. Unit 4 Distributed Shared Memory Introduction. Dynamic Distributed Server Algorithm. Thrashing. Distributed Algorithms. Election Algorithms. Server Management. Unit 6 Resource Management Introduction. Issues in Designing Distributed Operating Systems. Unit 2 Message Passing Introduction. Transparency of RPC. 4. Centralized – Server Algorithm. Desirable Features of a Good Global Scheduling Algorithm. STUB Generation. Distributed Computing Environment. Process Addressing. Marshaling Arguments and Results. Granularity – Block Size. The RPC Model. DSM – Design and Implementation Issues. Implementing Sequential Consistency. Distributed Shared Memory Systems (DSM). Security. Implementation of RPC Mechanism. Mutual Exclusion. Parameter Passing. Advantages of Distributed Systems.7 Memory Consistency models.

Desirable Features of a Good Naming system. Design Principles. Naming and Security. Unit 9 Naming Introduction. Caching. Access Control. Unit 10 Security in Distributed Systems Introduction. Authentication. Process Migration. Object – Locating Mechanisms. The Key Challenges of Distributed Systems. Digital Signatures. Fundamental Terminologies and Concepts.Unit 7 Process Management Introduction. Ceph. Cryptography. Potential attacks to Computer Systems. Human – Oriented Names. Replication. 89 . Server‘s Perspective Implementation. Stateful Versus Stateless Servers. Client‘s Perspective: File Services. File Access Semantics. System Oriented Names. Unit 8 Distributed File Systems Introduction. Threads. Name Caches.

A Simple Image formation Model. Fundamental Steps in Digital Image Processing. Adjacency.Image Sampling and Quantization Introduction. The Origins of Digital Image Processing. Imaging in the Ultraviolet Band. Unit 4 .Digital Image Processing Unit 1 Digital Image Processing – An Introduction Introduction. Connectivity. False Color.MCA 6th Semester MC0086 . Edge Crispening: Linear Technique. Basic concepts in Sampling and Quantization: Representation of Digital Images. Unit 2 . Image formation in the Eye. Some Basic Relationships between Pixels: Neighbors of a Pixel. Regions and Boundaries. Imaging in the Microwave Band. Spatial and Gray-Level Resolution. Image Acquisition using Sensor Arrays. X-ray Imaging. Non Linear Noise Cleaning. Imaging in the Radio Band. Zooming and Shrinking Digital Images. 90 . Unit 3 . Contrast Manipulation : Amplitude Scaling. Imaging in the Visible and Infrared Bands. Light and the Electromagnetic Spectrum. Histogram Modification. Image Acquisition using a Single Sensor. Pseudo Color. Brightness Adaptation and Discrimination. Image Sensing and Acquisition. Examples of Fields that use Digital Image Processing: Gamma-ray Imaging. Distance measures. Multispectral Image Enhancement. Statistical Differencing. Image Acquisition using Sensor Strips. Color Image Enhancement: Natural Color Image enhancement.Image Enhancement Introduction . Linear and Nonlinear Operations. Aliasing and Moiré Patterns. Components of an Image Processing System. Elements of Visual Perception: Structure of the Human Eye.Digital Image Fundamentals Introduction. Noise Cleaning: Linear Noise Cleaning.

Visual Texture Discrimination. Edge. Indirect Estimation Methods. Skeletonizing. Global processing via Graph-Theoretic Techniques.Image Restoration Introduction. Continuous Image Spatial Filtering Restoration: Inverse Filter. Thickening. Unit 9 . Edge Detection. Morphological algorithm operations on binary images: Shrinking. 91 . Luminance Edge Detector Performance: Edge Detection Probability.Image Segmentation 1 Introduction. Line and Spot Detection. Color Photography. Hit-or-miss transformation: Additive operators. Unit 8 . Image Feature Evaluation.Image Feature Extraction Introduction. Morphological algorithm operations on gray scale images: Gray Scale Image Dilation and Erosion.Morphological Image Processing Introduction. Close and Open. Amplitude Features. Line and Spot models. Detection of Discontinuities: Point Detection.Unit 5 . Transform Coefficient Features. Color Edge Detection. Basic operations: Dilation. Properties of Dilation and Erosion. Subtractive operators. Photographic Process Models: Monochromatic Photography. Texture Features: Fourier Spectra Methods. General Image Restoration Models. Autocorrelation Methods. First-Order Derivative Edge Detection: Orthogonal Gradient Generation. Edge Linking and Boundary Detection: Local Processing. Gray Scale Image Close and Open Operators. Unit 6 . Thinning. Erosion. Unit 7 . Blind Image Restoration: Direct Measurement Methods. Global processing via the HOUGH transform. Edge-Fitting Edge Detection. Edge Detection Methods. Texture Definition. Wiener Filter.Edge Detection Introduction. Line Detection. Second-Order Derivative Edge Detection. Optical system Models.

Subband coding.Wavelets and Multi Resolution Processing Introduction. Unit 11 . Image Pyramids. Multiresolution processing and wavelets.Image Segmentation Introduction. Global Thresholding. Perimeter and Area Measurements: Distance Measures. Topological Attributes. Perimeter and Area Measures. Series Expansion: Windowed Fourier transform. Spatial Moments: Discrete Image Spatial Moments.Unit 10 .Continuous Wavelet Transform. Fourier Descriptors. Non-Standard decomposition. Thresholding: Foundation. Haar transform. Shape Orientation Descriptors. Discrete Wavelet transform in one dimension. Region-Based Segmentation: Basic Formulation. Wavelet transforms in two dimensions: Standard decomposition. Scaling functions . 92 . Adaptive Thresholding. Wavelet functions.Shape Analysis Introduction. Region Growing. The Role of Illumination. Thinning and Skeletonizing. Distance. Unit 12 . Region Splitting and Merging.

Bootstrap Protocol (BOOTP). Methods of Delivery: Unicast.25. DHCP Lease Renewal Process. Integrated Services Digital Network (ISDN). Fiber Distributed Data Interface (FDDI). Application Layer. Dynamic Host Configuration Protocol (DHCP): DHCP Message Types. ARP Detailed Concept. Ethernet and IEEE 802 Local Area Networks (LANs). Point-to-Point Protocol (PPP). Multicasting. Frame relay: Frame Format. Basic NAT translation mechanism. Classless Inter-Domain Routing (CIDR): CIDR implementation. Internet Protocol (IP): IP Datagram. Unit 4 . Broadcasting. Asynchronous Transfer Mode (ATM): Address Resolution. Indirect Routing. IP Routing Algorithm.Internetworking Protocols-1 Introduction. TCP/IP Terminology. IP Routing Table. Fragmentation. IP Datagram Routing Options. IP Datagram Format. NAT limitations. X. The TCP/IP Protocol Suite: Network Interface Layer.Architecture of TCP/IP Introduction. The Internet Standard Process. Unit 2 . Classical IP over ATM. The IP Address Exhaustion Problem.Internetworking with TCP/IP Unit 1 . Network Address Port Translation (NAPT). Basic NAT. Transport Layer. IP Addressing. Reverse Address Resolution Protocol (RARP). Internet Layer.Network Interfaces Introduction.Internetworking Protocols-2 Introduction. Internet Control Message Protocol (ICMP): ICMP Messages. Any casting. Intranets: Private IP Addresses. Network Address Translation (NAT): Traditional NAT. Reusing a previously allocated network address. Serial Line IP (SLIP). 93 . Unit 3 . IP Routing: Direct Routing. Interconnect issues. Address Resolution Protocol (ARP): ARP Overview.MC0087 .

Multicasting between network segments. Integrated Services: Service classes. UDP Application Programming Interface. EIGRP packet types. Guaranteed Service. Multicast applications. Internet Group Management Protocol (IGMP): IGMP messages. Multicast addressing: Multicasting on a single physical network. RIP limitations. Sockets. Neighbor communication.Routing Protocols Introduction. The multicast backbone: MBONE routing. Open Shortest Path First (OSPF): OSPF terminology. Interconnecting multicast domains: Multicast Source Discovery Protocol (MSDP). Why QoS?. Building and maintaining multicast delivery trees. The Resource Reservation Protocol (RSVP). PIM sparse mode. Distance Vector Multicast Routing Protocol (DVMRP): Protocol overview. Multicast forwarding algorithms: Reverse path forwarding algorithm. Unit 6 . Enhanced Interior Gateway Routing Protocol (EIGRP): Features of EIGRP. TCP Congestion Control Algorithms. Autonomous systems. User Datagram Protocol (UDP): UDP Datagram Format. Unit 7 . Border Gateway Protocol (BGP): BGP concepts and terminology. IGMP operation. Border Gateway Multicast Protocol. Controlled Load Service. Hybrid routing. OSPF stub areas. Integrated Services 94 . Multicast OSPF (MOSPF). Path vector routing. RIP packet format. Routing Information Protocol Version 2 (RIP-2): RIP-2 packet format. IP Routing: Static routing. RIPng for IPv6: Differences between RIPng and RIP-2. Link state routing. Transmission Control Protocol (TCP): TCP Concepts. OSPF route. Distance vector routing. OSPF route summarization. OSPF neighbor state machine.IP Multicast Introduction.Unit 5 .Transport Protocols Introduction. RIP modes of operation. redistribution. Multicast delivery tree. Multicast routing protocols. Center-based tree algorithm. Ports and Sockets: Ports. IBGP and EBGP Path selection. Exterior Gateway Protocol (EGP).Quality of Service Introduction. Calculating distance vectors. Protocol Independent Multicast (PIM): PIM dense mode. RIP-2 limitations. Routing Information Protocol (RIP): RIP packet types. DVMRP tunnels. Unit 8 .

Mapping domain names to IP addresses. Internet Key Exchange (IKE) protocol. Implementations of security solutions. Types of firewalls. Network security policy. Telnet: Telnet Operation. Naming. Differentiated Service Domains. Fully Qualified Domain Names (FQDNs): Generic Domains.outlook. Domain Name System Resource Records. Telnet Basic Commands. Domain Name Resolver Operation. Mapping IP Addresses to Domain Names: Pointer Queries. Authentication Header (AH).Remote Execution Introduction. The SET certificate scheme. Unit 9 . Combining IPSec protocols. Unit 10 . Solutions to network security problems. Security exposures and solutions: Common attacks against security. Kerberos authentication process. The Distributed Name Space. SET transactions. Domain Name System Messages: Message Compression. Remote Execution Command Protocol (REXEC and RSH). Domain Name Resolution: Domain Name Full Resolver. 95 . Principle of Operation. Secure Electronic Transaction (SET): SET roles. Using the DNS Uniform Resource Identifiers (URI). Differentiated Services: Differentiated Services architecture. SOCKS: SOCKS Version 5 (SOCKSv5).TCP/IP Security Introduction. Kerberos authentication and authorization system: Assumptions. Secure Sockets Layer (SSL): SSL overview. Unit 11 . Components of a firewall system. Firewalls: Firewall concept. Virtual private networks (VPNs) overview: VPN introduction and benefits.Domain Name System Introduction. Domain Name Server Operation. Telnet Command Structure. IP Security Architecture (IPSec): Concepts. Country Domains. Secure Shell (1 and 2): SSH overview. SSL protocol. Domain Name Stub Resolver. Encapsulating Security Payload (ESP). Integrated Services (Intserv) over Diffserv networks. Network Virtual Terminal. Option Negotiation.

Internet Message Access Protocol (IMAP4): Fundamental IMAP4 Electronic mail models. Security Issues. Simple Mail Transfer Protocol: How SMTP Works.Mail Applications Introduction. File Transfer Protocol (FTP): An overview of FTP.Voice over Internet Protocol Introduction. SIP protocol architecture. SMTP Messages. Media Gateway Control Protocol (MGCP).FTP and TFTP Introduction. IMAP4 states. Mail Exchange. Session Description Protocol. Protocol Description.Unit 12 . IPTV technologies: Summary of protocol standards. Unit 13 . Post Office Protocol (POP). IMAP4 messages. CODEC (encode and decode). Real-Time Moving Picture Experts Group (MPEG) standards. Display devices and control gateway. VoIP functional components. Unit 14 . An Additional Example. TFTP Multicast Option. Session Initiation Protocol (SIP) technologies: SIP request and response. Sample SIP message flow. Stream Control Transmission Protocol. IP (TV) transport. TFTP Packets. Functional components: Content acquisition. 96 . Trivial File Transfer Protocol (TFTP): TFTP Usage. Mail Header Format. Data Modes. FTP Operations. H. SMTP Mail Transaction Flow. Control Protocol. IPTV overview.261. Real-Time Transport Protocol (RTP). The SMTP Destination Address.

Business Intelligence Tools. Examples for Star. Data. A Multidimensional Data Model: Stars. Data Transformation. Data Cleaning: Missing Values. Unit 3 . Neural Networks. Data Mining and OLAP. Data Warehousing and Data Mining – Relation. Meaning and Working of Data Mining. Numerosity Reduction.Data Warehousing and OLAP Introduction. 97 .Introduction to Data Mining Introduction.Data Mining Unit 1 . Business Intelligence Infrastructure. Snowflakes. Inconsistent Data. Data Mining and knowledge Discovery. Unit 4 . Dimensionality Reduction. and Fact Constellation Schemas. Classification.Business Intelligence Introduction to Business Intelligence. Unit 5 . Data Warehouse Architecture: The Design of a Data Warehouse: A Business Analysis Framework. Data Mining Technologies.MC 0088 . Data Integration and Transformation: Data Integration. Unit 2 . Data Reduction: Data Cube Aggregation. Business Intelligence VS Data Warehouse. Introducing Concept Hierarchies. Discretization and Concept Hierarchy Generation: Segmentation by Natural Partitioning. Data Mining and Statistics.Data Mining Techniques – An Overview Introduction. Clustering. Data Warehouse: Operational Database Systems versus Data Warehouses. A Three – Tier Data Warehouse Architecture. OLAP Operations in the Multidimensional Data Model. Data Mining Software. Information and knowledge. Noisy Data. Data Mining Techniques: Association Rules. and Fact Constellations. Snowflake. Business Intelligence VS Data Mining. Data Mining Vs DBMS. Types of OLAP Servers: ROLAP versus MOLAP versus HOLAP. Regression.Data Preprocessing Introduction.

Mining Multidimensional Association Rules from Relational Database and Data Warehouses: Multidimensional Association Rules.Unit 6 . Extracting Classification Rules from Decision Trees. Text Mining. Applications of Web Mining.Multimedia and Text Mining Introduction. Checking for Redundant Multilevel Association Rules. Market Basket Analysis. Divisive Clustering. From Association Analysis to Correlation Analysis. Multimedia Data Mining. 98 . Mining Quantitative Association Rules. A Priori Algorithm. Agent Based and Data Base approaches. Evaluating Clusters. Unit 9 . Categories of Web Mining: Web Content Mining.Web Mining Introduction. Terminologies. Clustering Methods: K-means. Partition Algorithm. Comparing Classification Methods. Unit 7 . Classification by Decision Tree Induction: Decision Tree Induction. Hierarchical Clustering. Unit 8 . Issues Regarding Classification and Prediction: Preparing the Data for Classification and Prediction. Web Mining Software.Associations Rule Mining Introduction.Classification and Prediction Introduction. Mining Multilevel Association Rules from Transaction Databases: Multilevel Association Rules.Clustering Introduction. Dynamic Itemset Counting Algorithm. Fp – Tree Growth Algorithm. Agglomerative Clustering. Constraint – Based Association Mining. Tree Pruning. Clustering. Web Structure Mining. Clustering and Segmentation Software. Cluster Analysis. Association Rule Mining: A Road Map. Pincers – Search Algorithm. Methods to Discover Association Rules. Mining Multidimensional Association Rules Using Static Discretization of Quantitative Attributes. Unit 10 . Approaches to Mining Multilevel Association Rules. Web Usage Mining. Classification and Prediction. Association Rule.

Scientific Applications using Data Mining. Business Applications using Data Mining. 99 . New Applications.Case Study: Data Mining Techniques in Healthcare Industry.Unit 11 .Applications of Data Mining Introduction. Unit 12 .