DETAILED SYLLABUS FOR DISTANCE EDUCATION

MASTER IN COMPUTER APPLICATIONS

MCA

Course Name: MCA

Duration of Course: 3 Years Eligibility: Graduation Lateral Entry: Candidate who has Graduation + 1 year PG Diploma in Computer Application is eligible for 3rd Semester of MCA Candidate who has Graduation + 'A' Level from DOEACC/BCA/B.SC(IT/CS/CAM) OR B.E/B.Tech Any Stream is eligible for 3rd Semester of MCA Candidate who has M.Sc - CS/IT is eligible for 5th Semester of MCA General EXIT Policy : After 2 sems student will be awarded PGDCA and after 4 sems student will be awarded M.Sc. (CS)

ELECTIVE 1 1. Computer Design 2. Mobile Computing and Communication 3. Simulation and Modeling Elective 2 1. Pattern Recognition 2. Operations Research 3. Advanced Computer Architecture. ELECTIVE -3 1. Client Server Architecture 2. Artificial Intelligence 3. Network Management

FIRST SEMESTER

CODE
MCA11 MCA 12 MCA 13 MCA 14 MCA 15 MCA 16

SUBJECTS
Mathematics Data Structure Programming in Computer Financial Accounting C Programming Lab and Windows based Application Lab Data Structure Lab

CREDITS
4 4 4 4 1 1

Subject Name: Mathematics SYLLABUS

Module I Unit1 Complex Trigonometry

Subject Code: MCA11

Revision of Plane Trigonometry Trigonometric ratios, expressions for relation between allied angles and trigonometrical ratios. Addition formulae for trignometrical ratios and simple problems. Unit 2 Complex numbers and functions, definition, properties, De Moivres Theorem(without proof) , Roots of a Complex number, expansions of sin(n ), cos(n) in powers of sin and Cos , additional formulae for any number of angles, simple problems. Unit3 Matrix Theory Review of the fundamentals. Solution of linear equations by Cramers rule and by Matrix method. Unit4 Eigen values and Eigen vectors, Cayley Hamiltons theorem, Diagnolization of matrices and simple problems.

Module II Unit1 Differential Calculus Limits, continuity and differentiability (definition only), standard derivatives, rules for differentiation, derivatives of function of a function and parametric functions, problems. Unit2 Successive differentiation, nth derivative of standard functions, statement of Leibniz theorem, problems. Unit3 Polar forms, angle between the radius vector and the tangent to a polar curve, (no derivation) angle between, pedal equation, simple problems. Unit4 Indeterminate forms, LHospitals rule, partial derivatives, definition and simple proble ms

Module 3 Unit 1 Algebraic Structures Definition of a group, properties of groups, sub groups, permutation groups, simple problems Unit2 Scalars and Vectors, algebra of vectors, scalar & vector products, scalar triple product, simple problems Unit3 Integral Calculus Introduction, Standard Integrals, integration by substitution and by parts , integration of rational , irrational and trigonometric functions Unit 4 Definite integrals, Properties(no proof), simple problems, reduction formulae and simple problems. Module 4 Unit1 Differential equations of first order Introduction, solution by separation of variables, homogeneous equations, reducible to homogeneous linear equations, Unit2 Bernoullis equation, exact differential equations and simple problems. Unit 3 Partial Differentiation: Introduction, Partial derivatives, homogeneous function, and Eulers theorem, Total differentiation of composition and implicit functions Unit4, Total derivative and Chain rule; Jacobians: Introduction, definition, properties of jacobians. References
1. Higher Engineering Mathematics, Dr.B.S Grewal, 36 th Edition, Khanna Publications, 2001. 2. Elementary Engineering Mathematics, Dr. B.S. Grewal, 11 th Edition, Khanna Publications, 2002

Subject Name: DATA STRUCTURES

Subject Code: MCA12

Module 1:
Unit 1: Introduction to Data Structures Information and its meaning: Abstract Data Types, Sequences as Value Definitions, ADT for Varyinglength Character Strings, Data Types in C, Pointers in C, Data Structures and C. Arrays in C: the Array as an ADT, Using One-dimensional Arrays, Implementing One-dimensional Arrays, Arrays as Parameters, Character Strings in C, Character String Operations. Unit 2: Advanced Data Types Structures in C: Implementing Structures, Unions, Implementation of Unions, Structure Parameters, Representing other Data Structures, Rational Numbers, Allocation of Storage and Scope of Variables, Dynamic Memory Allocation and Cancellation in C Unit 3: The Stack Definition and examples, Primitive operations, Example, The stack as an ADT, Representing stacks in C, Implementing the pop operation, Testing for exceptional conditions, Implementing the push operation Unit 4: Infix, postfix and prefix expressions using stacks. Examples for infix, postfix, and prefix expressions, Basic definition and examples, Program to evaluate a postfix expression, Converting an expression from infix to postfix, Program to convert an expression from infix to postfix

Module 2:
Unit 1: Recursion Recursive definition and processes, Factorial function, Multiplication of natural numbers, Fibonacci sequence, Binary search, Properties of recursive definition or algorithm. Recursion in C, Factorial in C, Fibonacci numbers in C, Binary search in C, Towers of Hanoi problem. Unit 2: Queues and Lists The queue and its sequential representation, the queue as ADT, C implementation of queues, Insert operation, Priority queue, Array implementation of a priority queue. Unit 3: Linked Lists Linked lists, Inserting and removing nodes from a list, Linked implementation of stacks, getnode and freenode operations, Linked implementation of queues, Linked list as a data structure, Example of list operations, Header nodes, Lists in C, Array implementation of lists, Limitations of array implementation, allocating and freeing dynamic variables, Unit 4: Dynamic implementation of List, stack and Queues.

Linked lists using dynamic variables, Queues as lists in C, Examples of list operations in C, Non integer and non-homogeneous lists, Other list structures: Circular lists, Stack as a circular list, Queue as a circular list, Primitive operations on circular lists, doubly linked lists

Module 3
Unit 1: Trees Binary trees, operations on binary trees, Applications of binary trees, Binary tree representation, Unit 2: Representation of Trees Node representation of binary tree, Internal and external nodes, Implicit array representation of binary trees, Choosing a binary tree representation, Binary tree traversal in C, Threaded binary trees. Unit 3: Graphs Graphs: Definitions, Application of graphs, C representation of graphs, Unit 4: Traversal methods Traversal methods for graphs, Depth first traversal, Breadth first traversal

Module 4:
Unit 1: Sorting: Basic Sorting Techniques: Bubble Sort, Quick Sort, Selection Sort, Tree Sorting: Binary Tree Sort, Heap Sort, Unit 2: Sorting: Advanced sorting Techniques: Insertion Sorts: Simple Insertion, Shell Sort, Address Calculation Sort, Merge and Radix Sort Unit 3: Searching: Basics Basic Search Techniques: Algorithmic notation, Sequential searching, Searching an ordered table, Indexed sequential search, Binary search, Interpolation search, Unit 4: Searching: Advanced Tree searching: Inserting into a Binary Search Tree, Deleting from a Binary Search Tree, Hashing: Resolving hash clashes by open addressing, choosing a hash function.

References
1. Data Structures using C and C++ by Yedidyah Langsam and Moshe J. Augenstein and Aaron M Tenanbaum, 2nd Edition, Pearson Education Asia, 2002. 2. Data Structures and Algorithm Analysis in C, Mark Allen Weiss, 2 nd Edition, Pearson Education Asia, 1997.

3. Data Structures A Pseudocode Approach with C, Richard F Giberg and Behrouz A Forouzan, 3rd Reprint, Thomson Course Technology, 2005.

Subject Name: COMPUTER PROGRAMMING MCA13 MODULE 1 Unit 1: Algorithms and Flowchart

Subject

Code:

Algorithms, flowcharts, Divide and conquer strategy,Writing algorithms and flow charts for simple exercises Unit 2: Constants variables and data types Character set, C tokens, Keywords and identifiers, Constants, Variables, Data types, Declaration of variables Unit 3: Operators and Expressions Arithmetic operators, Relational operators, Logical operators, Assignment operators, Increment and decrement operators, Conditional operators, Bitwise operators, Special operators, Arithmetic Expression, Evaluation of expression, Precedence of Arithmetic operators, Type conversion in expressions, Operators precedence and associatively Unit 4: Managing input and output operations Reading a character, writing a character, formatted input, formatted output

MODULE 2 Unit 1: Decision making and branching Decision making with if statements, Simple if statements, The if else statements, Nesting of else statements, The else if ladder, The switch statement, The ?: operator, The goto statement Unit 2: Decision making and looping

The while statement, the do statement, the for statement, Jumps in loops Unit 3: Arrays One dimensional arrays, Declaration of one dimensional array, Initialization of one dimensional array; Two- Dimensional arrays, Declaration of two dimensional arrays, Initialization of two dimensional arrays; Example programs Unit 4: User Defined Functions Need for user-defined functions, A multi function program, Elements of user defined functions, Definition of functions, Return values and their types, Function calls, Function declaration

MODULE 3 Unit 1: Functions Category of functions, No arguments and no return values, Arguments but no return values, Argument with return values, No argument but returns a value, Function that return multiple values Unit 2: Pointers Understanding pointers, Accessing the address space of a variable, Declaring and initialization pointer variables, Accessing a variable through its pointers, Chain of pointers, Pointer expressions, Pointers and arrays, Pointer and character strings, Array of pointers, Pointer as function arguments, Functions returning pointers, Pointers to functions, Pointers and structures Programming examples Unit 3: Structures and Unions Defining a structure, declaring structure variables, accessing structure members, Structure initialization, copying and comparing structure variables, operations on individual members, array of structures ,structures within structures, structures and function, unions ,size of structures, bit fields, programming examples MODULE 4 Unit 1:

File management in C Defining and opening a file, Closing a file, Input/output operations on files, Error handling during I/O operations, Random access files, Command line arguments, Programming examples Unit 2: Dynamic memory allocation Dynamic memory allocation, allocating a block of memory: malloc, allocating multiple blocks of memory: calloc, releasing the used space: free, alerting the size of a block: realloc, programming examples Unit 3: The preprocessor Introduction, macro substitution ,file inclusion, compiler control directives, ANSI additions, Programming exercise

References: 1. Structured Programming Approach C, Behrouz A Forouzan and Richard F Gilberg, 2 nd Edition, Thomson, 2001. 2. Programming with ANSI and Turbo C, Ashok N Kamathane, Ist Edition, Pearson Education Asia 2002. 3. Beginning C: From Novice to Professional. Ivor Horton, 4th Edition, Springer, India, 2006.

Subject Name: FINANCIAL ACCOUNTING

Subject Code: MCA14

MODULE 1 UNIT-I Financial Statements Understanding Financial Statements- meaning-Usefulness-Trading Account Manufacturing Account-Profit and Loss A/c- Balance Sheet- Distinction between Fixed Assets and Current Assets-Tangible Assets and Intangible Assets- Distinction between Trading and Profit and Loss Account and a Balance Sheet-Distinction between a Trial Balance and a Balance Sheet (Simple problems)

UNIT-2 Methods of presenting the final accounts Understanding the methods of presenting the final accounts -Treatment of direct items and indirect items- Incomes and Expenses- Capital and Revenue items- Adjustments for Depreciation- Reserve for Bad and Doubtful Debts-Prepaid and outstanding expensesTreatment of adjustments appearing in the Trial Balance and treatment of adjustments appearing outside the trial Balance. UNIT-3 Consignment Accounts Understanding the concept of Consignment Accounts- distinguishing between consignment and sale- Terms used in consignment- Valuation of unsold stock Treatment of Normaland abnormal Loss- Accounting entries in the books of consignor and consignee.(Simple problems) UNIT-4 Proprietorship and Partnership Understanding the concept of Sole proprietorship and partnership- Meaning and nature of partnership- Partnership deed- Methods of maintaining the Capital Accounts of partnersCalculation and treatment of interest on capital- Interest on drawings and its treatmentInterest on partners loan to the firm- Calculation of commission payable to a partnerDivision of profit among partners. (Simple problems). MODULE-II UNIT-1 Accounting for Partnership firms- Admission of a Partner- Calculation of Capital RatioNew profit sharing ratio and Sacrificing Ratio- Treatment of Goodwill(Problems) UNIT-2 Revaluation of Assets and Liabilities- Adjustment for reserves and Accumulated Profit/LossAdjustment of Capital.(problems) UNIT-3 Accounting for Partnership firms- Retirement/Death of a partner- New profit sharing ratio and gaining ratio- Treatment of Goodwill- Revaluation of Assets and Liabilities (Problems) UNIT-4

Adjustment for reserves and Accumulated Profit/Loss- Adjustment of Capital-Death of a partner-Joint Life policy (Problems)

MODULE-III UNIT-1 Understanding Joint Stock Company Accounts- Accounting for Shares-Meaning ,nature and characteristics of a Company- Meaning and different types of shares- Methods of issue of shares-Minimum subscription-Under subscription and over subscription- Issue of shares at par-at premium and at a discount.(Simple Problems) UNIT-2 Understanding meaning and characteristics of Debentures Distinction between Share and Debenture- types of debentures- Issue of debentures at par- at a premium-at a discountRedemption of Debentures.(Simple problems) UNIT-3 Ratio Analysis- Meaning of Ratios-Types of Ratios- Liquidity Ratio-Solvency RatioActivity Ratio- Profitability ratio (Simple problems) UNIT-4 Meaning and objectives of Funds Flow Statement-uses of fund flow statement- Stages in preparation of Fund flow statement- Schedule of Changes in working capital- Calculation of Funds from operation- Preparation of Funds Flow Statement.(Simple Problems)

MODULE 4 UNIT-1: REDEMPTION OF PREFERENCE SHARES Meaning-legal provisions-treatment regarding premium on redemption-creation of Capital Redemption Reserve Account(CRR)-fresh issue of shares-arranging for cash balance for the purpose of redemption-minimum number of shares to be issued for redemption-issue of bonus shares-preparation of Balance Sheet after redemption.(Simple Problems) UNIT-2: VALUATION OF GOODWILL

Meaning-definition of goodwill-factors affecting goodwill-types of goodwill-purchased goodwill-Non-purchased or inherent goodwill-valuation of goodwill-Average Profit methodSuper profit method-capitalisation of Average profit method-Capitalisation of Super profit method-Annuity method. .(Simple Problems)

