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