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