UNIT-3: VALUATION OF SHARES Meaning-need for valuation-factors affecting valuation-methods of valuation-Asset Backing or Intrinsic Value Method-Yield Valuation Method-Dividend Yield Fair value method-value of right shares-valuation of preference shares.(Simple Problems) UNIT-4: COMPANY FINAL ACCOUNTS Knowledge on requirements of Companies Act for presentation of Profit and Loss Account and Balance Sheet of a Company-treatment of special items relating to Company Final Accounts-Depreciation-Interest on Debentures-Tax-Dividends-interim-proposedunclaimed-interest out of capital-managerial remuneration(theory only)-Preparation of Profit and Loss Appropriation Account-Preparation of Balance Sheet as per the requirements of Companies Act. .(Simple Problems) References
1. Accounting for Management, Jawahar Lal, 4th Edition, Himalaya Publishing, 2006. 2. Financial Management, I.M. Pandey, 9th Edition, Vikas Publishing, 2005.

SECONDSEMESTER

CODE
MCA MCA MCA MCA 21 22 23 24
DBMS

SUBJECTS
Discrete Mathematics OOPS using C++ Computer Organization and Architecture DBMS Lab OOPS (C++) Lab

Credits 4 4 4 4 1 1

MCA 25 MCA 26

Subject Name: DISCRETE MATHS MODULE 1

Subject Code: MCA21

UNIT 1 Set theory:notations, representation of a set, different types of set, theorem on subsets and symmetric difference, venn diagram, set operation union, intersection, disjoint, difference, complement, symmetric difference, laws of sets: union, intersection, complement of sets, symmetric difference, DeMorgans laws, ordered pair C artesian product of sets. UNIT 2 Relations:domains ,range, inverse relation, inverse relation, binary relations, type of relations:reflexive relation, symmetric relation, antisymmetric relation, transitive relation, universal relation, identity relation,equivalence relation, equivalence class, partition of a set, composition of relation, Functions, domain and range, transformation, type of functions, difference between relation and functions, mathematical induction. UNIT 3 Propositional logic

introduction, proposition, elements of propositional logic, truth table, connectives, negation, conjunction, disjunction, conditional, biconditional, converse and contra positive, converse, contrapositive, types of proposition, tautology, contradiction, contingency, list of properties, proof of properties. UNIT 4 Predicate quantification, forming propositions from predicates, universal quantifier and connective and, existential, existential quantifier and connective, how to read quantified formulas, order of application of quantifier, well-formed formula for first order predicate logic, rules for constructing wffs, from wff to proposition, transcribing English to predicate logic WFFS. MODULE 2 UNIT 1 Counting the basics of counting, basic counting principles, sum and product rules, inclusion and exclusion principle. UNIT 2 Permutations notations of permutations, restricted permutations, permutations of repeated things, circular permutations UNIT 3 Combination Number of Combinations of N Dissimilar Things taken R at a time, Theorem on restricted combinations. UNIT 4 Logic circuit flow table, or operation, and operation, not operation, nor operation, nand operation, logic circuits algebraically, evaluating logic circuit outputs. MODULE 3 UNIT 1 Boolean algebra definition, laws of Boolean algebra, duality principle. UNIT 2

Graph Theory graph, edges and vertices, adjacent vertices, incident,degree of a vertex in a graph, paths and cycles in a graph, graphical representation, basic graph theory concepts UNIT 3 Types of graph type of graph, simple graph, regular graph, multigraph, complete graph, bipartite graphs, discrete graph, sub graph, spanning sub graph, Complete graph, connected graphs, disconnected graphs and components, planar graph, euler graph, directed graph, labeled and weighted graphs, UNIT 4 trees Binary tree, rooted tree, ordered rooted tree, Hamiltonian:- paths and circuit, graphs and circuit, isomorphism ,connectivity Module 4 UNIT 1 Groups: Definitions, Examples, and Elementary properties, Homomorphism, Isomorphism, and Cyclic groups, cosets, and Lagranges Theorem UNIT 2 Coding theory and Rings Elements of coding theory, The Hamming Metric, The parity Check, and generator matrices UNIT 3 Group Codes Decoding with coset Leaders, Hamming Matrices UNIT 4 Ring and Modular Arithmetic The Ring Structure- Definition and Examples, Ring properties and substructures, The Integers Modulo References

1. Discrete Mathematics and Computer Science, Gary Haggard, John Schlipf, Sue Whitesides, 1st Indian Edition, Thomson, 2007. 2. Discrete and Combinatorial Mathematics and Applied Introduction, Ralph P. Grimaldi, 4th Edition, Pearson Education, 2003.

Subject Name: DATABASE MANAGEMENT SYSTEM Subject Code: MCA-22 Semester: MCA 2 SYLLABUS MODULE 1 Unit 1: Databases and Database Users Introduction, An example, Characteristics of Database Approach, Actors on the screen, Workers behind the scene, Advantages of using DBMS approach, A brief history of database applications, Why not to use a DBMS Unit 2: Database System Concepts and Architecture Data models, Schemas and Instances, Three-schema architecture and data independence, Database languages and interfaces, The database system environment, centralized and clientserver architectures, classifications of Database management systems Unit 3: Data Modeling Using the Entity-Relationship Model Using high-level conceptual data models for database design, An example database application, Entity types, Entity sets, Attributes and keys, Relationship types, Relationship sets, Roles and structural constraints, Weak entity types, Refining the ER design, ER diagrams, Naming conventions and design issues,Relationship types of degree higher than two Unit 4: File Organization for DBMS

Introduction, Objectives, File organization, Sequential file organization: Index-sequential file organization,Types of indexes ;B-trees: Advantages of b-tree indexes ;Direct file organization ,Need for the multiple access path

MODULE 2 Unit 1: Relational model Relational model concepts, Relational model constraints and Relational database schemas, update operations, Transactions and dealing with constraint violations Unit 2: Relational Algebra Unary relational operations: SELECT, PROJECT; Relational Algebra Operations from Set Theory, Binary Relational Operations: JOIN, DIVISION; Additional Relational Operations, Examples of Queries in Relational Algebra, Relational Database Design using ER-toRelational mapping Unit 3: SQL- The Relational Database Standard SQL Data Definition and Data Types, Specifying basic constraints in SQL, Schema change statements in SQL, Basic queries in SQL, More complex SQL Queries Unit- 4 SQL- Structured Query Language Insert, Delete and update statements in SQL, Specifying constraints as Assertion and trigger, Views (virtual tables) in SQL, Additional features of SQL, Database programming issues and techniques, Embedded SQL , Dynamic SQL, Database stored procedures and SQL / PSM

MODULE 3 Unit 1: Functional Dependencies and normalization for relation database approach

Informal Design guidelines for relation schemas, Functional dependencies, Normal forms based on primary keys, General definitions of second and third forms, Boyce-Codd normal forms Unit 2: Relational Database Design Algorithms Properties of relational decompositions, Algorithms for relational database schema design, Multivalued Dependencies and fourth normal form, Join dependencies and fifth normal form Unit 3: Further Dependencies Inclusion dependencies, Other dependencies and normal forms Unit 4: Database Security Introduction to Database security, Access control, Discretionary Access control mandatory Access control MODULE- 4 Unit 1: Transaction processing concepts The ACID properties, Transactions and schedules, Concurrent execution of transactions, Lock based concurrency control, Performance of locking, Transaction support in SQL Unit 2: Concurrency control techniques Introduction to crash recovery, 2PL, Serializability and recoverability, Lock management

Unit 3: Database Recovery Techniques Introduction to ARIES, The log, other recovery- related structures, The write-ahead log protocol, Check pointing, Recovering from a system crash, Media recovery, Other approaches and integration with concurrency control

Unit 4: Distributed Databases and Client-Server Architecture Distributed Database Concepts; Data Fragmentation, Replication, and Allocation Techniques for Distributed Database Design; Types of Distributed Database Systems, Query Processing in Distributed Databases, Overview of Concurrency Control and Recovery in Distributed Databases, An Overview of Client-Server Architecture and Its Relationship to Distributed Databases, Distributed Databases in Oracle, Future Prospects of Client-Server Technology Reference Books 1. Raghu Ramakrishnan and Johannes Gehrke: Database Management Systems (Third Edition), McGraw-Hill-2003 2. Elmasri and Navathe: Fundamentals of Database Systems (Fourth Edition), Pearson Education, 2003. 3. Silberschatz, Korth and Sudharshan: Database System Concepts, Fourth Edition, Mc-GrawHill, 2002

Subject Name: Object Oriented Programming with C++ Subject Code: MCA-23 Semester: MCA 2 SYLLABUS Module 1 Unit 1: An Overview of C The Origins of C, C Is a Middle-Level Language, C Is a Structured Language, C Is a Programmer's Language, The Form of a C Program, The Library and Linking, Separate Compilation, Understanding the .C and .CPP File Extensions Unit 2: Arrays and Null-Terminated Strings Single-Dimension Arrays, Generating a Pointer to an Array, Passing Single-Dimension Arrays to Functions, Null-Terminated Strings, Two-Dimensional Arrays, Arrays of Strings,

Multidimensional Arrays, Initializations Unit 3: Pointers and Functions

Indexing Pointers,

Array Initialization,

Unsized

Array

What Are Pointers?, Pointer Variables, The Pointer Operators, Pointer Expressions, Pointer Assignments, Pointer Arithmetic, Pointer Comparisons, Pointers and Arrays, Arrays of Pointers, Multiple Indirection, Initializing Pointers, Pointers to Functions, C's Dynamic Allocation Functions, Problems with Pointers, Functions, The General Form of a Function, Scope Rules of Functions, Function Arguments, Call by Value, Call by Reference, Creating a Call by Reference, Calling Functions with Arrays, argc and argvArguments to main( ), The return Statement, Returning from a Function, Returning Values, Returning Pointers, Functions of Type void, What Does main( ) Return?, Recursion, Function Prototypes, Standard Library Function Prototypes, Declaring Variable-Length Parameter Lists, Old-Style Versus Modern Function Parameter Declarations, Implementation Issues, Parameters and General-Purpose Functions Unit 4: Structures, Unions, Enumerations, and User-Defined Types Structures, Accessing Structure Members, Structure Assignments, Arrays of Structures, Passing Structures to Functions, Passing Structure Members to Functions, Passing Entire Structures to Functions, Structure Pointers, Declaring a Structure Pointer, Using Structure Pointers, Arrays and Structures Within Structures, Bit-Fields, Unions, Enumerations, Using sizeof to Ensure Portability, typedef Module 2 Unit 5: An Overview of C++ Introduction, What Is Object-Oriented Programming?, Some C++ Fundamentals, Introducing C++ Classes, Function Overloading, Operator Overloading, Inheritance, Constructors and Destructors Unit 6 Classes and Objects Introduction to Classes, Structures and Classes Are Related, Friend Functions, Friend Classes, Inline Functions, Parameterized Constructors, Static Class Members, When Constructors and Destructors Are Executed, The Scope Resolution Operator, Nested Classes, Local Classes, Passing Objects to Functions, Returning Objects, Object Assignment

Unit 7: Arrays, Pointers, References and the Dynamic Allocation Operators Introduction to Arrays of Objects, Pointers to Objects, Type Checking C++ Pointers, The this Pointer, Pointers to Derived Types, Pointers to Class Members, References, Passing references to objects, Returning references, Independent references, References to derived types, C++'s Dynamic Allocation Operators Unit 8 Function Overloading, Copy Constructors and Default Arguments Function Overloading, Overloading Constructor Functions, Finding the Address of an Overloaded Function, Default Function Arguments, Function Overloading and Ambiguity Module 3 Unit 9 Operator Overloading Creating a Member Operator Function: Creating Prefix and Postfix Forms of the Increment and Decrement Operators, Operator Overloading Using a Friend Function, Overloading new and delete, Overloading Some Special Operators, Overloading the Comma Operator Unit 10: Inheritance Base-Class Access Control, Inheritance and protected Members, Protected Base-Class Inheritance, Inheriting Multiple Base Classes, Constructors, Destructors, and Inheritance, Granting Access, Virtual Base Classes Unit 11 Virtual Functions and Dynamic Polymorphism Virtual Functions, Calling a Virtual Function through a Base Class Reference, The Virtual Attribute Is Inherited, Virtual Functions Are Hierarchical, Pure Virtual Functions, Using Virtual Functions, Early vs. Late Binding Unit 12 Templates

Generic Functions, Explicitly Overloading a Generic Function, Applying Generic Functions, Generic Classes, Applying Template Classes: A Generic Array Class, The typename and export Keywords, The Power of Templates

Module 4 Unit 13 Exception Handling Exception Handling, Catching Class Types, Using Multiple catch Statements, Handling Derived-Class Exceptions, Exception Handling Options, Understanding terminate( ) and unexpected( ), Applying Exception Handling Unit 14 The C++ I/O System Basics Introduction, The C++ Stream Classes, C++'s Predefined Streams, Formatted I/O, Using Manipulators to Format I/O, Overloading << and >>, Creating Your Own Manipulator Functions Unit 15 C++ File I/O <fstream> and the File Classes, Opening and Closing a File, Reading and Writing Text Files, Unformatted and Binary I/O, getline( ), Detecting EOF, The ignore( ) Function, Random Access, I/O Status, Customized I/O and Files Unit 16 Run-Time Type ID and the Casting Operators Run-Time Type Identification (RTTI), A Simple Application of Run-Time Type ID, typeid Can Be Applied to Template Classes, The Casting Operators, dynamic_cast, Replacing typeid with dynamic_cast, Using dynamic_cast with Template Classes, const_cast, static_cast, reinterpret_cast Reference Books: 1. Object Oriented Programming in Turbo C++ by Robert Lafore (Galgotia) 2. The Complete Reference C++ by Herbert Schildt - fourth edition 3. Object Oriented Programming with C++ by E. Balagurusamy 4. Let Us C ++ by Yashwant Kanitkar

Subject Name: COMPUTER ORGANIZATION AND ARCHITECTURE Subject Code: MCA-24 Semester: MCA 2 SYLLABUS MODULE 1 UNIT 1Number Systems Counting in Decimal and Binary, Place Value, Binary to Decimal Conversion, Decimal to Binary Conversion, Hexadecimal Numbers, Octal Numbers, Bits, Bytes, Nibbles, and Word Size, UNIT 2 Logic Gates The AND Gate, The OR gate, The inverter and Buffer, The NAND gate, the NOR Gate, The exclusive OR gate, The Exclusive NOR Gates, The NAND Gate as an universal Gate, Gates with More than two inputs, Using Inverters to convert gates. UNIT 3 Combining Logic Gates Constructing Circuits from Boolean Expression, Drawing a circuit from a Maxterm Boolean Expression, Truth Tables and Boolean Expressions, Sample Problem Simplifying BooleanExpression, Karnaugh Maps, Karnaugh Maps with three variables, Karnaugh Maps with four variables, more Karnaugh Maps, using Demorgans Theorem, UNIT 4 Arithmetic Circuits Binary Addition, Half Adders, Full Adders, Three Bit Adders, Binary Subtraction, Parallel Subtractors, IC Adders, Binary Multiplication, Binary Multipliers, 2s Complement Notation, Addition and Subtraction, 2s Complement adders/subtractor

