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

Advanced Project Management and Quality Assurance – Edition: Fall 2007 MC0085 Advanced Operating Systems (Distributed systems) B0967 Advanced Operating Systems (Distributed systems) 04 01 04 02 04 02 MC0084 Software Project Management & Quality Assurance Sixth Semester MC0086 Digital Image Processing Yet to be 1.smude. Internetworking with TCP/IP – do – 1.Fall 2007 2.edu. Advanced Object Oriented Analysis using UML 1.Edition: Fall 2007 2. Theory of Computer Science – Edition: Fall 2007 MC0083 Object Oriented Analysis & Design using UML B0969 1. Fundamentals of Digital finalized Image Processing 2. B0958 1. B0959 Management and Quality Assurance . 3 . Object Oriented Analysis & Design 2. Data Warehousing and Data Mining 2. Digital Image Processing MC0087 Internetworking with TCP/IP – do – 1. Advanced Data Warehousing and Data Mining MC0089 Project 08 04 02 04 02 04 02 MC0088 Data Warehousing & Data Mining Detailed Curriculum is given on the web site (www. Software Project 2. TCP/ IP Protocol Suite 2.in).

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

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

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

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

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

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

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

Dynamic Memory Chips; Memory interleaving; Cache Memory:Principles of cache memory, Structure of cache and main memory, Performance using cache memory, Elements of Cache Design, Mapping functions, Replacement algorithms; External Memory: Magnetic Disk, RAID; Virtual memory; Memory Management in Operating Systems. Unit 7: Input/Output External Devices:Classification of external devices,Input/Output problems; Input/Output Module: I/O Module Function, I/O Module Decisions, Input Output Techniques, Programmed I/O: I/O commands, I/O instructions; Interrupt Driven I/O: Basic concepts of an Interrupt, Response of CPU to an Interrupt, Design Issues, Priorities, Interrupt handling, Types of Interrupts; Direct Memory Access: DMA Function and Operation, DMA Configurations;DMA Controller: DMA Transfer Types, DMA Transfer modes, DMA Controller Operation, Advantages; Synchronization Requirements for DMA and Interrupts: Synchronization with Interrupts, Synchronization with DMA.

Unit 8: Control Unit Micro operations: Micro operations of Fetch cycle, Indirect Cycle, The execute cycle, The Instruction cycle; Control of the CPU: Functional Requirements, Control Signals, Data paths and control signals; Data Path inside A CPU: Single bus structure, Two bus structure, Three bus structure, Execution of a complete instruction, Branching; Sequencing of Control Signals: Hardwired Control Unit, Micro-Programmed Control. Unit 9: Parallel Model of Computers and Pipelining Introduction: Lookahead, Parallelism and pipelining, Flynn‘s Classification; Parallel/Vector Computers: Development Layers, New Challenges; Pipelining: Principles of Linear Pipelining, Pipeline structure of CPU, Timings of pipelining, Effect of pipelining; Basic Performance Issues in Pipelining; The Major Hurdle of Pipelining: Structural Hazards,Data Hazards, Control Hazards.

11

Unit 10: Advanced Processor Technology Instruction set Architecture: RISC and CISC, Characteristics of CISC, Characteristics of RISC, RISC versus CISC, Instruction set complexity- RISC versus CISC; Vector processing requirements: Characteristics of vector processing, Multiple vector task dispatching; Super scalar processors: The emergence and spread of super scalar processors, Specific task of Super scalar processing; Super Scalar instruction issue: The design space, Issue policies, Instruction issue policies of scalar processors, Instruction issue policies of superscalar processors.

12

iii) Discrete Mathematics

(4 Credits)

MC0063

Book 1: Discrete Mathematics

Unit 1: Sets, Relations and Functions Sets; Relations; Functions; Intervals; Functions of real variables; Different functions.

Unit 2: Mathematical Induction Progressions; Principle of Mathematical Induction; Summation of series using n, n2 and n3.; Arithmetico – Geometric series (A.G.P); Summation of series by the Method of Differences and partial fractions. Unit 3: Combinatorics Principles of Counting; Generating Function; Partitions and Compositions; Orderings; Principle of Inclusion and Exclusion.

Unit 4: Recurrences and Integer Functions Recurrence Relation; Applications of Recurrences; Generating Function; Integer Functions.

Unit 5: Partially Ordered Sets and Lattices Relation Matrices; Partial Ordered Sets; Lattices; Duality; Modular and Distributive lattices. Unit 6: Semigroups, Monoids and Groups Semigroups; Monoids; Groups; Permutation Groups. Unit 7: Rings, Fields and Vector Spaces Rings and Integral domains; Fields; Vector Spaces.

Unit 8: Propositional Calculus and Logical Quantifiers Logical Inference; Propositions and Tautologies; Predicates; Logical Quantification of Propositions.

13

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Sign up to vote on this title
UsefulNot useful