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