MODULE 2
UNIT-1 Basic Structure of computer Computer Types, Functional Units, Basic Operational Concepts, Bus structures, Performance, Memory Location and Addresses

UNIT 2 Machine Instruction and Programmes Memory Operations, Instructions & Instruction Sequencing, Addressing Modes, Assemble Language, Basic Input/Output Operation, Accessing I/O Devices, Interrupts, Direct Memory Accesses, Buses 240, Interface Circuits UNIT 3 Arithmetic Unit Addition & subtraction of Signed Numbers, Design of Fast adders, Multiplication of Positive Numbers, Signed-Operand Multiplication, Fast Multiplication, Integer division, FloatingPoint Numbers & Operations. UNIT 4 Fundamentals of Computer Design. Introduction; Classes computers; Defining computer architecture; Trends in Technology; Trends in power in Integrated Circuits; Trends in cost; Dependability, Measuring, reporting and summarizing Performance; Quantitative Principles of computer design; Performance and Price-Performance; Fallacies and pitfalls.

MODULE 3
UNIT 1 Pipelining: Basic and Intermediate concepts Introduction; Pipeline hazards; How is pipelining implemented? What makes pipelining hard to implement? UNIT 2 Instruction Level Parallelism Concepts and challenges; Basic Compiler Techniques for exposing ILP; Reducing Branch costs with prediction; Overcoming Data hazards with Dynamic scheduling; Dynami scheduling: Examples and Algorithms; Hardware-based Speculation; Unit 3 Exploitation on ILP Exploiting ILP using multiple issue and Static scheduling; Exploiting ILP using Multiple issue and Dynamic Scheduling; Advanced Techniques for instruction delivery and Speculation; Fallacies and pitfalls.

UNIT 4 Limits in ILP Introduction; Studies of the limitations of ILP; Limitations on ILP for realizable processors; Cross-Cutting issues: Hardware versus software speculation; Using ILP to exploit threadlevel parallelism.

MODULE 4
UNIT 1 Multiprocessors and Thread Level Parallelism Introduction; Symmetric Shared-Memory Architectures; Performance of Symmetric SharedMemory Multiprocessors; Distributed Shared Memory and Directory-based Coherence; Synchronization: The Basics; Models of Memory Consistency. UNIT 2 Memory Systems Some Basics concepts, Semiconductors RAM Memories, Read-Only Memories, Cache Memories, Virtual Memories UNIT 3 Memory Hierarchy Review: Introduction; Cache performance; Cache Optimizations. Memory Hierarchy design: Introduction; Advanced optimizations of Cache performance; Memory technology and optimizations. UNIT 4 Data Flow Architecture Data Flow and Hybrid architecture; Case study: VLIW architecture, Superscalar and RISC architecture.

Text Books:
Computer Organization 1. Digital Electronics Principles and Applications , Tokheim, 6th Edition, McGraw Hill, 2004. Chapters: 2.1 to 2.4, 2.6 to 2.8, 3.1 to 3.10, 4.1 to 4.9, 4.16, 10.1 to 10.11. 2. Computer Organization, Carl Hamacher, Z Varnesic and S Zaky, 5th Edition, McGraw Hill, 2002. Chapters: 1.1 to 1.4, 1.6, 2.2 to 2.7, 4.1, 4.2, 4.4 to 4.6, 5.1 to 5.5, 5.7, 6.1 to 6.7.

Computer Architecture 1. Hennessey and Patterson: Computer Architecture A Quantitative Approach, 4th Edition, Elsevier, 2007. 2. Kai Hwang: Advanced Computer Architecture Parallelism, Scalability, Programmability, Tata McGraw-Hill, 2003.

Reference Books: Computer Organization

1. 2. Digital Logic and Computer Design, Morris Mano, Pearson Education Asia, 2002. Logic and Computer Design Fundamentals , Morris Mano, and Charles R Kime, 2nd Edition, Pearson Education Asia, 2001.

THIRD SEMESTER
CODE
MCA 31 MCA 32 MCA 33 MCA 34 MCA 35 MCA 36

SUBJECTS
Data Communication Advance Computer Graphics Advance Operating System Unix and Shell Programming Unix Lab Operating System Lab

CREDIT S
4 4 4 4 1 1

Subject Name: Data communication

Subject Code: MCA-31

Module 1 Unit 1

A Communication Model; Data Communications; Data Communication Networking: Wide Area Networks, Local Area Networks; Protocols and Protocol Architecture: A Three Layer Model, The TCP/IP Protocol Architecture, OSI Models. Unit 2: Protocols: Characteristics, Functions; OSI: The Model, Standardization within the OSI Framework, Service Primitives and Parameters, The OSI Layers; TCP/IP Protocol Suite: The TCP/IP Approach, TCP/IP Protocol Architecture, Operation of TCP and IP, The Applications. Unit 3 Data Transmission: Concepts and terminology, Frequency, Spectrum, and Bandwidth; Analog and Digital data transmission: Data, Signal, Transmission; Transmission impairments: Attenuation, Delay Distortion, Noise, Channel Capacity. Unit 4 Transmission media: Guided Transmission media: Twisted Pair, Coaxial Cable, Optical Fiber; Wireless Transmission: Terrestrial Microwave, Satellite Microwave, Broadcast Radio and Infrared. Module 2 Unit 1 Data Encoding: Digital Data Digital Signals: Nonreturn to Zero (NRZ), Multilevel Binary, Biphase, Modulation Rate, Scrambling Techniques; Digital Data Analog Signals: Encoding Techniques. Unit 2 Analog Data Digital Signals: Pulse Code Modulation, Delta Modulation; Asynchronous & Synchronous Transmission; Line Configurations: Topology, Full Duplex and Half Duplex.

Unit 3 Flow Control: Stop and Wait & Sliding Window Flow Controls; Error Detection: Parity Check, CRC. Unit 4 Error Control: Stop and Wait ARQ, GO Back-N ARQ, Selective Reject ARQ, and High Level Data Link Control (HDLC). Module 3

Unit 1 Frequency Division Multiplexing: Characteristics, Analog Carrier Systems; Synchronous Time Division Multiplexing: Characteristics, Time Division Multiplexing Link Control. Unit 2 Digital Carrier Systems, ISDN User Network Interface, SONET/SDH; Wavelength Division Multiplexing, Statistical Time Division Multiplexing: Characteristics; Asymmetric Digital Subscriber Line. Unit 3 Switching Networks: Circuit Switching Networks, Circuit Switching Concepts: Space Division and Time Division Switching. Unit 4 Packet Switching Principles: Switching Techniques, Packet Size, Comparison of Circuit Switching and Packet Switching, External and Internal Operation.

Module 4 Unit 1 Multiple Access Communications; Local Area Networks: LAN Structure, The Medium Access Control Sublayer. Unit 2 The Logical Control Layer; Random Access: ALOHA, Slotted ALOHA, CSMA and CSMA/CD. Unit 3 LAN Standards: Ethernet and IEEE 802.3 LAN Standard; Token Ring and IEEE 802.5 LAN Standard. Unit 4 ATM and Frame Relay: ATM Logical Connections, ATM Cells; Transmission of ATM Cells; ATM Service Categories; ATM Adaptation Layer, Frame Relay. References 1. William Stallings, Data and Computer Communication, 5 th Edition, Pearson Education/Prentice Hall India. 2. William A. Shay, Understanding Data Communications and Networks, 2 nd Edition, Thomson.

3. Godbole, Data Communications and Networks, Tata McGraw-Hill 2002.

Subject Name: ADVANCED COMPUTER GRAPHICS

Subject Code: MCA32

MODULE 1
UNIT 1 Introduction: Usage of Graphics and their applications, Presentation Graphics-Computer Aided DesignComputer Art- Entertainment- Education and Training-Visualization- Image ProcessingGraphical User Interfaces UNIT 2 A graphics system; Images: Physical and synthetic; The human visual system; The pinhole camera; The synthetic camera model; The programmers interface; Graphics architectures. Graphics Programming: The Sierpinski gasket. UNIT 3 Development of hardware and software for computer graphics, conceptual framework for interactive graphics. Graphics Hardware: raster-scan display systems, Input Devices. Raster Graphics: scan converting lines, scan converting circles, scan converting ellipses. Clipping: Sutherland-Cohen algorithm, Cyrus-Back algorithm. UNIT 4 The OpenGL API; Primitives and attributes; Color; Viewing; Control functions; The Gasket program; Polygons and recursion; the three-dimensional gasket.

MODULE 2 UNIT-1 Output primitives: Points and lines, line drawing algorithms , mid-point circle and ellipse algorithms. Filled area primitives: Scan line polygon fill algorithm, boundaryfill and floodfill algorithms UNIT 2

Interaction; Input devices; Clients and servers; Display lists; Programming eventdriven input; Menus; Picking; A simple paint program; Animating interactive programs; Design of interactive programs UNIT-3 2-D geometrical transforms: Translation, scaling, rotation, reflection and shear transformations, matrix representations and homogeneous coordinates, composite transforms, transformations between coordinate systems UNIT-4 2-D viewing: The viewing pipeline, viewing coordinate reference frame, window to viewport coordinate transformation, viewing functions, Cohen-Sutherland and Cyrus-beck line clipping algorithms, Sutherland Hodgeman polygon clipping algorithm

MODULE 3 UNIT-1 3-D object representation: Polygon surfaces, quadric surfaces, spline representation, Hermite curve, Bezier curve and B-Spline curves, Bezier and B-Spline surfaces. Basic illumination models, polygon-rendering methods. UNIT-2 3-D Geometric transformations: Translation, rotation, scaling, reflection and shear transformations, composite transformations. 3-D viewing: Viewing pipeline, viewing coordinates, view volume and general projection transforms and clipping

UNIT-3 Visible surface detection methods: Classification, back-face detection, depthbuffer, scanline, depth sorting, BSP-tree methods, area sub-division and octree methods UNIT-4 Shading : Shading, Illumination Model for diffused Reflection, Effect of ambient lighting, distances, Specular Reflection Model, Computing Reflection Vector, Curved Surfaces, Polygonal Approximations, Gourard Shading, Phong Model,

MODULE 4

UNIT -1 Hidden Surface Removal, Floating Horizon Method, Back Face Detection, Depth Buffer (ZBuffer, A-Buffer) Method, Scan Line Method, Depth Sorting Method, BSP-Tree Method, Area Subdivision Method. UNIT -2 Projection Parallel Projection, Oblique Projection on xy plane, Isometric Projection, Perspective Projection, One Vanishing Point (V.P.) projection from a point on z axis, Generation of 2 V.P. Projection, Isometric Projection, Perspective, Projection, one vanishing Pint (VP), projection from 0 point on z axis, Generation of 2 VP Projector & Projections, UNIT-3 Solid Modelling, Sweeping a polygon or a surface patch along a path to form solids, Boundary Representation (B-Rep), octrees, CSG Constructive Solid Geometry UNIT-4 Computer animation: Design of animation sequence, general computer animation functions, raster animation, computer animation languages, key frame systems, motion specifications

BOOKS FOR REFERENCES TEXTBOOKS: 1. Foley et. al., Computer Graphics Principles & practice, Addison Wesley, 1999. 2. David F. Rogers, Procedural Elements for Computer Graphics, McGraw Hill Book Company, 1985. REFERENCES: 1. D. Rogers and J. Adams, Mathematical Elements for Computer Graphics, MacGraw-Hill International Edition, 1989. 2. D. Hearn and P. Baker, Computer Graphics, Prentice Hall, 1986. 3. R. Plastock and G. Kalley, Theory and Problems of Computer Graphics, Schaums Series, McGraw Hill, 1986.

Subject Name: Advanced Operating System

Subject Code: MCA33

Module 1

Unit 1: What operating systems do; Computer System organization; Computer System architecture; Operating System structure; Operating System operations; Process management; Memory management; Storage management; Protection and security; Distributed system; Specialpurpose systems; Computing environments.

Unit 2 Operating System Services; User - Operating System interface; System calls; Types of system calls; System programs; Operating System design and implementation; Operating System structure; Virtual machines; Operating System generation; System boot. Unit 3 Process concept; Process scheduling; Operations on processes; Inter-process communication. Multi-Threaded Programming: Overview; Multithreading models; Thread Libraries; threading issues. Unit 4 Process Scheduling: Basic concepts; Scheduling criteria; Scheduling algorithms; MultipleProcessor scheduling; Thread scheduling.

Module 2 Unit 1 Synchronization: The Critical sectio n problem; Petersons solution; Synchronization hardware; Unit 2 Semaphores; Classical problems of synchronization; Monitors. Unit 3 Deadlocks: System model; Deadlock characterization; Methods for handling deadlocks; Deadlock prevention; Unit 4 Deadlock avoidance; Deadlock detection and recovery from deadlock.

Module 3 Unit 1 Memory Management Strategies: Background; Swapping; Contiguous memory allocation; Paging; Structure of page table; Segmentation. Unit 2: Virtual Memory Management: Background; Demand paging; Copy-on-write; Page replacement; Allocation of frames; Thrashing. Unit 3 File System: File concept; Access methods; Directory structure; File system mounting; File sharing; Protection. Unit 4 Implementing File System: File system structure; File system implementation; Directory implementation; Allocation methods; Free space management.

Module 4 Unit 1 Mass storage structures; Disk structure; Disk attachment; Disk scheduling; Disk management; Swap space management. Unit 2 Protection: Goals of protection, Principles of protection, Domain of protection, Access matrix, Implementation of access matrix, Access control, Revocation of access rights, Capability-Based systems. Unit 3 Linux history; Design principles; Kernel modules; Process management; Scheduling; Unit 4 Memory management; File systems, Input and output; Inter-process communication.

References 1. Operating system concepts and design by Milan Milankovic II edition McGrawhill 1992. 2. Operating systems by Harvgy M Deital Addison Wesley 1990 3. Operating systems A concept based Approach, D.M Dhamdhere Tata Mcgrawhill 2002.

Subject Name: UNIX and Shell Programming

