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