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