Subject Code: MCA-34

MODULE 1 UNIT-1 BACKGROUND of UNIX Introduction, Brief history, Salient features of a UNIX System, POSIX and the Single UNIX Specification, The UNIX Architecture UNIT-2 Understanding the UNIX COMMAND Introduction, Locating Commands, Internal and External Commands, Flexibility of Command Usage, man: Browsing and Manual Pages On-line, Understanding the man Documentation UNIT-3 SOME BASIC COMMANDS Introduction, Cal: The Calendar, date: Displaying and Systems Date, echo: Displaying a Message, print f: An Alternative to echo, bc: The Calculator, script: Recording Your Session, password: Changing your password, who: Who are the Users?, unnamed: Knowing Your Machines Characteristics, tty: Knowing Your Terminal, sty : Displaying and Setting Terminal Characteristics UNIT-4 THE FILE SYSTEM Introduction, The File, Whats in a (File ) name? , The Parent Child Relationship, The HOME Variable: The Home Directory, pwd: Checking Your Current Directory, cd: Changing the Current Directory, mkdir: Making Directories, rmdir:Removing Directories, Absolute pathnames, Relative Pathnames, ls: Listing Directory Contents, The UNIX File System.

Module 2 UNIT-1 SOME FILE HANDLING COMMANDS Introduction, Cat: Displaying and Creating Files, cp: Copying a File, rm: Deleting Files, mv: Renaming files, more : Paging Output, The lp Subsystem: Printing a File, file : Knowing the File Types ,we: Counting Lines, Words and Characters, od: displaying Data in Octal, The spell and ispell, cmp: Comparing Two Files, comm.: What is Common?, diff: Converting One File to other, dos 2unix and unix2dos: Converting Between DOS and UNIX, Compressing Files, gzip, gunzip, Zip and unzip commands. UNIT-2 FILE ATTRIBUTES Introduction, ls - l : Listing File Attributes, ls d :Listing Directory Attributes, ls i: Listing inode number, ls a: Listing hidden file, time associated with a file and listing timestamps. File Ownership and File Permissions, chmod: Changing File Permissions, Directory Permissions, Changing File Ownership File Systems and Inodes, Hard Links, Symbol Links and In, The Directory, umask: Default File and Directory Permissions, Modification and Access Times, find : Locating Files UNIT-3 THE vi EDITOR Introduction, Vi Basics, input Mode-Entering and Replacing Text, Saving Text and Quitting The ex Mode, Navigation Editing Text, Undoing Last Editing Instructions (u and U),Repeating the Last Command (.), Searcing for a Pattern (/ and ? ), Substitution Search and Replace (:s), Customizing vi. UNIT-4 THE SHELL Introduction, The Shells Interpretive cycle,Pattern Matching - The Wild-cards, escaping and quoting, Redirection: The Three Standards Files, /dev/ null and / dev/tty: Two Special Files, Pipes, tee: Creating a Tee, Command Substitution, Shell Variables Module 3 UNIT-1 THE PROCESS

Introduction, Process Basics, ps: Process Status, System Processes (-e or a ) , Mechanism of Process Creation, Internal and External Commands, Running Jobs in Background, nice: Job Execution With Low Priority, kill: Killing Processes with Signals, Job control: fg and bg commands, at and batch: execute Later, cron: running Jobs Periodically, time: Timing Process UNIT-2 Communication In Unix Introduction, Finger: Details of Users, mesg: Your Willingness to Communicate, write: Communicating alternately, talk: Online Communication, wall: writing on all terminals ,news: knowing the local events, Email Basics, The mail command. UNIT-3 SIMPLE FILTERS AND grep FAMILY OF COMMANDS Introduction, The Sample Database, pr: paginating Files ,head: Displaying the Beginning of a File, tail: Displaying the end of a File, cut: Slitting a File Vertically, paste: Pasting Files, sort: Ordering a File ,uniq: Locate Repeated and Non repeated Lines, tr: Translating Characters, An Example : Displaying a Wordcount List, Grep: Searching for a Pattern, Basics Regular Expressions (BRE) An Introducton, Extended Regular Expressions (ERE) and egrep UNIT-4 SHELL PROGRAMMING Introduction, Environment Variables, Aliases (bash and ksh), Command History (bash and ksh ). Shell Scripts, read and readonly commands, Using Command Line Arguments, exit and Exit Status of Command,The Logical Operartors && and ||, Conditional Execution, The if Conditional, Using test and [ ] to Evaluate Expressions, The case Conditional, expr: Computation and String Handling, $0: Calling a Script by Different names, while : Looping, for : Looping with a List, set and shift: Manipulating the Positional Parameters, The here Document (<<), Trap: Interrupting a Program, Debugging Shell Scripts with set x, export: Exporting Shell Variables, eval: Evaluating Twice, The exec Statement, Development of simple shell scripts to demonstrate the integer and real arithmetic operations, Handling of positional parameters, The use of branching and looping constructs in the shell, Handling of signals using the trap etc. Module 4 UNIT-1 awk

Introduction, awk program line and script structure, awks operational mechanism , Records and fields, special variables $0, $1, $2, etc, patterns, The BEGIN and END, Variables, built in variables, built in functions- length, split, getline, print, printf, sprintf, index, system, substr etc, contol structures, operators in awk, associative arrays, writing simple awk scripts, Running awk scripts from the shell.

UNIT-2 perl Introduction, perl Preliminaries, The structure of a perl script, running a perl script, perl data and operators, The chop and chomp functions: Removing the Last Character, Variables and Operators, The String Handling Functions, Specifying Filenames in Command Line, Current Line Number ($) and the Range Operator (..),Lists and Arrays, foreach;Looping through a List, split: Splitting into a List or Array ,Join: Joining a List, dec2bin.pl : Converting a Dcimal Number to Binary, grep: Searching an Array for a Pattern, Associative Arrays (Hashes), Regular Experssions and Substitution, The match and substitute operation, File Handling, File Tests, Subroutines

UNIT-3 Introduction To System Administration Introduction , Root: The System Administrators Login, the su command, The Administrators Privileges, Maintaining Security , / etc/ passwd and / etc/ shado w files ,The crypt command , User Management, Start up and Shutdown, Managing Disk Space, Device Files, Handling Floppy Diskettes, cpio: A Backup Program, tar: The Tape Archive Program, Partions, System Startup and init, Shutdown and the sync Operation. Reference Books 1. Sumitabha Das, Unix Concepts and Applications, 3 rd Edition, Tata McGraw Hill, 2003. 2. Behrouz A. Forouzan and Richard F. Gilberg, Unix and Shell Programming A Text Book, Thomson, Edition-2003 3. Kenneth Rosen, Douglas Host, James Farber and Richard Rosinki, The Complete Reference Unix, Tata McGraw-Hill, Edition, 2000.

FOURTH SEMESTER
CODE SUBJECTS CREDITS

MCA 41 MCA 42 MCA 43 MCA 44 MCA 45 MCA 46

Advance Software Engineering Analysis and Design of Algorithm Advanced Java Programming System Programming RDBMS Lab Advanced Java Programming Lab

4 4 4 4 1 1

Subject Name: Advanced Software Engineering

Subject code: MCA41

Module 1 Unit 1 Introduction

The evolving role of software, Software, Software Crisis, Software Myths, The Software Process, Software Process Models, Product and Process. Software Engineering Approach, A Generic View of Software Engineering, Software Process, Software Process Models - Waterfall Model, Prototype Model, Incremental Model, Spiral Model, COCOMO Model.

Unit 2 Software Process and Project Metrics

Measures, Metrics and Indicators, Metrics in the Process and Project Domains, Software Measurement, Metrics for Software Quality, Integrating Metrics within the Software Engineering Process.

Unit 3 Software Project Planning

Project Planning Objectives, Software Scope, Resources, Software Project Estimation, Decomposition Techniques, Empirical Estimation Models, the Make-Buy Decision.

Unit 4 Risk Management

Software Risks, Risk Identification, Risk Projection, Risk Mitigation, Monitoring, and Management. Software requirement Specification, Formal Specification Techniques, Languages and Processors for Requirement Specification.

Module 2 Unit 1

Design Concepts and Principles

Software Design and Software Engineering, Modularity, Cohesion, Coupling.

Unit 2 Architectural Design

Software Architecture, Data Design, Analyzing Alternative Architectural Designs, Mapping Requirements into a Software Architecture, Transform Mapping, Transaction Mapping

Unit 3 Component-Level Design

Structured Programming, Comparison of Design Notation

Unit 4 Software Testing Techniques

Software Testing Fundamentals, White Box Testing, Black Box Testing

Unit 5 Software Testing Strategies

Strategic Issues, Unit Testing, Integration Testing, Validation Testing, System Testing, The Art of Debugging

Module 3 Unit 1 Formal Methods

Basic Concepts, Mathematical Preliminaries, Applying Mathematical Notation for Formal Specification, Formal Specification Languages

Unit 2 Cleanroom Software Engineering

The cleanroom approach, Functional Specification, Cleanroom Design, Cleanroom Testing

Unit 3 Component Based Software Engineering

Engineering of Component Based Systems, The CBSE Process, Domain Engineering, Component Based Development, Classifying and Retrieving Components, Economics of CBSE

Unit 4 Client/Server Software Engineering

The Structure of Client/Server Systems, Software Engineering for Client/Server Systems, Analysis Modeling Issues, Design for Client/Server Systems, Testing Issues

Module 4 Unit 1 Web Engineering

The attributes of Web-Based Applications, Formulating/Analyzing Web-Based Systems,

Design for Web-Based Applications, Testing Web-Based Applications

Unit 2 Reengineering
Software Reengineering, Reverse Engineering, Restructuring, Forward Engineering

Unit 3 Computer-Aided Software Engineering

What is CASE?, Building Blocks for CASE, Integrated CASE Environments, The Integration Architecture, The CASE Repository

Reference Books
1. Roger S. Pressman - Software Engineering, A Practitioners approach, 5th Edition, McGraw-hill book company 2. Richard Fairly Software Engineering Concepts, First Edition, TATA Mcgraw Hill Publishing Co Ltd. 3. Pankaj Jalote An integrated approach to Software Engineering Narosa Publishing house. 4. Jawadekar- Software Engineering: A Primer TMH 2008

Subject Name: Analysis and Design of Algorithms 42

Subject Code: MCA-

Module 1 Unit 1: Elementary Data Structures Stacks and queues, Linked lists, Implementing pointers and objects, Representing rooted trees Unit 2: Hash Tables Direct-address tables, Hash tables, Hash functions, Open addressing, Perfect hashing Unit 3 Binary Search Trees What is a binary search tree?, Querying a binary search tree, Insertion and deletion, Randomly built binary search trees Unit 4 Introduction to Algorithms Notion of Algorithm, Fundamentals of Algorithmic Problem Solving, Important Problem Types Module 2 Unit 1:

Analysis of Algorithm Efficiency Analysis Framework, Asymptotic Notations and Basic Efficiency Classes, Mathematical Analysis of Non Recursive Algorithms, Mathematical Analysis of the Recursive Algorithms, Example - Fibonacci Numbers Unit 2: Brute Force Selection Sort, Bubble Sort, Sequential Search, Brute Force String Matching, Closes-Pair and Convex- Hull Problems by Brute-Force String, Matching, Exhaustive Search Unit 3: Divide and Conquer Merge Sort, Quick Sort, Binary Search, Binary Tree Traversals, Strassens Matrix Multiplication, Closest-Pair and Convex-Hull Problem Unit 4: Decrease and Conquer Insertion Sort, Depth-First Search and Breadth-First Search, Topological Sorting

Module 3 Unit 1: Transform and Conquer Presorting, Horners Rule, Binary Exponentiation Unit 2: Space and Time Tradeoff Sorting by Counting, Input Enhancement in String Matching Unit 3: Dynamic Programming Computing Binomial Coefficient, Warshalls Algorithm, Floyds Algorithm, Optimal Binary Search Trees, Knapsack Problem, Memory Functions Unit 4: Greedy Technique Prims Algorithm, Kruskals Algorithm, Dijkstras Algorithm, Huffman Tree Module 4 Unit 1: Limitation of Algorithm Power Lower- Bound Arguments, Decision Tree, P, NP and NP-Complete Problems Unit 2: Backtracking

4-Queen, 8-Queen and n-Queens problem, Hamiltonian Circuit, Sum of Subset problem Unit 3: Branch and Bound Assignment, Knapsack Problem, Traveling Salesman Unit 4: Approximation Algorithms for NP-hard Problems Traveling Salesman, Knapsack Problem References 1. Introduction to the Design and Analysis of Algorithms: International Edition, Anany V. Levitin, Pearson Education 2. Introduction to Algorithms by Thomash H. Cormen 3. The Design and Analysis of Computer Algorithms by Alfred V. Aho, John E. Hopcroft and Jeffrey D. Ullman 4. Design Methods and Analysis of Algorithms by S. K. Basu 5. Algorithm Design by Michael T. Goodrich and Roberto Tamassia 6. Art of Computer Programming, vol. 3 by Donald Knuth

Subject Name: Java Programming

Subject Code: MCA43

Module 1 Unit 1 Introduction to Java Introduction, The Creation of Java ,Why Java is important to the Internet, Java Magic: The Bytecode, The Java Buzzwords, Java Development Kit (JDK), Java Virtual Machine (JVM), Summary. Unit 2 JAVA Fundamentals Introduction, Tokens, Data Types, How does it work?, Operators, Logical Expression, Type Casting , Control Statements , Strings, Summary. Unit 3 JAVA Classes and Object Introduction, Object-Oriented Programming Concepts, Classes: Defining simple class, Class Variables, Class Methods, Return Types, Method Modifiers, Declaring Method Security and Accessibility, Overloading Methods; Working with Objects: Creating Objects, Destroying Objects, Constructors, Summary Unit 4 Inheritance, Packages and Interfaces

