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.Fall 2007 2. Data Warehousing and Data Mining 2.Edition: Fall 2007 2. 3 . Fundamentals of Digital finalized Image Processing 2. Internetworking with TCP/IP – do – 1.edu. Object Oriented Analysis & Design 2. Advanced Project Management and Quality Assurance – Edition: Fall 2007 MC0085 Advanced Operating Systems (Distributed systems) B0967 Advanced Operating Systems (Distributed systems) 04 01 04 02 04 02 MC0084 Software Project Management & Quality Assurance Sixth Semester MC0086 Digital Image Processing Yet to be 1. Advanced Object Oriented Analysis using UML 1. Software Project 2. TCP/ IP Protocol Suite 2. B0958 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. Digital Image Processing MC0087 Internetworking with TCP/IP – do – 1.in). Theory of Computer Science – Edition: Fall 2007 MC0083 Object Oriented Analysis & Design using UML B0969 1.

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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