Introduction, Inheritance: Simple Inheritance, Method Overriding; Packages: Declaring a Package, Accessing Other Packages, Package-Naming Conventions, The CLASSPATH Environment Variable, Overview of the Standard Packages, Interfaces: Declaring an Interface, Implementing Interfaces, Modifiers Using an Interface ,Summary Module 2 Unit 1 Exception Handling Introduction, Exception Methods, java.Lang Exceptions ,Summary Unit 2 JAVA I/O Introduction, Streams in Java, How to use File Streams, Working with Filter Streams, How to Use DataInputStream and DataOutputStream, Object Serialization, Summary Unit 3 Multithreading In Java Introduction , What is Thread, The Life Cycle of a Thread, How to create Thread, Extending Thread, Implementing Runnable, Synchronization, Summary Unit 4 Networking in JAVA Introduction, Basics of Networking, Sockets, Client - Server in Networking, The Internet Addressing and DNS, URL Class, TCP/IP and Datagram, Summary Module 3 Unit 1 JAVA AWT Introduction , Control Classes:The Component Class, Layout Classes, Menu Classes ,Summary Unit 2 Event Handling Introduction, Event Handling Mechanism, The Delegation Event Model, Event Classes, Sources of Events, Event Listener Interfaces, Using the Delegation Event Model, Adapter classes, Inner Classes, Summary Unit 3 Swing, Applets and Applications Introduction ,The origin of the Swing, Two key swing features, Introduction to Applets: Applet Examples, The java.applet.Applet Class, The Five Stages of an Applet's Life Cycle, Methods for Adding UI Components, Methods for Drawing and Event Handling; Components and Containers: JLabel and Image Icon, JTextField, The Swing Buttons,

JTabbedPane, JScrollPane, JList, JComboBox, JTable; The Swing Packages,A Simple Swing Applications, Create a Swing Applet, Summary UNIT 4 Introduction to JDBC Introduction, JDBC Architecture, JDBC Drivers, A Complete JDBC Example, Prepared Statements, Meta-Data, Transactions, Stored Procedures,JDBC Exception Types, Summary Module 4 UNIT 1 Servlets Introduction, What is Servlet, How Does a Servlet Work, How do U Run a Servlet, Servlets Vs CGI Programs, The Java Servlet API, The Role Of Server, A Basic HTTP Servlet, Session Tracking, Summary UNIT 2 Java Server Pages Introduction, What is JSP Page?, The Life Cycle of a JSP Pages, Summary UNIT 3 RMI Introduction, Distributed VS Non-Distributed Programs, Java RMI Architecture, Using RMI, Parameters in RMI, Summary UNIT 4 Java Bean Introduction, What is Bean?, Reusable Software Components, What Distinguishes Java Beans from Widgets?, What Distinguishes Java Beans from Java Classes?, Basic Bean Concepts, Summary Reference Books 1. Java- The Complete Reference- Herbert Schildt, 7th Edition, Tata McGraw Hill, 2007. 2. Introduction to Java Programming Y. Daniel Liang, 6th Edition, Pearson Education, 2007.

Subject Name: System Programming

Subject Code: MCA 44

Module 1 Unit 1 Introduction Introduction, What do we mean by programming?, Differences between application software and system software, SIC Machine architecture, SIC/XE Machine Architecture,

Unit 2 CISC Machines What is CISC?, The rise of CISC, Characteristics of CISC design, Advantages of CISC, Disadvantages of CISC Unit 3 RISC Architecture What is RISC?, The rise of RISC, Characteristics of RISC design, RISC Vs CISC Module 2 Unit 1 Assemblers Introduction, A Simple SIC Assembler, Passes of the assembler, Assembler Algorithm and Data Structures Unit 2 Assembler Design Options Machine Dependent Features, Machine Independent Assembler Features, Assembler Design Options

Unit 3 Loaders and Linkers Basic Loader Functions, Machine-Dependent, Loader Features, Machine-Independent Loader Features, Loader Design Options, Implementation Examples Unit 4 Text Editors Introduction, History of editors, Types of text editors, Typical features of text editors, User Interface, Editor Structure, Integrated Development Environment, Debugging Functions Module 3 Unit 1 Macro Processors Introduction, Basic Macro Processor Functions, Machine Independent Macro Processor Functions, Macro Processor Design Options Unit 2

Compilers Introduction, Lexical Analysis, Syntax Analysis, Semantic Analysis, Intermediate Representation, Optimization, Code Generation, Error detection Unit 3 Lex and Yacc The Simplest Lex Program, Recognizing Words with Lex, Grammars, The Parts of Speech Lexer, Running Lex and Yacc Unit 4 Using Lex Regular Expressions, A Word Counting Program, Parsing a Command Line Module 4 Unit 1 Using Yacc Grammars, Shift/Reduce Parsing, A Yacc Parser, The Lexer, Arithmetic Expressions and Ambiguity, Variables and Typed Tokens, Symbol Tables, Functions and Reserved Words Unit 2 A Reference for Lex Specifications Structure of a Lex Specification, BEGIN, ECHO, Input from Strings, Internal Tables (%N Declarations), Line Numbers and yylineno, Multiple Lexers in One Program, output(), Portability of Lex Lexers, Regular Expression Syntax, REJECT, Returning Values from yylex(), unput(), yyinput(), yyoutput(), yyunput(), yyleng, yyless(), yylex(), yymore(), yytext, yywrap() Unit 3 A Reference for Yacc Grammars Structure of a Yacc Grammar, Actions, Ambiguity and Conflicts, Bugs in Yacc, End Marker, Error Token and Error Recovery, %ident Declaration, Literal Block, Literal Tokens, Portability of Yacc Parsers, Precedence, Associativity, and Operator Declarations, Recursive Rules, Rules, Special Characters, Start Declaration, Symbol Values, Tokens, %type Declaration, %union Declaration, Variant and Multiple Grammars, y.output Files, Yacc Library, YYABORT, YYACCEPT, YYBACKUP, yyclearin, yydebug and YYDEBUG, YYDEBUG, yyerrok, YYERROR, yyerror(), yyparse(), YYRECOVERING() Unit 4 Yacc Ambiguities and Conflicts

The Pointer Model and Conflicts, Common Examples of Conflicts, IF THENELSE, How Do I Fix the Conflict?, IFTHENELSE (Shift/Reduce) Reference Books System Software An Introduction To System Programming by Leland L.Beck System Software and Operating Systems by Dhamdhere TMH 2nd Edition System Programming - Donovon

FIFTH SEMESTER
CODE
MCA51 MCA52 MCA53 MCA54 MCA55 MCA56

SUBJECTS
Advanced Computer Network Internet Programming and Web Designing Data Warehousing and Data Mining Elective -1 Graphics Lab Web Designing/ Internet Lab

CREDIT S
4 4 4 4 4 4

Subject Name: Advanced Computer Networks and Security

Subject Code: MCA51

MODULE 1 UNIT 1 Introduction to Computer Networks-I Introduction, Uses of Computer Networks: Business Applications, Home Applications, Mobile Users, Social Issues; Network Hardware: Wireless Networks, Home Networks, Internetworks; Network Software: Protocol Hierarchies, Design Issues for the Layers; UNIT 2 Introduction to Computer Networks-II Connection-Oriented and Connectionless Service, Service Primitives, Relationships of Services to Protocols, Example Networks: The ARPANET, The Internet, ATM UNIT 3 Network layer

Introduction to Network Layer, Store-and-Forward Packet Switching, Services Provided to the Transport Layer , Implementation of Connectionless Service, Implementation of Connection-Oriented Service, Comparison of Virtual Circuit and Datagram Subnets, Types of Packet-Switched Networks; Messages, Packets and Frames; Forwarding, Concepts of Routing Algorithms, The Optimality Principle UNIT 4 Routing Algorithms Shortest Path Routing, Flooding, Distance Vector Routing, Link state Routing, Hierarchical Routing, Broadcast Routing, Multicast Routing MODULE 2 UNIT 1 Congestion Control Routing for Mobile Hosts, Routing in Ad hoc Networks, Congestion Control: General Principles of Congestion Control, Congestion Prevention Policies, Congestion Control in Virtual-Circuit Subnets , Congestion Control in Datagram Subnets, Load Shedding , Jitter Control

UNIT 2 Quality of Service Flow characteristics, Techniques for Achieving- Good Quality of Service, Integrated Services, Differentiated Services UNIT 3 Internetwork Introduction, Need for Network Layer , Internetworking: Internet as Packet-Switched Network, Internet as Connectionless Network, Tunneling, Inter-network Routing, Fragmentation

UNIT 4 Network Layer in the Internet IP Protocol, IP Addresses, Subnet, IPV6, Mobile IP, Internet Control Protocols MODULE 3 UNIT 1 Transport Layer Protocol

The Transport Service: Services Provided to the Upper Layers, Transport Service Primitives; Elements of Transport Protocols: Addressing, Connection Establishment, Connection Release, Flow Control and Buffering UNIT 2 Internet Transport Protocols Introduction to UDP, Remote Procedure Call, The Real-Time Transport Protocol, Introduction to TCP, TCP Service Model, The TCP Protocol, TCP Segment Header, UNIT 3 Transport Control Protocol TCP Connection Establishment, TCP Connection Release, Modeling TCP Connection Management, TCP Transmission Policy, TCP Congestion Control, TCP Timer Management, UNIT 4 Application Layer Application Layer Overview, DNS: Domain Name Space, Resource Records, Name Servers; Architecture and Services, The User Agent Message Formats, Message Transfer, Final Delivery, MODULE 4 UNIT 1 Introduction to Networks Security Introduction to Networks Security, Services, Mechanisms and Attacks: Services, Mechanisms, Attacks; The OSI Security Architecture: Security Services, Security Mechanisms, Security Attacks; A Model for Network Security, Symmetric Cipher Model,

UNIT 2 Crptography General concepts, Cryptanalysis, Substitution Techniques, Transposition Techniques, Block Cipher Principles: Stream Cipher and Block Cipher, Feistel Cipher, Feistel Cipher Structure, Feistel Decrytion Algorithm; UNIT 3 Symmetric/Public Key Algorithms Simplified DES, DES-Encryption Algorithm, Double DES, Triple DES with two keys, Three DES with three keys, Blowfish, The RSA Algorithm,

UNIT 4 E-Mail Security Introduction, Pretty Good Security: Operational description of PGP, Cryptographic keys and key rings; S/MIME: S/MIME Functionality, S/MIME Messages; References 1. Charlie Kaufman, Radia Perlman, Mike Speciner, Network Security: Private communication in a Public World, Second Edition, Pearson Education Asia/PHI, 2002. 2. Atul Kahate, Cryptography and Network Security, Tata McGrawHill, 2003.

Subject Name: Internet Programming and Web Designing Subject Code: MCA52 MODULE 1
Unit 1 Introduction to basic Internet Concepts and Fundamentals of Web Internet , Addresses, Domain Names, WWW ,Web Browsers and Web Servers ,Web Browsers and its Evolution ,Chronology of Evolution ,. Unit 2 Web Servers ,General characteristics of the Servers ,Virtual Document Trees ,Virtual Hosts , Proxy Servers , Apache Server, Internet Information Server , URLs, MIME, HTTP, Security The Web Programmers Toolbox , Overview of XHTML, Overview of XML, Overview of JavaScript, Overview of Perl. Unit 3 What is World Wide Web? , How Does the Web Work?, What is Hypertext? ,3.4 Short History of HTML. Unit 4 Hyper Text Markup Language , Origin and evolution , HTML Basics , HTML Elements, HTML Attributes, Headings ,Horizontal Ruler, HTML Comments , Paragraphs, Line Breaks, HTML Formatting Tags, Links Hyperlinks and Anchors , The Image Tag , Lists. Module 2 Unit 1

Tables , Forms, XHTML, Why XHTML?, Syntactic differences between HTML and XHTML , Mandatory XHTML Elements, XHTML DTD, Document Type Definition ,XHTML Validation Unit 2 Sample XHTML Programs, HTML 4.01 / XHTML 1.0 Reference Unit 3 What is CSS? , Styles Solve a Common Problem, Cascading Order, Introduction to Style Sheet Concepts, Levels of Style Sheets , Comments in CSS, Different forms of Selectors Simple Selector Forms, Class Selectors , Generic Selectors ,id Selectors, Universal Selectors , Pseudo Classes, Property Value Forms , Examples Unit 4 Overview of JavaScript, History, JavaScript Constituents, Client-side JavaScript, Advantages of JavaScript, and Limitations with JavaScript, JavaScript Development Tools, and Where JavaScript is today? , Java V/S JavaScript, Uses of JavaScript, Browser and XHTML / JavaScript Documents, Event-Driven Computation, Browser support for the JavaScript Documents, What can a JavaScript Do?

Module 3 Unit 1 Syntatic Characteristics, Identifiers, Reserve Words, Pre-defined Words, JavaScript Reserve Words, Embedding JavaScript in a HTML Page ,Placing the <script> tag, Using an External JavaScript Content, Comments in JavaScript. Unit 2 Statements in JavaScript, Variables, Creating and Using the Variables, Data Types, Operators, JavaScript Arithmetic Operators ,JavaScript Assignment Operators, Comparison Operators, Logical Operators ,Conditional Operators ,String Manipulation , Mathematical Functions ,JavaScript Numerical Constants ,Scoping Rules ,Popup Boxes Unit 3 Control Structures,- If..then..else statements ,Switch Statement, While Loop, do..while Loop, for Loop ,forin Loop,Break and Continue Statements ,Using Labels to Control the Flow. Arrays - Creating Array Object, Accessing Array Elements, Joining Two Arrays, Sorting The Array elements

Unit 4 Function- Function Definition, Calling a Function ,Function Parameters, The return Statement. Events - What is an Event? , HTML 4 Standard Events , All about Cookies

Module 4 Unit 1 XML Basics and Origin ,XML Tree, XML Syntax Rules, XML Tags are Case Sensitive , XML Elements Must be Properly Nested, XML Documents Must have a Root Element ,XML Attribute Values Must be Quoted ,Entity References ,Comments in XML, Whitespace in XML, XML Elements,XML Naming Rules ,Best Naming Practices,XML Elements are Extensible. Unit 2 XML Attributes -XML Attributes Must be Quoted, XML Elements vs. Attributes, Avoid XML Attributes, XML Attributes for Metadata ,XML Validation ,Valid XML Documents, XML DTD,XML Schema, General XML Validator ,Displaying XML with CSS,Displaying XML with XSLT, Displaying XML in HTML, DOM and XML, HTML DOM.

Unit 3 Introduction Prerequisite, PHP and MySQL, Why Use PHP?, Installation Details ,Origin and Uses of PHP ,General Syntactic Characteristics ,Variables, Joining Strings, PHP String Functions , Scope of the Variables , PHP Superglobals,Variables variables ,PHP Constants ,Operators Unit 4 Control Statements, PHP Looping, Arrays, Functions, Forms. .1 Create a Connection to a MySQL Database, PHP MySQL Create Database and Table, PHP MySQL Insert Into, Insert Data from a Form Into a Database, PHP MSQL Select ,PHP MySQL the Where Clause, PHP MySQL Order By Keyword ,PHP MySQL Update, PHP MySQL Delete. Reference Books 1. Robert W. Sebesta: Programming the World Wide Web, 4 th Edition, Pearson Education, 2008. 2. M.Deitel, P.J. Deitel, A.B. Goldberg: Internet and World Wide Web How to H Program, 3rd Edition, Pearson Education/PHI, 2004.

Subject Name: Data Warehousing and Data Mining MCA53 Module 1 Unit 1 Fundamentals of Data Mining

Subject Code:

Definition, Motivation, what kinds of data? Data Mining Functionalities, Classification of Data Mining Systems, Major Issues in Data Mining.

Unit 2
Data Warehouse and OLAP Technology for Data Mining: Definition, Multidimensional datamodels, Data Warehouse Architecture, Data Warehouse Implementation, Further development of data cube technology, From Data Warehousing to Data Mining.

Unit 3 Data Preprocessing

Need for preprocess the data, Data Cleaning, Data Integration, Data Transformation, Data Reduction, Discretization and Concept of Hierarchy Generation.

Unit 4
Data Mining Primitives, Languages and system Architectures: Data Mining Primitives, Architectures of Data Mining System, A Data Mining Query Language, Designing Graphical User Interfaces Based on a Data Mining Query Language

Module 2 Unit 1
Concept Description-Characterization: Definition, Data Generalization and Summarization-Based Characterization, Analytical Characterization, Concept Description-Comparison: Mining Class Comparisons, Mining Descriptive Statistical Measures in Large Databases

Unit 2
Mining Association Rules in Large Databases: Association Rule Mining, Mining Single Dimensional Boolean Association Rules form Transactional Databases, Mining Multilevel Association Rules form Transaction Databases, Mining Multidimensional Association Rules from Relational Databases and Data Warehouses.

Unit 3
Classification and Prediction: Definition, Issues Regarding Classification and Prediction, Classification by Decision Tree Induction, Bayesian Classification, Classification by Back propagation

Unit 4
Classification Based on Concepts form Association Rule Mining, Other Classification Methods Prediction, Classifier Accuracy.

Module 3 Unit 1 Cluster Analysis

Cluster Analysis: Definition, Types of data, Clustering methods

Unit 2
Partitioning methods, Hierarchical methods, Density based methods

Unit 3
Grid based methods, Model based clustering methods, Outlier analysis

Module 4

Unit 1
Mining Complex Types of Data: Multidimensional Analysis and Descriptive Mining of Complex Data Objects, Mining Spatial Databases

Unit 2
Mining Multimedia Databases, Mining Time Series and Sequence Data , Mining Text Databases, Mining the World Wide Web.

Unit 3
Applications and Trends in Data Mining: Data Mining Applications, Data Mining /system Products and Research Prototypes

Unit 4
Additional Themes on Data Mining, Social Impacts of /data Mining, Trends in /data Mining.

References
1. Introduction to Data Mining Pang-Ning Tan, Michael Steinbach, Vipin Kumar, Pearson Education, 2007 2. Data Mining Concepts and Techniques Jiawei Han and Micheline Kamber, 2nd Edition, Morgan Kaufmann, 2006.

ELECTIVE -1 Subject Name: Compiler Design

Subject Code: MCA54

Module1 Unit 1 Introduction What is a compiler?, Why learn about Compilers , Phases of Compiler, The phases of a compiler, The Grouping of Phases into Passes,Compiler-Construction Tools, Unit 2 Basic Lexical Analysis Introduction ,Role of Lexical Analyzers,Lexical Analysis Versus Parsing, Tokens, Patterns, and Lexemes, Attributes for Tokens,Lexical Errors, Regular expressions, Nondeterministic finite automata Unit 3 Advanced Lexical Analysis Converting a regular expression to an NFA, Deterministic finite automata, Converting an NFA to a DFA, Specification And Recognition of Tokens, Strings And Languages, Operations on Languages, Regular Expressions, Regular Definitions, Extension of Regular expressions , Recognition of Tokens, Transition Diagrams, Recognition of Reserved Words and Identifiers, Input Buffering, Buffer Pairs, Sentinels.

Unit 4 Lexers and Lexer Generators Lexers and Lexer Generators, Use of Lex, Structure of Lex Programs,Conflict Resolution in Lex , The Lookahead Operator . Module2 Unit 1 Syntax Analysis -1 Introduction ,The Role of the Parser, Representative Grammars, Syntax Error Handling, Error-Recovery Strategies, Context-free grammars , How to write context free grammars , Derivation, Syntax trees and ambiguity, Rewriting ambiguous expression grammars. Unit 2 Syntax Analysis - 2 Top down Parsing , Nullable and FIRST, Predictive parsing revisited , FOLLOW , LL () parsing, Recursive descent ,Table-driven LL () parsing ,Conflicts, Rewriting a grammar for LL() parsing, Eliminating left-recursion ,Indirect left-recursion , Left-factorization ,Bottom up parsing ,SLR parsing, Constructing SLR parse tables, Conflicts in SLR parse-tables, using precedence rules in LR parse tables, Using LR-parser generators

Unit 3 Syntax Analysis - 3 Declarations and actions,Abstract syntax ,Operator Precedence, Rewriting ambiguous expression grammars

Module 3 Unit 1 Symbol Tables Introduction , Symbol tables,Does the Lexical analyzer Creates Symbol-Table Entries? , Implementation of symbol tables, Simple persistent symbol tables, A simple imperative symbol table ,Efficiency issues, The Use of Symbol Tables, Shared or separate name spaces. Unit 2 Type Checking Introduction , Environments for type checking, Type checking expressions, Type checking of

function declarations ,Type checking a program, Advanced type checking . Unit 3 Intermediate-Code Generation Introduction , Choosing an intermediate language,The intermediate language, Generating code from expressions, Examples of translation, Translating statements ,Logical operators, Sequential logical operators,Advanced control statements,Translating structured data, Floating-point values, Arrays, Strings, Records/structs and unions,Translating declarations, Example: Simple local declarations .

Module 4 Unit 1 Code Generation Introduction, Conditional jumps, Constants, Exploiting complex instructions,Two-address instructions, Optimizations . Unit 2 Register Allocation Introduction, Liveness, Liveness analysis, Interference, Register allocation by graph colouring, Spilling. Unit 3 Function Calls Introduction ,The call stack, Activation records ,Prologues, epilogues and call-sequences, Caller-saves versus callee-saves, Using registers to pass parameters, Interaction with the register allocator, Accessing non-local variables, Global variables, Call-by-reference parameters , Nested scopes, Variants, Variable-sized frames, Variable number of parameters, Direction of stack-growth and position of FP, Register stacks. References 1. Alfred W Aho, Ravi Sethi, Jeffrey D Ullman, Compilers-Principles, Techniques and Tools, Addison-Wesley, 1986. Andrew W Apple, Modern Compiler Implementation in C, Cambridge University

Subject Name: Mobile Communication

Subject Code: MCA54

Module 1 Unit 1 INTORDUCTION Introduction, Application, History of Wireless Communication, A simplified reference model, Cellular Systems Unit 2

PROTOCOL TCP AND IP SUITE

The need for Protocol Architecture, The TCP/IP Protocol Architecture, Internetworking, Internet Protocol (IP),Transmission Control Protocol (TCP) ,User Datagram Protocol (UDP). Unit 3 MOBILE DEVICES AND SYSTEMS, ARCHITECTURES Mobile phones, Digital Music Players, Handheld Pocket Computers, Handheld Devices, Operating Systems, Smart Systems, Limitations of Mobile Devices, Automotive Systems Unit 4 GSM GSM Services and System Architectures, Radio Interfaces, Protocols, Localization, Calling, Handover, General Packet Radio Service Module 2 Unit 1

MEDIUM ACCESS CONTROL MAC-1

Introduction to MAC, Motivation for a specialized MAC, Hidden and Exposed Terminals , Near and Far Terminals ,SDMA, FDMA, TDMA and CDMA ,Classical Aloha, Slotted Aloha, Types of Carrier Sense Multiple Access, MACA, Solution of MACA, Concept of Polling, ISMA , Comparison of S/T/F and CDMA Unit 2

MEDIUM ACCESS CONTROL MAC-2

Introduction to CDMA based Systems, OFDM Unit 3 WIRELESS LAN Introduction, Goals,Advantages & Disadvantages, Infrared Versus Radio Transmission ,Infrastructure of Adhoc Networks, IEEE 802, Architecture of IEEE 802.11 and Adhoc Wireless LANs , Protocol Architecture4.7 MAC Management

Unit 4 MOBILE IP NETWORK LAYER, MOBILE TRANSPORT LAYER IP and Mobile IP Network Layers Packet Delivery and Handover Management, Registration, Tunneling and Encapsulation,

Module 3 Unit 1 MOBILE IP NETWORK LAYER, MOBILE TRANSPORT LAYER Route Optimization, Dynamic Host Configuration Protocol.Indirect TCP, Snooping TCP, Mobile TCP, Other Methods of TCP layer Transmission for Mobile Networks. Unit 2 DATABASES

Database Hoarding Techniques, Data Caching, Client Server Computing and Adaptation, Transactional Models, Query Processing, Data Recovery Process, Issues relating to Quality of Service Unit 3 DATA DISSEMINATION AND BROADCASTING SYSTEMS Communication Asymmetry, Classification of Data Delivery Mechanisms, Data Dissemination Broadcast Models, Selective Tuning and Indexing Techniques, Digital Audio Broadcasting, Digital video Broadcasting. Unit 4 DATA SYNCHRONIZATION IN MOBILE COMPUTING SYSTEMS Synchronization, Synchronization Protocols, SyncML Synchronization Language for Mobile Computing, Synchronized Multimedia Markup Language (SMIL). Module 4 Unit 1 MOBILE DEVICES, SERVER AND MANAGEMENT, WIRELESS LAN, MOBILE INTERNET CONNECTIVITY AND PERSONAL AREA NETWORK -I Mobile agent, Application Server, Gateways, Portals, Service Discovery, Device Management, Mobile File Systems. Unit 2 MOBILE DEVICES, SERVER AND MANAGEMENT, WIRELESS LAN, MOBILE INTERNET CONNECTIVITY AND PERSONAL AREA NETWORK -II Wireless LAN (WiFi) Architecture and Protocol Layers, WAP 1.1 and WAP 2.0 Architectures, Bluetooth enabled Devices Network, Zigbee. Unit 3 MOBILE APPLICATION LANGUAGES XML, JAVA, J2ME AND JAVACARD, MOBILE OPERATING SYSTEMS Introduction, XML, JAVA, Java 2 Micro Edition (J2ME), JavaCard Operating System, PalmOS, Windows CE, Symbian OS, Linux for Mobile Devices Unit 4 BLUETOOTH Introduction ,Bluetooth Applications, Architecture,Concepts of Networking and Bluetooth ,Piconet,Bluetooth Scartternet,Protocol Stack 5.8 Core Protocols of Bluetooth,L2CAP,Bluetooth Security,Power Management

References
1. Raj Kamal: Mobile Computing, Oxford University Press, 2007. 2. Schiller: Mobile Communication, Pearson Publication, 2004.

Subject Name: Simulation and Modeling MCA54 Module 1 Unit 1 Introduction to Simulation

Subject Code:

Advantages and Disadvantages of Simulation, When Simulation is the Appropriate Tool, When Simulation is not Appropriate, Areas of Application, Systems and System Environment, Components of a System, Discrete and Continous System, Model of a System, Steps in a Simulation Study

Unit 2

Simulation of Discrete and Continous Systems

Continous system simulation : Simulation of a Chemical Reactor system, Simulation of a Water Reservoir system, Discrete system simulation: Fixed time step vs event to event model, On simulating randomness

Unit 3 Simulation software

History of simulation software, desirable software features, General purpose Simulation packages, Object Oriented Simulation, Trends in Simulation software

Unit 4 Stimulation of Queuing and Inventory Systems

Introduction to Queuing Systems, Characteristics of Queuing Systems, Queuing Notation Simulation of Queuing Systems, Simulation of Inventory Systems

Module 2 Unit 1 Statistical Models

Review of Terminology and Concepts, Useful Statistical Models, Discrete Distributions, Continuous Distributions, Poisson Process, Empirical Distributions

Unit 2 Random-Number Generation

Random Numbers, Techniques for Generating Random Numbers, Tests for Random Numbers

Unit 3 Random Variate Generation :

Inverse Transform Technique, Acceptance-Rejection Technique

Unit 4 Input Modeling

Data Collection, Identifying the Distribution with Data, Parameter Estimation, Goodness - of - Fit Tests, Selecting Input Models without Data, Multivariate and Time-series Input Models

Module 3 Unit 1 Verification and Validation of Simulation Models

Model building, Verification of models, Verification of Simulation Models, Calibration and Validation of Models

Unit 2 Output Analysis for a single model

Types of simulations with respect to output analysis, stochastic nature of output data, measure of performance and their estimation. Output Analysis for terminating simulators, Output analysis for steady state simulation

Unit 3 Comparison and Evaluation of Alternative System Design

Comparision of two system design, comparision of several system design, meta modeling, optimization via simulation

Unit 4 Simulation of different systems

Simulation of manufacturing systems, simulation of computer systems, simpulation of super market, simulation of pert network

Module 4 Unit 1 Design of Simulation Experiments

Problem formulation, data collection and reduction, time flow mechanism, key variables, logic flow chart, starting condition, run size, experimental design consideration, output analysis and interpretation validation.

Unit 2 Simulation Languages

Comparison and selection of simulation languages, study of GPSS. .

Unit3 Development of simulation models using GPSS

Telephone system, Queuing systems, Production systems, Inventory systems.

References
1. Jerry Banks, John S. Carson II Barry L Nelson, David M. Nicol: Discrete-Event System Simulation 2. Lawrence M. Leemis, Stephen K. Park: Discrete Simulation: A First Course, Pearson / Prentice-Hall, 2006.

SIXTH SEMESTER
CODE
MCA61 MCA62 MCA63 MCA64

SUBJECTS
Advance MIS and E-Commerce Elective 2 Elective 3 Project

CREDI TS
4 4 4 6

Subject Name: Advanced MIS and E Commerce 61

Subject Code: MCA

MODULE 1
UNIT -1 Information and Knowledge
Objective, Information concepts, classification of information, methods of data and information collection, value of information, information: A quality product, General model of a human as information processor, Summary, Keywords, Exercise

UNIT -2 Technology of Information System

Objective, Introduction, Data processing, Transaction processing, Application processing, information system processing, TQM of information systems, Human factors & user interface, Strategic nature of IT decision, MIS choice of information technology, Summary, Keywords, Exercise

UNIT -3 Developing Business/IT Strategies/IT Solutions

Objective,Planning fundamentals (real world cases), Organizational planning, planning for competitive advantage, (SWOT Analysis), Business models and planning. Business/IT planning, identifying business/IT strategies, Implementation Challenges, Change management., Developing business systems, (real world case), SDLC, prototyping, System development process, implementing business system, Summary, Keywords, Exercise

UNIT - 4 Introduction to MIS

Objectives, Mis: concept, Evolution of mis, Definition, Role of the mis, Impact of mis, MIS and the user, Elements of mis, Management as a control system, MIS support to the management, Organization as system, Organizational behavior, Organization effectiveness, Summary, Keywords Exercise

MODULE 2
UNIT -1 Development of MIS
Objectives, Development of long range plans of the MIS, Ascertaining the class of information, Determining the information requirement, Development and implementation of the MIS, Management of information quality in the MIS, Organization for development of MIS, MIS development process model, Summary, Keywords, Exercise

UNIT -2 Strategic Management of Business

Objectives, Concept of corporate planning, Essentiality of strategic planning, Development of the business strategies, Type of strategies, short-range planning, tools of planning, MIS: strategic business planning, Summary, Keywords, Exercise

UNIT 3 Business Process Re-Engineering

Objectives, Introduction, Definition, Basic elements of business process, Process Model of the Organization, Elements of Process Model, Examples of business process diagrams, Value Stream Model of the Organization, Relevance of Information Technology, BPR and Information Technology, Summary, Keywords, Exercise

UNIT -4 Decision Making and DSS

Objectives, Decision making concepts; decision making process, decision-making by analytical modeling, Behavioral concepts in decision making, organizational decision-making, Decision structure, DSS components, Management reporting alternatives, Summary, Keywords, Exercise

MODULE 3
UNIT 1 Electronic Business Systems
Objectives, Enterprise business system Introduction, cross-functional enterprise applications, real world case, Functional business system, - Introduction, marketing systems, sales force automation, CIM, HRM, online accounting system, Customer relationship management, ERP, Supply chain management (real world cases for the above), Summary, Keywords, Exercise

UNIT-2 Introduction to E-Commerce

Objectives, Introduction, Definitions, Electronic Commerce Framework, Architectural framework of ECommerce, Electronic Commerce and Word Wide Web, World Wide Web as Architecture, Web Background Hypertext Publishing, Security and the web, Consumer-oriented Electronic Commerce, Summary, Keywords, Exercise

UNIT 3: Electronic Commerce and Word Wide Web

Objectives, Architectural Framework for Electronic Commerce, World Wide Web (WWW) as the Architecture, Web Background Hypertext Publishing, Technology behind the Web, Security and the Web, Summary, Keywords, Exercise

UNIT 4: Consumer-Oriented Electronic Commerce

Objhectives, Consumer Oriented Applications, Mercantile Process Models, Mercantile Models from the Consumers Perspective, Merchants Models from the Merchants Perspective, Summary, Keywords, Exercise

MODULE 4
UNIT-1 Electronic Payment Systems
Objectives, Introduction, Concept and Size of Electronic Payment, Conventional vs. Electronic Payment System, Process of Electronic Payment System , Types Of Electronic Payment Systems, Online Credit Card Payment System, Electronic Cheque Payment System, Electronic Cash Payment System, Smart Cards based Electronic Payment System, Comparision Of Electronic Payment Systems , Designing an Electronic Payment system, Summary, Keywords, Exercise

UNIT-2 Electronic Data Interchange (EDI)

Objectives, Introduction, The business process and EDI, EDI Applications in Business, Components of EDI, A Few EDI Protocols, Value Added Networks, EDI: Legal and Security Issues, EDI security , EDI legal issues, EDI and Electronic Commerce, EDI Envelopes,,EDI via the Internet (Web EDI), Summary, Keywords, Exercise

UNIT 3 EDI Implementation, MIME, and Value-Added Networks

Objectives, Standardization and EDI, EDI Software Implementation, EDI Envelope for Message Transport, Value-Added Networks (VANs), Internet-Based EDI, Summary, Keywords, Exercise

UNIT-4 Advertising and Marketing on the Internet

Objectives, Introduction, New Age Marketing, Online advertising, Competitive advantage over traditional advertising, Ethics, Charting the Online Marketing Process, Market research, Basic Methods to Get Feedback from Customers, Some Major Sources of Market Research Information, Small Business Market Research, Summary, Keywords, Exercise NOTE- MODULE 1 &2 is related to MIS, MODULE 3 &4 is related to E-commerce

Reference Books

1. Management Information Systems - Waman S Jawadekar, 3rd Edition, Tata McGraw Hill, 2007 2. Management Information Systems, James. A OBrein and George M

ELECTIVE -2
Subject Name: Pattern Recognition Subject Code: MCA 63 Elective

Module 1 Unit 1
Specific Instructional Objectives, Introduction, Machine Perception, An Example: THE SUB-PROBLEM OF PATTERN CLASSIFICATION, Learning and Adaptation, Summary, Keywords, Exercise

Unit 2 Bayesian decision theory

Specific Instructional Objectives, Introduction, Bayesian Decision Theory - Continuous Features, Summary, Keywords, Exercise

Unit 3
Specific Instructional Objectives, Minimum-Error-Rate Classifications, Minimax Criterion, NeymanPearson Criterion, Classifiers, Discriminant Functions and Decision Surfaces: The Normal Density, Summary, Keywords, Exercise

Unit 4
Specific Instructional Objectives, Discriminant Functions for the Normal Density, Summary, Keywords, Exercise

Module 2 Unit 1 Maximum likelihood and Bayesian parameter estimation

Specific Instructional Objectives, Introduction, Maximum Likelihood Estimation, Bayesian estimation, Bayesian Parameter Estimation: Gaussian Case, Bayesian Parameter Estimation: General Theory, Summary, Keywords, Exercise

Unit 2
Specific Instructional Objectives, Hidden Markov Models, Summary, Keywords, Exercise

Unit 3 Nonparametric techniques

Specific Instructional Objectives, Introduction, Density estimation, Parzen Windows, kn-Nearest-Neighbor Estimation, Summary, Keywords, Exercise

Unit 4
Specific Instructional Objectives, The Nearest-Neighbor Rule, Metrics and Nearest-Neighbor Classification, Summary, Keywords, Exercise

Module 3 Unit 1 Linear Discriminant Functions

Specific Instructional Objectives, Introduction, Linear Discriminant Functions Generalized Linear Discriminant Functions, Summary, Keywords, Exercise and Decision surfaces,

Unit 2
Specific Instructional Objectives, The Two-Category Linearly-Separable Case, Minimizing the Perceptron Criterion Function, Summary, Keywords, Exercise

Unit3

Specific Instructional Objectives, Relaxation Procedures, Nonseparable Behavior, Summary, Keywords, Exercise

Unit 4
Specific Instructional Objectives, Minimum Squared Error and the Pseudoinverse, The Ho-Kashyap Procedures, Summary, Keywords, Exercise

Module 4 Unit 1 Stochastic Methods

Specific Instructional Objectives, Introduction, Stochastic search, Boltzmann learning, Boltzmann networks and graphical models, Evolutionary methods, Summary, Keywords, Exercise

Unit 2 Non-metric Methods

Specific Instructional Objectives, Introduction, Decision trees, CART, Other tree methods, Recognition with strings, Grammatical methods, Summary, Keywords, Exercise

Unit 3 Unsupervised Learning and Clustering

Specific Instructional Objectives, Introduction, Mixture Densities and Identifiability, Maximum-Likelihood Estimates, Application to Normal Mixtures, Summary, Exercise, Keywords

Unit 4
Specific Instructional Objectives, Unsupervised Bayesian Learning, Data Description and Clustering, Criterion Functions for Clustering, Summary, Exercise, Keywords

References
1. Richard O. Duda, Peter E. Hart and David G Stork, Pattern Classification, John Wiley and Sons, Inc. 2nd Ed. 2001. 2. Robert Schalkoff, Pattern Recognition: Statistical, Structural and Neural Approaches, John Wiley and Sons, Inc. 1992.

Subject Name: Operations Research

Subject Code: MCA 63 Elective

Module 1

Unit 1 Introduction to Operations Research Origin of Operations Research, Concept and Definition of OR, Characteristics of OR, Management Applications of OR, Phases of OR , OR Models, Principles of Modeling, Simplifications of OR Models, General Methods for Solving OR Models, Scope of OR, Role of Operations Research in Decision-Making, Scientific Method in Operations Research, Development of Operations Research in India, Role of Computers in OR. Unit 2 Linear Programming Introduction to Linear Programming, General Form of LPP, Assumptions in LPP, Applications of Linear Programming, Advantages of Linear Programming Techniques, Limitations of Linear Programming, Formulation of LP Problems. Unit 3 Graphical Solution Graphical solution Procedure, Definitions, Example Problems, Special cases of Graphical method: Multiple optimal solutions, No optimal solution, Unbounded solution; Unit 4 Simplex Method-I Introduction, Steps to convert GLPP to SLPP, Some Basic Definitions, Introduction to Simplex Method, Computational procedure of Simplex Method, Worked Examples. Module 2 Unit 1 Simplex Method-II Computational Procedure of Big M Method (Charnes Penalty Method), Worked Examples, Steps for Two-Phase Method, Worked Examples Unit 2 Simplex Method-III Special cases in Simplex Method: Degenaracy, Non-existing Feasible Solution, Unbounded Solution, Multiple Optimal Solutions Unit 3 Revised Simplex Method-I

The Revised Simplex Method, Steps for solving Revised Simplex Method in Standard FormI, Worked Example.s

Unit 4 Revised Simplex Method-II Computational Procedure of Revised Simplex Table in Standard Form-II, Worked Examples, Advantages and Disadvantages. Module 3 Unit 1 Duality Duality in LPP, Important characteristics of Duality, Advantages and Applications of Duality, Steps for Standard Primal Form, Rules for Converting any Primal into its Dual, Example Problems, Primal-Dual Relationship, Duality and Simplex Method Unit 2 Dual Simplex Introduction, Computational Procedure of Dual Simplex Method, Worked Examples, Advantage of Dual Simplex over Simplex Method, Introduction to Transportation Problem, Mathematical Formulation, Tabular Representation, Some Basic Definitions, Unit 3 Transportation Problems-I Methods for Initial Basic Feasible Solution: North-West Corner Rule, Row Minima Method, Column Minima Method, Lowest Cost Entry Method (Matrix Minima Method), Vogels Approximation Method (Unit Cost Penalty Method); Unit 4 Transportation Problems-II Examining the Initial Basic Feasible Solution for Non-Degeneracy, Transportation Algorithm for Minimization Problem, Worked Examples. Module 4 Unit 1 Assignment Problem Introduction to Assignment Problem, Algorithm for Assignment Problem, Worked Examples, Unbalanced Assignment Problem, Maximal Assignment Problem. Unit 2

Game Theory Introduction to Game Theory, Properties of a Game, Characteristics of Game Theory, Classification of Games, Solving Two-Person and Zero-Sum Game, Games with Mixed Strategies: Analytical Method, Graphical Method, Simplex Method; Unit 3 Networking Shortest Route Problem, Minimal Spanning Tree Problem, Maximal Flow Problem. Unit 4 PERT /CPM Introduction to CPM / PERT Techniques, Applications of CPM / PERT, Basic Steps in PERT / CPM, Frame work of PERT/CPM, Network Diagram Representation, Rules for Drawing Network Diagrams, Common Errors in Drawing Networks, Advantages and Disadvantages, Critical Path in Network Analysis. References 1. Frederick S. Hillier and Gerald J Leiberman: Introduction to Operations Research, 8 th Edition, Tata McGraw Hill, 2005 2. Wayne L Winston: Operations Research Applications and Algorithms, 4 th Edition, Thomson Course Technology, 2003.

Subject Name: Advanced computer architecture Elective

Subject

Code:

MCA63

Module - 1
Unit 1 Introduction
Introduction, Three typical components of CPU, Input and Output devices, Classes of computers, What is Compute Architecture?, Marie, Summery, Review Questions.

Unit 2 Trends in computer Technology

Introduction, Compute Generations, Power in Integrated Circuits and cost, Parallel Computing, Summery, Review Questions

Unit 3 Dependability; measuring, reporting and summarizing performance

Introduction, The Basic Computer Performance Equation, Mathematic Preliminaries, Benchmarking, Standard Performance Evaluation Corporation Benchmarking, CPU Performance Optimization, Summery, Review Questions .

Unit 4 Quantitative Principle of Computer Design

Introduction, Quantitative Principle of computer design, Measuring performance, The CPU performance equation, Summery, Review Questions.

Module 2 - Pipelining
Unit 1 Pipelining
Introduction: Pipelining, Pipelining of processing elements, Types of pipelines, Instruction cycles in instruction pipelining, Speedup process in pipelining, Summary, Review Questions;

Unit 2 Pipeline Hazards

Introduction, What are Pipeline hazards?, Types of Pipeline hazards, Delay due to resource constraints, Delay due to data dependency, Delay due to control hazards, Summary, Review Questions

Unit 3 Implementation process and issues of pipeline

Introduction, Difficulties in pipelining, Implementation process, Summary, Review Questions.

Module 3
Unit 1 Instruction Level Parallelism
Introduction, Instruction parallelism, Micro architectural techniques that are used to exploit ILP, Superpipeline, From scalar to superscalar, Hardware support for superscalar operation, Out-of-Order execution, Summery, Review Questions

Unit 2 Basic Compiler Technique for Exploiting ILP

Introduction, Basic pipeline scheduling and loop unrolling, Compiler support for exploring and exploiting ILP, Software pipelining: Symbolic unrolling, Hardware Support for Exposing More Parallelism at Compile-Time, Compiler speculation with Hardware support , Hardware support for memory reference speculation, Summery, Review Questions

Unit 3 Reducing Branch costs with prediction

Introduction, Basic Branch Prediction and branch prediction buffer, Correlating branch predictors, Tournament predictors: Adaptively combining local and global predictors, Static branch prediction , Summery, Review Questions

Unit 4 Hardware-Based Speculation

Introduction, Hardware based Speculation (HBS), Steps of Speculation, Multiple issues with speculation, Design consideration for speculative machines, How much to speculate, Speculating through multiple branches, Summery, Review Questions

Module 4 Multiprocessors and Thread Level Parallelism Units

Unit -1 Introduction; Symmetric shared-memory architectures;

Introduction, Flynns Taxonomy, Shared memory multiprocessors, Distributed computing, Distributed shared memory architecture, Memory coherence, Cache coherence, Summery, Review Questions

Unit -2 Performance of symmetric shared memory multiprocessors;

Introduction, SMP performance issues, Symmetrical versus Asymmetrical multiprocessors, Lock Granularity, Locking Overhead, Cache Coherence Processor affinity and binding, Memory and bus connection , Performance measurement of the commercial workload, Performance for the Scientific/Technical workload, Summery Review Questions

Unit -3 Distributed shared memory and directory-based coherence Introduction, Distributed shared memory architecture, Directory based cache-coherence protocol, Performance of distributed shared memory multiprocessor , Summery, Review Questions Unit - 4 Basics of synchronization;
Introduction, Basic Hardware Primitives, Implementing locks using Coherence, Synchronization performance challenges, Barrier synchronization, Synchronization mechanism for large scale multiprocessors, Hardware primitives, memory consistency, Model of memory consistency, The Programmers view, Relaxed consistency model, Summery, Review Questions

References
1. 2. Kai Hwang, Advanced Computer Architecture Parallelism, Scalability, Programmability, McGraw Hill, 1993 David E Culler, J P Singh, Anoop Gupta, Parallel Computer Architecture, Harcoust Asia and Morgan Kaufmann, 1999.

ELECTIVE -3 Subject Name: Advanced Client Server Computing Syllabus Elective

Subject Code: MCA 64

Module 1 Unit 1 What is Client/Server Computing? A Server for Every Client ,Client/Server: Fat or Thin, Client/Server: Stateless or Stateful, Servers and Mainframes, Client/Server Functions, Client/Server Topologies, Integration with Distributed computing, Alternatives to Client/Server Systems Unit 2 Classification of Client/Server Systems Two-tier Client/Server Model, Three-tier Client/Server Model, Transaction Processing Monitors, Three-tier with Message Server, Three-tier with an Application Server, Three-tier with an ORB Architecture, Three-tier Architecture and Internet, N-tier Client/Server Model Unit 3 Clients/Server Advantages and Disadvantages Advantages , Disadvantages, Misconceptions About Client/Server Computing Unit 4 Development of Client/Server Systems Development Tools, Development Phases, Client/Server Standards Module -2 Unit 1 Client/Server Standards & Client/Server Security Improving Performance of Client/Server Applications, Single System Image, Downsizing and Rightsizing, Client/Server Methodology, Emerging Client /Server Security Threats , Threats to Server Unit 2 Client Components & Server Components Interaction between the Components, Complex Client/Server Interactions, Principles behind Client/Server Systems, The Complexity of Servers, Communications Middleware Components Unit 3 Existing Client/Server Architecture Mainframe-based Environment, LAN-based Environment, Internet-based Environment

Unit 4 Client/Server And Databases Client/Server in Respect of Databases, Client/Server Databases, Client/Server Database Computing , Client/Server Database Architecture, Database Middleware Component, Access to Multiple Databases, Distributed Client/Server Database Systems Module -3 Unit 1 Client/Server Application Technologies for Client/Server Application, Service of a Client/Server Application, Categories of Client/Server Applications Unit 2 Client Services Inter Process Communication, Remote Services, Window Services, Dynamic Data Exchange (DDE), Object Linking and Embedding (OLE), Common Object Request Broker Architecture (CORBA), Print/Fax Services, Database Services Unit 3 Server Services Application services, File services, Database services, Print/fax/image services, Communications services, Security systems services, Network management services, Server operating system services. Unit 4 Client/Server Application: Connectivity & Layered Architecture Role and Mechanism of Middleware, Layered Architecture: Design Approach & Interface in Three Layers Module-4 Unit-1 Hardware Requirements and Software Requirements PC Level Processing Units, Storage Devices, Network Protection Devices, Surge Protectors, RAID Technology, Server Specific Jargon, Client OS, Server OS, Network OS Unit-2 Communication Interface Technology

Network Interface Card, LAN Cabling, WAN, ATM, Ethernet, Token Ring, FDDI, TCP/IP, SNMP, NFS, SMTP Unit-3 Client/Server Technology And Web Services What are Web Services?, Web Services History, Web Server Technology, Web Server, Web Server Communication, Role of Java for Client/Server on Web, Web Services and Client/Server/Browser Server Technology, Client/Server Technology and Web Applications, Balanced Comp uting and the Servers Changing Role Unit-4 Future Of The Client/Server Computing Technology of the Next Generation: Networking, Development Tools, Processors and Servers; Enabling Technology: Expert Systems, Imaging, Point-of-Service; Client/Server Computing and the Intranet: Intranet, Is the Intranet Killing Client/Server?, Extranet; Future Perspectives: Job Security, Future Planning, Conclusion Reference Books 1. Client/Server Computing by Pattrick Smith and Steve Guengerich, 2 nd Edition, Prentice Hall. 2. The Essential Client/Server Survival Guide by Robert Orfali, Dan Harkey, Jeri Edwards, 2nd Edition, Galgotia Publications. 3. Client/Server System Design and Implementation by Larry T Vaughn, McGraw-Hill international Edition.

Subject Name: Artificial Intelligence

Subject Code: MCA 64 Elective

Module 1 Unit 1 Overview of Artificial Intelligence What is AI ?, Importance of AI, Early work in AI, AI and related fields Unit 2

Knowledge general concepts Introduction, Definition and importance of knowledge, Knowledge based systems, Representation of knowledge, Knowledge organization, and Knowledge manipulation Unit 3 LISP and other AI programming languages Introduction to LISP, Syntax and numeric functions, Basic list manipulation functions in LISP, Defining functions, predicates and conditionals, Input, Output and local variables, Iteration and recursion, Property lists and arrays, PROLOG and other AI programming languages Unit 4 Probabilistic reasoning Introduction, Bayesian probabilistic inference, Possible world representations, DempsterShafer theory, Ad-hoc methods, Heuristic reasoning methods Module 2 Unit 1 Search and control strategies Introduction, Preliminary concepts, Examples of search problems, Uniformed or blind search, informed search, Searching And-Or graphs Unit 2 Advanced Search Introduction, Constraint Satisfaction Search, Forward Checking, Most-Constrained Variables, Example: Cryptographic Problems, Heuristic Repair, Combinatorial Optimization Problems, Local Search and Metaheuristics, Simulated Annealing, Genetic Algorithms for Search, Real-Time A*, Iterative-Deepening A* (IDA*), Parallel Search, Bidirectional Search , Nondeterministic Search, Island-Driven Search, Nonchronological Backtracking Unit 3 Propositional and Predicate Logic Introduction, Logical Operators, Translating between English and Logic Notation, Truth Tables, Complex Truth Tables, Tautology, Equivalence, Propositional Logic, Predicate Calculus, First-Order Predicate Logic, Soundness, Modal Logics and Possible Worlds Unit 4 Matching techniques

Introduction, Structures used in matching, Measure for matching, Matching like patterns, Partial matching, Fuzzy matching algorithm, The RETE matching algorithm

Module 3 Unit 1 Knowledge organization and management Introduction, Indexing and retrieval techniques, Integrating knowledge and memory, Memory organization system Unit 2 Natural language processing Introduction, Overview of linguistics, Grammars and languages, Basic parsing techniques Unit3 Expert system architecture Introduction, Rules for Knowledge Representation, Rule-Based Systems, Rule-Based Expert Systems, CLIPS (C Language Integrated Production System), Backward Chaining in RuleBased Expert Systems, CYC Unit 4Introduction to Machine Learning Introduction, Training, Rote Learning, Learning Concepts, General-to-Specific Ordering, A Simple Learning Algorithm, Version Spaces, Candidate Elimination, Inductive Bias, Decision-Tree Induction, The Problem of Overfitting, The Nearest Neighbor Algorithm, Learning Neural Networks, Supervised Learning, Unsupervised Learning, Reinforcement Learning

Module 4 Unit 1 Introduction to Planning Introduction, Planning as Search, Situation Calculus, The Frame Problem, Means-Ends Analysis Unit 2 Planning Methods

Introduction, STRIPS, The Sussman Anomaly, Partial Order Planning, The Principle of Least Commitment, Propositional Planning, SAT Planning, Planning Graphs, ADL and PDDL, Probabilistic Planning, Dynamic World Planning, Case-Based Planning Systems, Planning and Scheduling Unit 3 Intelligent Agents Introduction, Properties of Agents, Agent Classification, Reactive Agents, Interface Agents, Mobile Agents, Information Agents, Multiagent Systems, Collaborative Agents, Agent Architectures, Accessibility, Learning Agents, Robotic Agents, Braitenberg Vehicles

Unit 4 Machine Vision Introduction, Human Vision, Image Processing, Using Texture, Structural Texture Analysis, Determining Shape and Orientation from Texture, Interpreting Motion, Making Use of Vision, Face Recognition

Reference Books: 1. Elaine Rich and Kevin Knight, Artificial Intelligence, 2nd Edition, Tata McGraw Hill, 2003. 2. Dan W Patterson, Introduction to Artificial Intelligence and Expert Systems, Prentice Hall publisher, Inc. 3. Stuart Russell, Peter Norvig, Artificial Intelligence A Modern Approach, 2nd Edition, Pearson Education / Prentice Hall of India, 2004. 4. Nils J. Nilsson, Artificial Intelligence: A new Synthesis, Harcourt Asia Pvt. Ltd., 2000. 5. George F. Luger, Artificial Intelligence-Structures and Strategies for Complex Problem Solving, Pearson Education / PHI, 2002.

Subject Name: Network Management

Subject Code: MCA 64

UNIT - 1 INTRODUCTION: Analogy of Telephone Network Management, Data and Telecommunication Network Distributed computing Environments, TCP/IP-Based Networks: The Internet and Intranets, Communications Protocols and Standards- Communication Architectures, Protocol Layers and Services; Case Histories of Networking and Management, Network Management: Goals, Organization, and Functions- Goal of Network Management, Network Provisioning, Network Operations and the NOC,

UNIT - 2 Network Topology The Importance of topology , Filtering Does Not Reduce Load on Node, Some Common Network Problems; Challenges of Information Technology Managers, Network Installation and Maintenance; Network and System Management, Network Management System platform, Current Status and Future of Network Management. UNIT 3 BASIC FOUNDATIONS: STANDARDS,: Network Management Standards, Network Management Model, Organization Model, Information Model Management Information Trees, Managed Object Perspectives, Unit 4 MODELS AND LANGUAGE Communication Model; ASN.1- Terminology, Symbols, and Conventions, Objects and Data Types, Object Names, An Example of ASN.1 from ISO 8824; Encoding Structure; Macros, Functional Model. Module2 UNIT - 1 SNMPV1 NETWORK MANAGEMENT - 1: Managed Network: The History of SNMP Management, Internet Organizations and standards, Internet Documents, The SNMP Model, The Organization Model, and System Overview.

UNIT - 2 SNMPV1 NETWORK MANAGEMENT 2: The Information Model Introduction, The Structure of Management Information, Managed Objects, Management Information Base. The SNMP Communication Model The SNMP Architecture, Administrative Model, SNMP Specifications, SNMP Operations, SNMP MIB Group, Functional Model. UNIT - 3 SNMP MANAGEMENT RMON: Remote Monitoring, RMON SMI and MIB, RMONI1- RMON1 Textual Conventions, RMON1 Groups and Functions, Relationship Between Control and Data Tables, RMON1 Common and Ethernet Groups, RMON Token Ring Extension Groups, RMON2 The RMON2 Management Information Base, RMON2 Conformance Specifications; ATM Remote Monitoring, A Case Study of Internet Traffic Using RMON. UNIT - 4 BROADBAND NETWORK MANAGEMENT: ATM NETWORKS: Broadband Networks and Services, ATM Technology Virtual Path-Virtual Circuit, TM Packet Size, Integrated Service, SONET, ATM LAN Emulation, Virtual LAN; Module3

UNIT1 ATM Network Management The ATM Network Reference Model, The Integrated Local Management Interface, The ATM Management Information Base, The Role of SNMP and ILMI in ATM Management, M1 Interface: Management of ATM Network Element, M2 Interface: Management of Private Networks, M3 Interface: Customer Network Management of Public Networks, M4 Interface: Public Network Management, Management of LAN Emulation, ATM Digital Exchange Interface Management. UNIT - 2 BROADBAND NETWORK MANAGEMENT: Broadband Access Networks and Technologies Broadband Access Networks, broadband Access Technology; HFCT Technology The Broadband LAN, The Cable Modem, The Cable Modem Termination System, The HFC Plant, The RF Spectrum for Cable Modem; Data Over Cable Reference Architecture; UNIT - 3 HFC Management Cable Modem and CMTS Management, HFC Link Management, RF Spectrum Management, DSL Technology; Asymmetric Digital Subscriber Line Technology Role of the ADSL Access Network in an Overall Network, ADSL Architecture, ADSL Channeling Schemes, ADSL Encoding Schemes; UNIT - 4 ADSL Management ADSL Network Management Elements, ADSL Configuration Management, ADSL Fault Management, ADSL Performance Management, SNMP-Based ADSL Line MIB, MIB Integration with Interfaces Groups in MIB-2, ADSL Configuration Profiles. Module 4 UNIT 1 NETWORK MANAGEMENT TOOLS Tools catalog, bit error rate tester, basic software tools, SNMP MIB tools, the protocol analyzer, commercial network management system ,System management, UNIT 2 NETWORK MANAGEMENT APPLICATIONS: Configuration Management- Network Provisioning, Inventory Management, Network Topology, Fault Management- Fault Detection, Fault Location and Isolation Techniques, Performance Management Performance Metrics, Data Monitoring, Problem Isolation, Performance Statistics; UNIT 3 Event Correlation Techniques Rule-Based Reasoning, Model-Based Reasoning, Case-Based Reasoning, Codebook correlation Model, State Transition Graph Model, Finite State Machine Model, UNIT 4 Security Management Policies and Procedures, Security Breaches and the Resources Needed to Prevent Them, Firewalls, Cryptography, Authentication and Authorization, Client/Server Authentication Systems, Messages Transfer Security, Protection of Networks from Virus Attacks, Accounting Management, Report Management, Policy-Based Management, Service Level Management.

TEXT BOOK: 1. Network Management: Principles and Practice Mani Subramanian, Pearson Education, 2003. REFERENCE BOOK: 1. Network Management Concepts and Practices J. Richard Burke, A Hands-On