Mca Syllabusfeb10

1

MCA SYLLABUS

(REVISED CREDIT SYSTEM 2007 ONWARDS)REVISED IN FEB 2010

MCA- FIRST SEMESTER

MAT MCA 501.1 - ACCOUNTING & FINANCIAL MANAGEMENT

Credit [4 0 0 4]

1. Financial Accounting –Meaning, Objectives, Accounting concepts and conventions, importance, Journal, Ledger and Trial Balance. [10 hrs]

2. Financial Statements - Nature, importance and interpretation, Issues in determination of Income – Inventory valuation & concept of depreciation, Preparation of Financial Statements – Profit & Loss A/c and Balance Sheet of Sole Traders and Financial Statements of Corporate Entities. [12 hours]

3. Management Accounting – importance and scope, techniques or tools of Management Accounting, Ratio Analysis. Budgets – Types of Budgets including Cash Budget.

[12 hours]

4. Cost Accounting – Concept, principles, importance & scope, Cost Sheet and its analysis. [4 hours]

5. Finance – Short Term and Long Term including Working Capital. [4 hours]

6. Hands on Accounting Software [6 hours ]

Reference Books :

1. Gupta R. L. & Radhaswamy M., “Advanced Accountancy”, Volume I, Sultan Chand & Sons, New Delhi.

2. Pandey I. M., “Financial Management”, Vikas Publishing House Pvt. Ltd., New Delhi.3. Raman B. S., “Advance Accountancy”, United Publishers, Mangalore.4. Shukla & Grewal, “Advanced Accountancy”, Sultan Chand & Co., New Delhi.5. Subir Kumar Bannerjee, “Financial Management”, Sultan Chand & Co., New Delhi.6. Prasanna Chandra, “Financial Management”.7. Ratnam P. V., “Advanced Cost & Management Accounting”.

MAT MCA – 501.2 ADDITIONAL MATHEMATICS [4 0 0 4]

1. Limit and continuity – differentiation- Successive differentiation polar curves, angle between the radius vector and the tangent at a point in the curve. Indeterminate forms, Hospital’s rule. Partial differentiation.

[13 hours]

2. Integration of rational – irrational-exponential logarithmic functions, reduction formula – definate integrals and properties.

[8 hours]

2

3. Radian measure, Trigonometric ratios and relation between them, simple identities. Allied angles (90/C 180/C etc) angles ratio of A/Z, 2A, 3A (no derivation)

[5 hours]

4. Complex numbers –D’movier’s theory expression for Sin / Sin n, Cosine etc. Trigonometric exponential – logarithmic and hyperbolic functions of Z = X + iY.

[5 hours]

5. Types of matrices, Inverse of square matrices, rank, Binomial, exponential and logarithmic series, simple problems.

[5 hours]

6. Differential equations, I order I degree (Variables separable, homogenous, non homogenous, linear Bernoulli Exact equations), linear equations with constant coefficients (Higher order).

[12 hours]

Text books:1. Shanthinarayan, “Integral Calculus”, 2ND Edn, ,Shyam Trust Publication,19702. Shanthinarayan, “ Differential Calculus”, 3rd Edition, Shyam Trust Publication,19703. B. S. Grewal, “ Higher Engineering Mathematics”, 35th Edn.,Khanna Publishers 2005.

MAT-MCA - 503 PROBABILITY, STATISTICS AND QUEUING [4 0 0 4]

1. Probability: Definition sample space, properties of probability, chain rule, independent events, total probability, Baye's theorem. Random Variables - one dimensional and two dimensional: mean, variance and correlation coefficient, curve fitting, Regression lines, Distributions: Binomial, Poisson, normal, Uniform, Chi-square- applications.

[24 hours]2. Moment generating function. Function of random variables, Sampling theory and

central limit – theorem - applications. [10 hours]

3. Point estimation, Interval Estimation, Test of Hypothesis- certain best tests.

[10 hours]

4. Introduction to queuing systems. [4 hours]

Reference Books:

1. K.S.Trivedi “Probability, Statistics with reliability, queuing and computer Sc. Application”. 8th edition,.PHI of Indian, 1988.

3

2. P.L.Meyer “Introduction to probability”, 5th edition, 19783. Papoulis, “Probability, Random Variables and Stochastic Process, 5 th Edn. McGraw

Hill, 1991.4. Hogg and Craig, “Introduction to Mathematical Statistics”, 5 th edition, Maxwell

Macmillans, 1989..

MCA 501 COMPUTER ORGANIZATION AND ARCHITECTURE[4 0 0 4]

1. Basic Structure of computer hardware and software: Functional units, basic operational concepts, bus structures, software, performance.

[4 hours]2. Addressing Methods And Machine Programming Sequencing:

Basic concepts: Memory locations, addresses, encoding information, main memory operations, instruction execution and straight line sequencing, branching, addressing modes, assembler commands, assembly and execution of programs, number notation,

basic input output operations, stack and queues, subroutine, parameter passing. [8 hours]

Case Study:The Intel 8086 : Registers and addressing, instructions, assembly language, condition codes, Branching instructions, programming. Example logic instruction , program controlled I/O stack and subroutine. [4 hours ]

3. The Processing Unit

Some fundamental concepts, execution of a complete instruction, hardwired control, performance consideration s micro-programmed control. [6 hours]

4. Input Output OrganizationAccessing I/O devices, interrupts, interrupt structures, Direct Memory Access, I/O Hardware standard I/O interface [6 hours]

5. The memorySome basic concepts, semiconductor RAM memories, read only memories, cache memories, virtual memory, memory management requirements [6 hours]

6. ArithmeticNumber representations, addition of positive numbers, design of fast adders, signed addition and subtraction , Arithmetic and branching condition, multiplication of positive numbers, signed operational multiplication , booths algorithm, fast multiplication, integer division, floating point operations. [8 hours]

7. Fundamental of Parallel ProcessingIntroduction, parallelism in conventional computers, general classification of computer architecture, Array processors: systolic arrays and wave front array processors ,pipeline processing: Basic concepts, Arithmetic , pipelines, multiprocessors: Single bus ,

multibus, cross bar, multiport memory. [6 hours]

4

Text Book:1. V.Carl HAMACHER, ZVOAKO G VRANESIC AND S.G. ZAKY, “Computer organization”, 4th edition mcgrawhill international edition

Reference Books:1. Rafiquzzaman and Chandra , “Modern computer architecture”, Galgotia Publications 2000.2. Willaiam Stallings, “Computer Organization and Architecture”, 5 th edition Pearson education.3. Douglas V. Hall “Microprocessor and Interfacing Programming and hardware”,Tata McGrawHill.

MCA-503 C PROGRAMMING CONCEPTS & COMPUTATIONAL TECHNIQUES

[4 0 0 4]A. PROGRAMMING IN C

1. Fundamental concepts of programming : Basic concepts of programming algorithms , Flow charts and best practices in programming [3 hours]

2. Introduction to programming in C : The C character set, identifiers, constants, variables and keywords, Arithmetic operators, Relational and logical operators, Type conversions, Increment and Decrement operators, Bit wise operators, Assignment operators and expressions, conditional operator, precedence and order of evaluation of operators. [3 hours]

3. Control flow : Statements and blocks, If-Else, Else-If, Switch statement, Loops-While, For and Do-while, Break and continue statement, Goto and labels [4 hours]

4. Functions and Program structure: Basics of functions, passing values between functions, scope rules, Function declaration and prototypes, call by value and call by reference, Recursive functions

[4hours]5. Arrays and Pointers : Pointers and address, Pointers and Function arguments, address arithmetic, pointers and arrays, Array initialization, Bounds checking, passing array elements to a function, passing an entire array elements to a function, passing an entire array to a function, Two dimensional arrays, memory map of two dimensional arrays, Multidimensional array, Array of pointers, Dynamic array. [10 hours]

6. Structure and unions: Basics of structures, structure and functions, Arrays of structure, pointers to structures, typedef, Unions, Bit fields. [4 hours]

5

7. Storage classes and preprocessor: Automatic, Register, static and External storage classes, Features of C preprocessor, Macro expansion, Macro with arguments, Macro verses functions, File inclusion, Conditional compilation. [5 hours]

8. Input /Output in C : Console Input / Output functions, Disk Input/output functions, File Handling - creating, Modifying and Deleting files (use of fscanf( ),fprintf( ), fread( ), fwrite( ), functions). [4 hours]

B. COMPUTATIONAL TECHNIQUES

1. Solution of Algebraic and Transcendental equations :a) Bisection Methodb) Newton-Raphson Method. [2 hours]

2. Matrices and Linear System of Equations:a) Gaussian Elimination Method b) Gauss Jordan Methodc) Method of Factorization (LU Method)d) Gauss Seidel Method [4 hours]

3. Numerical Integration:a) Simpson’s – 1/3 Ruleb) Simpson’s - 3/8 Rule [1 hour]

4. Interpolation:a) Newton’s Forward Interpolation Formulab) Newton’s Backward Interpolation Formulac) Newton’s Divided Difference Method [2 hours]

5. Differential Equation:a) Modified Euler’s Methodb) Runge-Kutta 2nd order Methodc) Runge-Kutta 4th order Method [2 hours]

Reference Books :

1. Brain W Keringhan and Dennis M Ritchie, “The C Programming Language” 2nd

edition, Eastern Economy Edition.2. Yeshavant Kanetkar, “Let Us C ”, Seven Revised Edition, BPB Publications,2006.3. S.S. Shastry, “Numerical Analysis”. 4. E. V. Krishamurthy & S.K. Sen, “Numerical Algorithms – Computations in Science & Engineering ”, Affiliated East West Press .

6

MCA 505 OPERATING SYSTEMS [4 0 0 4]1. Introduction : Simple batch systems, multiprogrammed batch systems, distributed systems, time-sharing & real time systems, hardware protection.

[3 hours]

2. CPU Scheduling : Process concept, process state transitions, process control block, operations on processes, inter process communication, scheduling criteria, scheduling algorithms, multilevel feed back queues. [5 hours]

3. Concurrent Process : Mutual exclusion, Precedence graphs, critical section, Dekker’s algorithm, hardware solution to mutual exclusion, semaphores, process synchronization with semaphores.

[11 hours]

4. Memory Management : Address binding, dynamic loading, dynamic linking, Overlays, swapping, contiguous allocation, paging, segmentation, segmentation with paging.

[5 hours]5. Virtual Memory : Demand paging, page replacement algorithms, thrashing, Algorithms thrashing

[6 hours] 6. Deadlocks : Deadlock characterization, resource allocation graph, deadlock prevention, deadlock avoidance, deadlock detection, bakers algorithm and recovery from deadlock.

[8 hours]7. File Systems : Free space management, allocation methods, Directory structure, Disk scheduling methods.

[4 hours]8. The Unix operating System : Design principles programming and user interface, file systems. Process Management, I.O. systems, inter-Process communication. [3hours]

9. Linux system : Design principles, Kernel modules, Process Management, Scheduling, Memory management, File Systems, Interprocess communication, network structure.

[3 hours]Text Books:

1. A Silberschartz and Galvin “Operating Systems Concepts “, 5 th edition, Addison Wesley,2002.

Reference Books:

7

1. H.M.Deitel, “An Introduction to Operating Systems”, 5th edition , Addison Wesley,1999.

2. Milan Milankovic, “ Operating systems Concepts and Design”, 7th edition, Tata McGraw Hll.

MCA-507 C PROGRAMMING LAB [0 0 6 2]

Students will solve the problems given in the lab using C as a programming language. Also they will solve problems related to computational techniques.

MCA-509 OPERATING SYSTEM LAB[0 0 3 1]

In this lab students are exposed to Linux Operating System. Initially they will be learning some of the frequently used commands. Then they will learn how to write and execute shell scripts. They will also learn how to create a process using fork system call, and also how to perform inter-process communication between related process using unnamed pipe.

SECOND SEMESTER

MAT MCA -502 DISCRETE MATHEMATICS [4 0 0 4]

Statements and notations connectives, normal forms, well formed formulas, implications Tautology, Predicate calculus.

[10 hours]

Set and subsets, Operations on sets, Principle of Inclusion and Exclusion, Piano axioms and Mathematics Induction, Generating Functions, Recurrence relations.

[10 hours]

Product sets and partitions, Relations, Properties of relations, Equivalence of relations, manipulation of relations.

[8 hours]

Functions, The pigeonhole principle Permutations and Combinations, Combinatorics – simple counting techniques. [5 hours]

Partially ordered sets (Posets), External Elements of Posets, Lattices.Binary operations, semi – groups – Product and Quotients, Groups – Products and quotients coding, decoding, Error detection and correction. [15 hours]

Reference Books:

8

1. J.P. Tremblay and R.Manohar, “ Discrete Mathematical Structures with Applications to Computer Sc”, 5th edition, McGraw Hill, 1987.

2. B.Kolman and R.C.Busby, “Discrete Mathematical Structures for Computer Sc.” 2nd

Edition, Prentice Hall of India, 1988 (Chapters 1,2,3,4,5, 6 and 8).3. C.L.Liu, “Elements of Discrete Mathematics”5th edition , McGraw Hill NY, 1977.

Olympia Nicodemi, “Discrete Mathematics”, 2nd edition, CBSPD, 1989.

MCA-502 OBJECT ORIENTED PROGRAMMING & DESIGN[4 0 0 4]

PART A

1. Introduction: What is object oriented? Characteristics of objects, Object oriented Themes.

[2 hours]

2. Modelling: Importance of modeling, Four principles of modelling, The essential blue prints of a software system, Object Oriented Modelling, Introduction to UML. [3 hours]

3. Basic Structural Modelling: Classes, Attributes, Operations, Relationships, Dependency, Generalization, Association, Role, Multiplicity, Aggregation, Notes, Stereotypes, Tagged Values, Constraints, Structural Diagrams, Behavioral Diagrams, Class Diagrams, Advanced Classes, Classifiers, Visibility, Advanced Relationships, Packages, Visibility, Importing & Exporting, Instances, Object Diagrams, Links.

[6 hours]

4. Basic Behavioral Modelling: Objects and Roles, Links, Messages, Sequencing, Use cases, Actors, Use case Diagrams, Collaboration Diagrams, Activity Diagrams, Action States and Activity States, State Machines, States, Transitions, Substates.

[5 hours]

Text Book: 1. Grady Booch, James Rumbaugh, Ivar Jacobson, “ The Unified Modelling Language User Guide”, Addison Wesley.

Section 1: Chapters 1,2Section 2: Chapters 4 to 8Section 3: Chapters 9,10,12,13,14Section 4: Chapters 15 to 21

PART B

1. Programming Basics: Basic programming construction, Output using cout, Processor directive, Comments, Integer variables, Character variables, Input with cin, Type float, Manipulators, Variable type summary, Type conversion, Arithmetic operators, Library functions.

[2 hours]2. Loops & Decision: Relational operators, Loops, Decisions, Logical operators, Precedence

9

summary, Other control statements.

[1 hour]

3. Structures: Structures, Enumerated Data Types. [2 hours]

4. Functions: Simple functions, Passing arguments to functions, Returning values from the functions, Reference arguments, Overloaded functions, Inline functions, Default arguments,Variables and storage classes, Returning by reference.

[3 hours]

5. Objects and Classes: A simple class, C++ objects as physical objects, C++ objects as data types, Constructors, Objects as function arguments, Returning objects from functions, Structures and Classes, Classes, Objects and memory, Static class Data.

[4 hours]

6. Arrays: Array fundamentals, Arrays as class member data, Arrays of objects, String handling.

[2 hours]

7. Operator Overloading: Overloading Unary operators, Overloading Binary operators, Data conversion.

[4 hours]

8. Inheritance: Derived classes and Base classes, Derived class constructors, Overriding member functions, Class hierarchies, Public and Private inheritance, Levels of inheritance, Multiple inheritance, Ambiguity in multiple inheritance, Containership, Classes within classes, Inheritance and program development.

[4 hours]

9. Pointers: Addresses and pointers, Pointers and arrays, Pointers and functions, Pointers and strings, Memory management using new and delete, Pointers to objects, A linked list example, Pointers to pointers.

[3 hours]

10. Virtual Functions: Virtual functions, Friend functions, Static functions, this pointer.[2 hours]

11. Files and Streams: Streams, String I/O, Character I/O, Object I/O, File pointers, Command line arguments.

[3 hours]

12. Other Advanced Concepts: Generic programming with Templates, Exception Handling.[2 hours]

Text Book:

10

1. Robert Lafore, “Object Oriented Programming in Turbo C++”,Galgotia Publications Pvt Ltd.

Chapters: 3 to 10, 12, 13, and 14

Reference Book: 1. K R Venugopal, Rajkumar, T Ravishankar, “Mastering C++”,Tata McGraw Hill

Publishing Company Ltd.,2005

MCA-504 DATA STRUCTURES [4 0 0 4]

1. Characteristics of an algorithmAlgorithm specification, Performance analysis – space complexity, Time complexity, Asymptotic notations, Practical complexities. [Chapter 1 of Text Book 1] [4 hours]

2. Arrays and Strings The array as an Abstract Data Type, The Sparse Matrix Abstract Data Type (additions only), The Representations of Multidimensional Arrays, The String Abstract Data Type – Pattern Matching. [Chapter 2.1, 2.4, 2.5, 2.6 of Text Book 1] [5 hours]

3. Stacks and QueuesThe Stack Abstract Data Type, The Queue Abstract Data Type, Evaluation of Expressions, Multiple Stacks and Queues [Chapter 3 of Text Book 1] [6 hours]

4. ListsPointers, Singly Linked Lists, Dynamically Linked Stacks and Queues, Polynomials, Additional List Operations, Doubly Linked Lists [Chapter 4 of Text Book 1] [8 hours]

5. TreesIntroduction, Binary Trees, Binary Tree Traversals, Threaded Binary Trees, Binary Search Trees- Deletion and Insertion, Heaps [ Chapter 5 of Text Book 1]Expression Trees [ Chapter 4.2.2 of Text Book 2] [10 hours]

6. GraphsThe Graph Abstract Data Type – Definition and Representations, Elementary Graph operations - Depth First Search and Breadth First Search[Chapter 6.1, 6.2.1,6.2.2 of Text Book 1] [5 hours]

7. Sorting and SearchingSequential Search, Binary Search, Insertion sort, Selection sort, Quick sort, Merge sort, Heap sort, Radix sort.[ Chapter 7 Of Text Book1] [8 hours]

8. Hashing

11

Hash Function, Open Hashing, Closed Hashing.[Chapter 5 of Text Book 2] [2 hours]

Text Books:1 Ellis Horowitz, Sartaj Sahni , “Fundamentals of Data Structures in C” .2. Mark Allen Weiss, “Data Structures And Algorithm Analysis in C”

HUM MCA-506 COMMUNICATION & MANAGEMENT[4 0 0 4]

Part A – Communications

1. Common errors in English [2 hours]

2. Official letters [2 hours]

3. Report writing [4 hours]

4. Reading comprehension [4 hours]

5. Vocabulary Building Exercises(i) Synonyms & Antonyms(ii) One word substitutes(iii) Commonly confused pairs of words(iv) Idiomatic expression(v) Paragraph writing

[10 hours]6. Quotations & Sayings [2 hours]

Part B – Management

1. Definition of Management : Its nature and purpose, the system approach to operational Management. The function of Managers, planning – planning process and control, mission, vision, policy and strategic goal setting

[8 hours]

2. Interpersonal and group processes, interpersonal trust, understanding the other person from his/her point of view, interpersonal communication, listening, feedback,

[6 hours]

3. Counseling, transactional analysis, leadership, motivating people, working as a member of a team, functioning, team decision making, team conflict resolution, team problem solving. Tools for problem solving and improvement.

[10 hours]

Reference Books :

12

1. Arnold, John, Robertson, Ivan T and Cooper, Cary L., “work Psychology: Understanding Human Behavioring the workplace”, MacMillan India Ltd., Delhi, 1996.

2. Schermerlism, Hunt and Osbosn, “Managing Organisational Behavior”, John Willey and Sons, USA 1982.

3. Ludlow R. and Panatron F.,”The Essence of Effective Communication”, Prentice Hall of India Pvt. Ltd., 1995.

4. Menzel D.H.Jones, H.M.Boyd L.G., “Writing Technical paper”, McGRaw Hill 1961.5. Mumer M., “Business Communication Strategy and Skill”, Prentice Hall, New Jersy,

1987.

MCA-508 COMPUTER NETWORKS [4 0 0 4]

1. Introduction To Computer Networks : Definition, Uses, Classification of Networks, Network topology and Topography

[4 hours]

2. Layered Architecture: Layers, Protocols and Services. ISO/OSI Reference Model, Overview of TCP/IP architecture, Application Protocols and TCP/IP utilities.

[6 hours]

3. Review of Data Communications : Signals, Line coding, Interfacing, Framing, Error control, Flow control, HDLC Protocol, Switching.

[10 hours]

4. Media Access Sublayer and LANS: Approaches to sharing transmission Medium, Random Access Protocols, Token Passing protocols, IEEE LAN Standards, Bridges, MAN(IEEE 802.6).

[8 hours]

5. Network Layer: Internal Organization of NL, Routing Algorithms, Congestion control algorithms .

[10 hours]

6. TCP/IP Protocol Suite: IP Packet, IP Addressing, ARP& RARP, TCP, UDP, IP, DHCP and BOOTP, DNS, TELNET and Rlogin, SNMP. [10 hours]

Text Books: 1. Andrew S. Tanenbaum, “Cmputer Networks”, 4th Edition, Prentice Hall India 1999.

2. Leon-Garcia and Widjaja, “Communication Networks”, Tata McGraw-Hill, 2000 3.

Behrouz A. Forouzan, “TCP/IP Protocol Suite”, Tata McGraw-Hill, 2000

13

MCA-510 DATA STRUCTURE LAB [0 0 6 2]

Students will implement data structure concepts like stack, queue, linked list, trees, etc., using C as a programming language.

MCA-512 OBJECT ORIENTED SYSTEMS LAB[0 1 3 2]

Students will be solving the problems given in the lab using object oriented concepts, using C++ as a programming language.

THIRD SEMESTER

MCA-511 SYSTEMS PROGRAMMING & MICROPROCESSORSPART A

[4 0 0 4]1. Introduction :

Language Processors, assemblers, loaders, macros, linkers and compilers.

[2 hours]

2. Lexical analysis Scanning, recognition of tokens, symbol tables, LEX programming [6 hours]

3. Syntax analysis Parse trees, Top Down Parsing, Backtracking, Recursive decent parsers, LL(1) parsers, Bottom Up Parsing, LR parsers, error recovery strategies, YACC programming.

[12 hours]

4. Code generation Issues in the design of a code generator, The target machine, run-time storage management, Register allocation and assignment, Peephole optimization, a simple code generation algorithm.

[6 hours]5. Code optimization The principal sources of optimization, Optimization of basic blocks, Data-flow analysis, flow graphs. [6 hrs]

PART B

1. 8086 Family Assembly Language Programming – Introduction: Program development steps. Constructing the machine codes for 8086 instructions. Writing programs for use with an assembler. Assembly language program development tools.

[4 hours]2. Implementing Standard Program Structure in 8086 Assembly Language: Simple

sequence programs. Jumps, Flags and conditional jumps. If-then, if-then-else and multiple

14

if-then-else programs. While-do programs. Repeat-until programs, Instruction timing and delay loops. Different addressing modes.

[6 hours]

3. Strings, Procedures and Macros: The 8086 string instructions and solving problems using these string instructions, Writing & using procedures, Writing & using assembler macros.

[6 hours]

Text Books:

1. Alfred V. Aho, Ravi Sethi, Jeffrey D. Ullman, “ Compilers, Principles, Techniques and Tools”, Pearson Education Asia.

2. Dhamdhere D.M, “Systems Programming and Operarting Systems”, Tata McGraw-Hill, Second revised edition

3. Douglas V. Hall “Microprocessor and Interfacing Programming and hardware”,Tata McGrawHill

Reference books :1. Donovan J.J., “Systems Programming”, McGraw Hill, 19722. Barron D.W., “ Assemblers and Loaders”, McDonald and Javes, 1978.4. Ullman J.D., “Fundamental Concepts of Programming Systems”, Addision

Wesley, 1976.5. Aho A.V. & Ullman J.D., “Principles of Compiler Design”, Addison-Wesley,

1985.

MCA-513 JAVA PROGRAMMING [4 0 0 4]

1. Introduction: The birth of modern programming language C, the need for C++, Java, Importance of Java in the internet, Java applets and applications, security, portability, the byte code. An overview of Java, OOP, Two paradigms, abstraction, the three OOP Principles.

[2 hours]2. Data Types, Variable and arrays: Simple types, integers, floating point types,

characters, Booleans, variables – declaring variable, dynamic initialization, the scope and life time of variables, type conversion and casting, arrays-one dimensional arrays and multi dimensional arrays.

[2 hours]

3. Operators and control statements: Arithmetic operators, bitwise operators, relational operators, logical operators, assignment operators, ternary operators, operator precedence. Control statements – if, switch, while, do-while, for nested loops, break, continue. All with examples.

[3 hours]

4. Classes and Inheritance: Class fundamentals, declaring objects, assigning object references variables, introducing methods, constructors, overloading method, using

15

objects as parameters, argument passing, returning objects, recursion, use of static and final key word, nested and inner class, using command line arguments. Inheritance – basics, using super, creating a multi level hierarchy, when constructor are called, method overriding, dynamic method dispatch, using abstract classes, using final with inheritance.

[5 hours]

5. Packages and Interfaces: packages, defining a package, use of CLSSPATH, package example, access protection, importing packages, Interfaces – defining an interface, implementing interfaces, applying interfaces, variables in interfaces, extending interfaces.

[3 hours]

6. Exception Handling: Fundamentals, exception types, uncaught exception, using try and catch, multiple catch clauses, nested try statements, throw, throws, finally, Java’s built in exception, creating exception subclasses, using exception.

[4 hours]

7. Multi Threaded programming: The java thread model, thread priorities, synchronization, thread class and runnable interface, the main thread, creating a thread, creating multiple threads, using is Alive() and join(), inter thread communication, suspending, resuming and stopping threads.

[5 hours]8. String Handling: String constructors, string length, special operations, character

extraction, string comparison, searching strings, modifying a string, string buffer.[4 hours]

9. Input/Output: Java I/O classes and Interfaces, File – direction, using filename filter, the stream classes, the byte streams, input stream, output stream, file input stream, file output stream, byte array in put stream, byte array output stream, random access files. The character streams: Reader, Writer, FileReader, FileWriter, char ArrayReader, CharArrayWriter, BufferReader, BufferWriter. Serialization, Serialiabel, Externalizable, Object Output, Object Output Stream, Object Input, Object Input Stream.

[6 hours]10. Networking : Stacking data with Address and ports, What is an address? From network

to internetwork, the TCP/IP stack, URL operations, basic URL manipulation, encoding the URL sting, URL connection operation, the incoming header, Sockets – finding an address, setting up simple socket server, sending from a simple socket client, RMI operations – the package, the interface, the implementation, the stubs and the skeleton, starting the registry, starting the server.

[6 hours]

11. JDBC : Java API for database connectivity, introduction to JDBC, connection to a remote database, performing database queries and updates, the JDBC API, advanced techniques.

[4 hours]

12. RMI & CORBA: Introduction and overview of RMI & COBRA, implementing RMI & COBRA in java- one simple example for each.

[4 hours]Reference Books:

16

1. Patrick Naughton and Herbert Schildt, “The Complete Reference – Java 2”, 7 th

Edition,2nd Reprint, Tata McGrawHill,2007Aaron Walsh and John Fronckowiak, “ Java Programming Bible”, IDG Books India, 2000 Edition

MCA-515 DESIGN & ANALYSIS OF ALGORITHMS[ 4 0 0 4]

1. Introduction: Program Performance: Space and Time complexity, Asymptotic Notations; Practical Complexities and Performance Measurement.

[5 hours]

2. Graphs: Definitions; Applications; Properties: The ADTs Graph & Digraph; Representation of graphs & Digraphs ; Graph search Methods – Breadth First Search, Depth-First Search, Applications – Finding a path, connected Graphs & Components, spanning trees.

[5 hours]3. The Greedy Method:Optimization problems: The greedy method; Applications – container loading, 0/1 Knapsack problem, Topological sorting, Bipartite cover, Single-Source Shortest paths, Minimum cost spanning Trees – Kruskal’s Algorithm, Prim’s Algorithm, Sollin’s Algorithm.

[10 hours]4. Divide and Conquer:Divide and Conquer Method: Minimum and Maximum, Strassen’s matrix multiply; Applications – Merge Sort, Quick sort, selection, Closest pair of points; Solving Recurrence Equations, Lower Bounds on Complexities.

[10 hours]5. Dynamic Programming :Dynamic Programming Method: Applications – 0/1 Knapsack problem, Matrix Multiplication Chains, All pairs shortest paths.

[5 hours]

6. Backtracking and Branch and Bound :Backtracking Method: Applications – 0/1 Knapsack problem, Max clique, Travelling salesperson, Container Loading.Branch and Bound Method: Applications – 0/1 Knapsack problem, Max clique, Travelling salesperson, Container loading.

[9 hours]

7. NP-Completeness and Approximation Algorithms :Polynomial Time and verification, NP-Completeness and Reducibility, Approximate Algorithms for the Vertex-cover problem and the traveling salesperson problem.

[4 hours]Reference Books:

1. Sartaj Sahni “ Data Structures, Algorithms and Applications in C++”, McGraw- Hill 2000. (Chapters 2, 12, 13, 14, 15, 16, 17)

17

2. Thomas H Cormen, Charles E Leiserson & Ronald L Rivest, “Introduction to Algorithms”. Prentice – Hall India, 1988.(Chapters 36.1, 36.2, 36.3, 37.1, 37.2)

MCA-517 SOFTWARE ENGINEERING [ 4 0 0 4]

1. Introduction to software engineering : Software and software engineering, phases in software development, software development process models, role of management in software development, role of metrics and measurement.

[6 hours]

2. Software requirement specifications : Role of SRS, problem analysis, requirement specification, validation, metrics, monitoring and control.

[6 hours]3. Planning a software project : Cost estimation, project scheduling, staffing, personal planning, team structures, SCM, quality assurance plans, project monitoring plans, risk management.

[8 hours]4. System design : Design objectives, design principles, module level concepts, design methodology, structured design, design specifications, verification metrics, monitoring and control.

[12 hours]5. Detailed design : Module specification, detailed design and process design language, verification.

[6 hours]

6. Coding : Programming practice, verification, metrics.

[4 hours]7. Testing : Testing fundamentals, functional testing, structural testing, testing process, comparison of different V & V techniques.

[6 hours]Text Book :

1. Pankaj Jalote “An Integrated Approach to Software Engineering”, II Edition,BPB Publications 2005Reference book :1. Roger S Pressman “Software Engineering-A Practitioners approach ”, III Edition, McGraw hill

MCA-519 DATABASE MANAGEMENT SYSTEM [4 0 0 4]

18

1. Introduction: Database System Applications, Database systems versus file system, View of Data, Data Models, Database Languages, Database users and administrators, transaction management, Database system structure, Applications Architecture.

[4 hours]

2. Entity-Relationship Model: Basic Concepts, Constraints, Keys, Design Issues, ER Diagram, Weak Entity Sets, Extended ER features, design of ER database schema, reduction of ER to schema.

[6 hours]

3. Relational Model: Structure of relational databases, Relational algebra, Extended relational algebra operations, Modification of Database, Views, tuple relational calculus, domain relational calculus.

[6 hours]

4. SQL: Basic structure, set operations, aggregate functions, null values, nested sub queries, views, complex queries, modification of Database, joined relations, data definition language, embedded SQL, dynamic SQL, Query by example.

[4 hours]

5. Integrity and security: Domain constraint, referential integrity, assertions, triggers, security and authorization, authorizations in SQL, encryption and authentication.

[6 hours]

6. Relational Database Design: First Normal Form, 2nd Normal Form, pitfalls in relational database design, functional dependencies, decomposition, desirable properties of decomposition, Boyce-Codd Normal form, 3rd normal form, 4th normal form.

[6 hours]

7. Object Oriented Databases: need for complex data types, object oriented data model, object oriented languages, persistent programming language.

[2 hours]

8. Object-Relational Databases: nested relations, complex types, inheritance, reference types, querying with complex types, functions and procedures, object-oriented versus object-relational.

[3 hours]

9. Storage and File structure: overview of physical storage media, magnetic disks, RAID, tertiary storage, storage access, file organization, organization of records in files, data-dictionary storage, storage for object-oriented databases.

[4 hours]10. Indexing and Hashing: basic concepts, ordered indices, B+-tree index files, B-tree index

files, static hashing, dynamic hashing, comparison of ordered indexing and hashing, index definition in SQL, Multiple key access.

[4 hours]

11. Query Processing: overview, measure of query cost, selection operation, sorting, join operation, other operations, evaluation of expression. [ 3 hours]

19

Text Book: 1. Henry F Korth, Abraham Silberschatz and Sudarshan, “Database System Concepts”, 4 th

Edition, Tata McGraw Hill Reference Books:1. Elamasri, Navathe, “Fundamentals of Database System”, 2nd Edition, Addison Wesley

Publications Co.2. C. J. Date, “An introduction to Database Systems”, 6th Edition, The system Programming

Series.

MCA-521 SYSTEMS PROGRAMMING & MICROPROCESSORS LAB[0 0 3 1]

Students will be implementing the concepts of System Programming using C as a programming language, lex & yacc in Linux environment. Assembly language programming using 8086 assembler.

MCA-523 JAVA & NETWORK LAB [0 1 3 2]

The concepts of InetAddress class, TCP/IP Client and Server sockets, caching proxy HTTP server, Datagram Sockets will be discussed. Students have to solve set of problems which will give in depth insight into the networking in Java.

References:Java 2: The Complete Reference by Patrick Naughton and Herbert Schildt ISBN: 0072119764

MCA-525 DATABASE MANGEMENT SYSTEMS LAB [0 1 3 2]

Students will be implementing the concepts studied in DataBase Management System and developing a miniproject based on DBMS.

FOURTH SEMESTER

MCA-514 ADVANCED DATABASE CONCEPTS

[4 0 0 4]

1. Query Processing : Overview, measure of query cost, selection operation, sorting, joining operation, other operations, evaluation of expressions.

[11 hours]

2. Query Optimization : Overview, estimating statistics of expression results, transformation of relational expression, choice of evaluation plans, materialized views.

[3 hours]

20

3. Transactions : Transaction concepts, transaction state, implementation of atomicity and durability, concurrent execution, serializability, recoverability, implementation of isolation, transaction definition in SQL, testing for serializability.

[6 hours]

4. Concurrency Control : Lock based protocols, timestamp based protocols, validation based protocols, multiple granularity, multiversion schemes, deadlock handling, insert and delete operation, weak levels of consistency, concurrency in index structure.

[4 hours]

5. Recovery System : Failure classification, storage structure, recovery and atomicity, log based recovery, shadow paging, recovery with concurrent transaction, buffer management, failure with loss of non-volatile storage, advanced recovery techniques, remote backup system.

[6 hours]

6. Database system architecture : centralized and client-server architecture, server system architecture, parallel system, distributed system, network types.

[2 hours]

7. Distributed databases : Homogeneous and heterogeneous databases, distributed and data storage, distributed transactions, commit protocols, concurrency control in distributed databases, availability, distributed query processing, heterogeneous distributed databases, directory system.

[5 hours]

8. Parallel databases : introduction, I/O parallelism, interquery paralleism, intraquery parallelism, intraoperation parallelism, interoperation parallelism, design of parallel system.

[7 hours]

9. Advanced Query and information retrieval : decision support system, data analysis and OLAP, data mining, data warehousing.

[2 hours]

10. Advanced Data types and new applications : motivation, time in databases, spatial and geographical data, multimedia databases, mobility and personal databases.

[ 1 hour]

11. Advance transaction processing : transaction processing monitors, transaction overflow, main memory databases, real time transaction system, long duration transaction, transaction management in multi data bases.

[1 hour]Text Books: 1. Silberschatz, Korth and Sudarshan “Database System Concepts “, 4 th Edition,

McGraw Hill,2002.2. Ricardo Baeza Yates, Berthier Ribeiro Neto, “Modern Information Retrieval”, 3 rd

Edition, Addison Wesley,2000.

21

MCA-516 UNIX NETWORK PROGRAMMING [4 0 0 4]

1. Introduction: History, Layering, OSI Model, Processes, client-server Model. [6 hours]

2. Communication Protocols : TCP/UDP : Process to Process Communication, UDP operation, UDP Package, TCP services, TCP features, A TCP connection, State Transition Diagram, Congestion control, TCP Timers, TCP Packages, ICMP & IGMP.

[10 hours]

3. Inter process Communication: Introduction, File and Record Locking, A simple client-server Example, pipe, FIFOs, Streams and Messages, Message queues, Semaphores, shared memory. (POSIX)

[8 hours]

4. Berkely Sockets: Introduction, Overview, Unix Domain Protocol, Socket addresses, Elementary socket system call, A simple example, Advanced socket system calls, Reserved ports, socket options, Asynchronous I/O, Signals, Daemon process, Internet super server, Socket Implementations.

[10 hours]

5. Applications : Raw Sockets, Ping and Traceroute Applications Raw Sockets [6 hours]

6. Multicasting : Introduction, Multicasting in LANs and WANs [6 hours]

Text Book:1. W. Richard Stevens,” Unix Network Programming”, Prentice Hall of India Private

Limited, 2001.2. Forouzan, “TCP/IP, Protocol Suite”3. Richard Stevens, Bill fenner, Andrew M Rudiff,” Unix Network Programming”,3rd

edition, Pearson Education

MCA-518 WEB ENGINEERING[4 0 0 4]

1. Applets: Introduction, local and Remote Applets, How Applets differ from Applications, preparing to write Applets, Building Applet code, Applet life cycle, Creating an executable Applet, Designing a web page, Applet tag, Adding Applet to HTML files, Running the Applet.

[12 hours]

2. AWT Controls and programming: More about Applet tag, Passing parameters , Awt controls, Frames, windows, panels, simulation programs, layout.

[12 hours]

22

3. Introduction to HTML: The set of 150 tags, block level and text level tags ,images and image maps Client side, Server side maps, anchor elements tables, frames forms.

[6 hours]

4. Introduction to DHTML: Cascading style sheets, DOM, Scripting, ActiveX pad with embedded active controls.

[4 hours]

5. Introduction to VBScript: Example programs and some client side validation

[4 hours]

6. Introduction to Javascript: Example programs and some client side validation

[4 hours]

7. Introduction to XML : What’s wrong with HTML, The SML solution, Hello World, Displaying XML content , XML editors.

[2 hours]

8. XML Basics: Tag format, The XML declaration, Elements, Element attributes, Empty

elements, Comments, Character entities, CDATA blocks. [2 hours]

9. Processing forms: CGI ,submit, Get and Post methods

[2 hours]

Text Books:1 Herbert Schildt “Complete reference Java 2”, 5th Edition, Tata Mac Graw Hill,2006. 2 Stever Holzner “Java 2, Swing, Servlets, JDBC & Java Beans Programming – Black Book” – 2000 (Ch. 6-10) Dream Tech. Press. 3. Mike McGrath, “XML in easy steps”, Dreamtech Press, 2002. 4. “HTML Complete reference”,Techmedia 2001.

Reference Books:1. Sandra E.Eddy & John E. Schnyder, “Teach Yourself XML”, IDG, 20002 Simon North, Paul Herman,” Sams Teach yourself XML in 21 days” , Techmedia, 1999.

MCA-520 ELECTIVE– I[3 0 0 3]

MCA-520.1 SYSTEM SIMULATION & MODELING

1. System Models: the concepts of a systems, system environment, stochastic activities, continuous and discrete system, system modeling, types of models, static physical model, dynamic physical model, static mathematical model, dynamic mathematical model, principle used in modeling, subsystem, a corporate model environment segment, production segment, management segment, a full corporate model. (Ref: 1.1 to 1.11, 2.1

23

and 2.6 in Gordon) [3 hours]

2. Introduction to simulation: when simulation is an appropriate tool? , advantages and disadvantages of simulation, areas of applications, steps in simulation study. (Ref: 1.1. to 1.3, 1.10 in Jerry Banks)

[2 hours]

3. Simulations: pure pursuit problem, inventory problem, chemical reactor, water reservoir( Ref: 1.1, 1.3, 2.1, 2.6 and 2.9 in Deo)

[3 hours]

4. Random number generation: properties of random numbers, generation of pseudo random number, techniques of generating : linear congruential method, combined liner congruential method, combined linear congruential method, test for random numbers-frequency test, runs test, test of autocorrelation, gap test, poker test, goodness of fit test, chi-square test, che-square test with equal probabilities. (Ref: 9.41 to 9.4.2 in Jerry Banks) [6 hours]

5. Random Variate Generation: inverse transform technique-Exponential and uniform distribution, discrete distribution, acceptancy-rejection techniques, Poisson and Gamma Distribution. (Ref:8.1 to 8.1.1 and 8.1.2, 8.1.7, 8.4.1 and 8.4.2 in Jerry Banks)

[4 hours]

6. Queuing Models: Simulation of single server queue, two server queue and general queues. (Ref:4.2 to 4.4 in Deo)

[2 hours]

7. Discrete system simulation: fixed time and event-to-event model on simulating randomness (Ref: 3.1, 3.2 in Deo), Simulation of telephone system, delayed calls, simulation programming tasks, gathering statistic, counter and summary statistics, measuring utilization and occupancy, recording distribution and transit times. (Ref:8.4 to 8.10 in Gordon) [4 hours]

8. Verification and Validation of simulation models: Model building verification and validation of simulation models, calibration and validation of models face validity, validation of model assumption, validating input-output transformation, input-output validation: using historical input data, input-output validation: using turning test. (Ref: 10.1 to 10.3 in Jerry Banks)

[4 hours]

9. Sample programming in GPSS [8hours]

10. Factors in selection of discrete system simulation languages: SIMSCRIPT, GPSS and SIMULA

( Ref:8.6 to 8.9 in Deo) [2 hours]

Reference Books:

24

1. Geoffery Gordon , “System Simulation & Modeling” 2 nd Edition, PHI Publisher.2. Narasingh Deo, “ Discrete System Simulation”, 2nd edition, PHI Publisher3. Jerry Banks and John S. Carson II, “Discrete Event System Simulation “ - Ist Edtion, PHI Publisher.

MCA-520.3 HUMAN RESOURCE MANAGEMENT

1. LEADERSHIP-

Technical Leadership - Leader's Goal, Conviction, Vision - Transformational and Transactional Leadership - Leader's Vision - Professionalism : Importance, Elements - Managing Awareness - Performance - Manager's Role in Professionalism.

[8 hours]

2. MANAGING TECHNICAL AND PROFESSIONAL PEOPLE

Goals of Engineers and Scientists - Work Assignment - Need for Influence - Professional Career and Goals - Age and Creativity - Performance - Motivation - Employee Partnership - Career Risks - Technical Competence - Professional Discipline - Manager's Role in Professional Discipline - Guidelines. [8 hours]

3. IDENTIFICATION AND DEVELOPMENT OF TALENTED PEOPLE

Talented Professionals – Importance - Characterization - Identification – Assessment and Recognizing Talent - Development - Development Needs - Counseling. [8 hours]

4. INNOVATION

The Importance of Innovation - Risk of Failure - Nature of Creativity - Imagination - Managing Innovative Teams - Needs of Creative Teams - Team Dynamics - A Software Development Example - Manager's Responsibility - Team's Personal Needs - Political versus Technical Solutions - Team Synergism. [8 hours]

5. TEAM ENVIRONMENT AND RECOGNITION

Innovative Team Environment -Award Programs - Recognition Programs - An Example Award Plan - Industry Award Plans - Award Guidelines - Incentive Plans - A Caution on Recognition Programs [8 hours]

Text Books

1. Watts S. Humphrey, "Managing Technical People: Innovation, Teamwork, and the Software Process", Addison-Wesley, 1996.

References

1. Biswajeet Pattanayak, "Human Resource Management", Prentice Hall of India, 2002.

2. K. Aswathappa, Human Resource and Personnel Management text and cases, Tata Mc-Graw Hill publishing Co. Ltd., 2002.

25

MCA-520.4 SOFTWARE QUALITY MANAGEMENT

1. Introduction: Software Quality: Perspective and Expectations, Historical perspective of Quality, Quality frameworks, Quality Assurance as dealing with defects, Defect prevention detection and Containment strategies.

[4 hours ]2. QA Process and Quality Engineering :QA Activities in Software Processes, Verification and Validation Perspectives, Reconciling the Two Views Quality Engineering: Activities and Process Quality Planning: Goal Setting and Strategy Formation Quality Assessment and Improvement Quality Engineering in Software Processes

[8 hours ]3. Software Quality Management: Technical metrics for software: Metrics in process and project domains, Software measurement, Software quality, Framework for Technical software metrics, Metrics for analysis model, Metrics for design mode, Metrics for source code, Metrics for testing, Metrics for maintenance. [10 hours]

4.Software Configuration Management: What is software configuration management, Base lines, Software configuration items, Configuration management planning, Identification of objects in software configuration, version control, change control, configuration audit, Release management, System building, CASE tools for configuration management.

[6 hours ] 5.Computer Aided Software Engineering:

CASE, building blocks for CASE, Taxonomy of case tools, integrated case environments, the integration architecture, and the case repository. CASE tools: Management tools and methods, Development tools and methods, maintenance tools and methods, support tools and methods

[ 6 hours ]6. Making The System Operational: Program development: programming standards and procedures, programming guidelines, Documentation.Delivering the system : Training, Documentation, installation, user support.Software evaluation: Software change, importance of evolution, program evaluation dynamic

Software Maintenance: The nature of maintenance, maintenance problems, measuring maintenance characteristics, Types of maintenance, Maintenance cost, Maintenance prediction, Maintenance evaluation process, Maintenance techniques and Tools.

[ 6 hours ]

Reference Books:

1. Roger S. Pressman, Software Engineering A Practitioner’ s Approach”,4th Edition McGraw Hill Publication, 2004

2. Ian Summerville, Software Engineering – 6th / 7th edition, Pearson Education Publication, 2006

26

3. Shari Lawrence , Software Engineering Theory and practices, 2nd Edition, Pfliger, 2004.

4. Normal E Fenton, Shari Lawrence, “Software Metrics” II edition, Pfliger Thompson, 2003.

MCA-522 ELECTIVE– II [3 0 0 3]

MCA-522 .1 MOBILE COMPUTING

1. Overview of Mobile Communication: Introduction, Signals, Antennas, Multiplexing techniques, Cellular concepts [6 hours]

2. Personal Communication Service: PCS, AMPS, Cordless telephony and Low tier PCS, Mobility management, Handoff detection and assignment, Roaming and roaming management under SS7, ANSI-41, SS7 and wireless, PCS network elements, ISDN Interworking, CDPD [8 hours]

3. Mobile IP: Overview, Agent solicitation and discovery mechanisms, mobility agent operation, Mobile node registration procedures, Security, Tunneling, Encapsulation, Unicast and multicast, Routing failures and recovery, Tunnel management, Route optimization, IPv6’s mobility management support, Problems associated with TCP, Wireless TCP, Performance over TCP [4 hours]

4. GSM: GSM overview, GSM network architecture, GSM SMS, International Roaming, GSM OAM, Mobile prepaid service, Mobile number portability [4 hours]

5. Wireless LAN: WLAN technologies and application, Topologies, IEEE 802.11 standard, Bluetooth, HiperLAN [4 hours]6. 3G Wireless Networks: CDMA2000, WCDMA/UMTS-design and principle, Network architecture and protocol, 3G network design methodologies, Air interface [4 hours]

7. Mobile Computing Models: Client server models, Location management for mobile networks, Wireless location services, Application design for wireless computing, Storage alternatives, Disconnected operation in mobile computing, Strategies for query processing, Handheld computers and their OS, Case study-CODA [4 hours]

8. Ad-hoc Network: Mobile Ad-hoc networks, Routing protocols, Wireless sensor networks [4 hours]

Reference Books:1. Yi-Bing, Imrich Chlamtac, “Wireless and Mobile Networks Architectures”, John

Wiley, Kundali, India, 2001

27

2. Charles E.Perkins, “Mobile IP: Design Principles and Practices”3. Clint Smith & Daniel Collins, “3G Wireless Networks”4. William Stallings, “Mobile Communication & Networking”, Pearson Education,

Delhi, 20055. T.S Rappaport, ”Wireless Communication-Principles and Practices”, Pearson

Education, Delhi, 20056. Deitel.H, Deitel.P, Nieto T & Steinbuhler.K, “Wireless Internet & Mobile Business”,

Prentice Hall, 20017. IEEE Magazine on Wireless Communication.

MCA-522.2 ARTIFICIAL INTELLIGENCE1. Introduction : Artificial Intelligence - The AI problems, The underlying Assumption, AI Technique, The level of the Model; Problems, Problem spaces and search – Defining the problem as a state space search, Production systems, Problem characteristics, Production system characteristics, Issues in the Design of Search Programs.

[10 hours]

2. Heuristic search : Generate–and –Test, Hill climbing, Best – First search, Problem Reduction, Constraint satisfaction, Means-Ends Analysis.

[8 hours]3. Knowledge Representation : Using Predicate Logic – Representing simple facts in Logic, Representing Instance and Isa Relationships, computable functions and Predicates, Resolution. Symbolic Reasoning under uncertainty – Introduction to Nonmonotonic reasoning, Logics for Nonmonotic Reasoning; Statistical Reasoning – Probability and Baye’s Theorem; Semantic Nets, Frame, Conceptual Dependency, Scripts.

[14 hours]

4. Advanced Topics : Game Playing – The minimax search procedure, Adding Alpha-Beta Cutoffs. Planning – Overview, An example Domain : The blocks world, Components of a planning system, goal stack planning , Brief Introduction to understanding, Natural Language Processing, Learning.

[8 hours]

Text Book :1. E. Rich and Knight, “Artificial Intelligence”, second Edition, Tata McGraw Hill publishing 1991. (Chapters 1,2,3,5,7,8,9,10,12,13,14,15,17)

Reference Books :

1. Nils J. Nilson, “Artificial Intelligence, a new synthesis”2. Patterson, “Introduction to Artificial Intelligence and Expert Systems’, Prentice Hall,

2002.

28

MCA-522.3 COMPUTER GRAPHICS

1. Display Devices. Representing pictures, Line and point plotter system, Raster vector, Calligraphic refresh, Raster refresh and storage displays, Digital frame buffer, Plasma panel display, Character generators, Color display techniques.

[4 hours]

2. Interactive Graphics Pointing and positioning devices- Cursor, Light pen, Tablet, Mouse, Joystick, Track ball, Digitizer. Interactive Graphics Techniques –Positioning, Pointing, Inking, Zooming, Rubber band Techniques, Dragging.

[4 hours]3. 2-D Graphics Line Drawing Techniques, Fast drawing Circles and Ellipses -algorithms, Screen coordinates, user coordinates, Homogeneous coordinate system, Geometric and Coordinate Transformations.

[ 8 hours]4. Windowing and Clipping Windowing Concepts, Clipping algorithms, Line clipping, Area clipping, Text clipping, Blanking, Window to view port transformations.

[4 hours]5. 3-D Graphics Projections, Perspective and parallel projections transformations, Realism in three dimensional graphics.

[4 hours]6. Hidden Line Removal Algorithms Depth Buffer algorithm, Scan line coherence algorithm, Area coherence algorithm, Back face algorithm, Priority Algorithms.

[5 hours]7. Curves and Surfaces Shape description and Requirements, Bezier methods, B-spline methods

[5 hours]8. Graphics Standard PHIGS Introduction, Coordinate systems, Transformations, Input Devices

[3 hours]9. Introduction to Fractals

[2 hours]

Text Book:1. W.M.Newmann and Sproull, “Principles of Interactive Graphics”, McGraw Hill,1989.(Chapters 2, 3,4,5,11,12,14,15,21,22,24)2. Roy A. Plastock and Gardon Kelley, ”Schaum’s outline of Theory and Problems pf Computer Graphics”, 2nd printing,1987,1988.(Chapters 1,2,3,4,5,7,10)3. Steven Harrington,”Computer Graphics- A Programming Approach”, McGraw Hill,1987.(Chapters 1,2,4,6,7,8,9,11).4.W.A.Gaman, W.A.Giovinazzo, ”PHIGS by Example” Springer-Verilag Newyork Inc,1991.(Chapters 1,2,6)

29

Reference Book:1. Foley, Vandam, Hughes-“Computer Graphics, Principles and Practice,” 2nd edition,

in C ,1996.2. Donald Hearn and Pauline Baker,”Computer Graphics”,PHI,1996,2nd edition.3. David F.Rogers, ”Procedural Elements for Computer Graphics”, McGraw Hill.

MAT MCA – 522.4 OPTIMIZATION TECHNIQUES

Linear Programming – graphical and Simplex method. Dual programming. [4 hours]

Transportation and Assignment models - Meaning, assumptions and problem formulation, solution methodology.

[4 hours]

Programme Evaluation and Review Technique (PERT) and Critical Path Method (CPM). [8 hours]

Dynamic programming - applications and solution methodologies.Network analysisDecision theory Game theorySimulation - modeling [24 hours]

Reference Books:1. Taha H. , “Operation Research: An Introduction”, 4 th Edn. McMillan, 1987 (Coverage

: Relevant articles from chapters 1,2,3,4,5,6,7 & 12).2. Ravindran, Phillips and Solbeg, “Operational Research : Principles and Practices”, 2nd

Edn. Willey, 1987.3. V.K.Kapoor, “Operations Research”., 10th edition, 1995, Tata McGraw Hill.

MCA-522.5 ASSEMBLY LANGUAGE PROGRAMMING

4. Introduction: Types of computers. How computers & microcomputers are used. Overview of microcomputer structure & operation. Microprocessor evolution and types. The 8086 Microprocessor family. 8086 internal architecture. Introduction to programming the 8086. [2 hours]

5. 8086 Family Assembly Language Programming – Introduction: Program development steps. Constructing the machine codes for 8086 instructions. Writing programs for use with an assembler. Assembly language program development tools.

[2 hours]

6. Implementing Standard Program Structure in 8086 Assembly Language: Simple sequence programs. Jumps, Flags and conditional jumps. If-then, if-then-else and multiple if-then-else programs. While-do programs. Repeat-until programs, Instruction timing and delay loops. Different addressing modes.

[6 hours]

30

7. Strings, Procedures and Macros: The 8086 string instructions and solving problems using these string instructions, Writing & using procedures, Writing & using assembler macros.

[ 6 hours]

8. Advanced Assembly Language Programming Concepts: Console input/output, File operations, Directory operations, and Command line arguments, Disk operations, System configuration.

[8 hours]

9. 8086 Interrupts and Interrupt Applications: 8086 interrupts and interrupt responses, Hardware interrupt applications, 8254 software programmable timer/counter, 8259A priority interrupt controller, Software interrupt applications.

[8 hours]

10. The Arithmetic Co-processor: Introduction, Data format for the arithmetic co-processor, The 80X87 Architecture, Instruction set, Programming with arithmetic co-processor.

[8 hours]

Reference Books:1. Douglas V Hall, “Microprocessor and Interfacing – Programming and Hardware”, 2nd

Edition, Tata McGraw Hill2. K R Venugopal and Rajkumar, “Microprocessor X86 Programming”, BPB Publications.3. Barry B Brey,” The Intel Microprocessors 8086/8088, 80186/80188, 80286, 80386,

80486, Pentium, and Pentium Pro Processor”, 4th Edition,– Prentice Hall of India Private Limited.

MCA-522.6 MULTIMEDIA COMMUNICATIONS

1. Introduction to multimedia: Branch overlapping aspects, literature [2 hours] 2. Media and Data Streams:

Perception,Representation,Presentation,Storage,Transmission,Information exchange mediums, Representation dimensions. Combination of media. Traditional data stream characteristics, characteristics for continuous media

[3 hours]

3. Sound and Audio: MIDI concepts, MIDI Devices, MIDI Messages, Software, Speech Analysis, Speech generation and transmission.

[3 hours]

4. Images and Graphics: Formats, Image synthesis, image analysis, image transmission.

[4 hours]

31

5. Video and Animation: Basic concepts, enhanced definition systems, High definition systems Animation concepts, languages, methods of controlling animation display and transmission of animation.

[4 hours]6. Data Compression: Source, Entropy and Hybrid coding, compression techniques, JPEG

Lossy sequential DCT based mode, expanded lossy DCT mode Lossless mode, Hierarchical Mode,H.261,MPEG,video encoding MPEG-2,MPEG-4.

[7 hours] 7. Multimedia Operating System: Real time and multimedia, Resource management, Real

time processing and scheduling requirements, Rate monotonic and EDF algorithms. EDF and Rate monotonic Processor utilization, Multimedia file systems Unix, Quicktime, OS2, Windows Multimedia extensions.

[7 hours]

8. Database systems: MDBMS characteristics, data analysis.

[3 hours]

9. Synchronization: Notions, Intra and Inter object sync, live synthetic sync, lip sync requirements Pointer synchronization, Synchronization reference model, Axes based sync Control based sync, MODE, Hytime.

[7 hours]Text Books: 1. Ralf Steinmetz and Klara Nahrstedt, ”Multimedia Computing Communications and applications”,Prentice Hall,1995 edition.

MCA-524 SEMINAR [0 0 3* 2]

Students have to select a topic related to Computer Science and IT preferably not included in the regular syllabus. They have to talk for 1hour on the selected topic.

MCA 526 UNIX NETWORK PROGRAMMING LAB [ 0 0 3 1]

A. 5 experiments will cover the IPC system calls and socket system calls in Unix Domain

B. Mini Project covering 8 lab sessions Evaluation : 30 % weightage for experiment

70% weightage for Mini project

MCA- 528 WEB ENGG. LAB [0 1 3 2]

In this lab students will be implementing the concepts studied in the Web Engineering paper. Students will be using various technologies related to developing a web page.

32

FIFTH SEMESTER

MCA-527 ASP AND .NET APPLICATION

Introduction to .NET. What is .NET? Why .NET? Advantage of .NET, DNA Architecture, Understanding CLRIntroduction to CLR, CLR Architecture, Just In Time Compiler, Microsoft Intermediate language (MIL), understanding the IL with ILDASM

[4 Hours]Understanding the frameworkNeed of framework, types of framework (1) .NET framework and (2) mono framework, Versions of framework, Common class library, common type system, common language specification, languages under .NET.

[4 Hours]Working with Visual Studio 2008Creating a projects, solutions and projects, exploring and coding a projects, building and debugging projects.

[4 Hours]Web Programming with ASP.NETWeb programming concepts, dynamic HTML and Java Script, [2 Hours]

Designing models of the web forms: Single page model, Two page model, comparison of models. [2 Hours]

Working with server controls: Standard control, Navigation control, Data source control, Database operation with data source control [2 Hours]

Validation controls: Introduction, using IsValid property of page class, Creating and using validation groups, removing validation from the controls. [2 Hours]

Intrinsic Objects: request, response, session, application, server, view state [2 Hours]

State Management: Page Level, user level, application level, website level, cleaning the session state, global application class, web configuration file. [2 Hours]

Data Binding and reporting: Concepts, Master/detail relationship with drop down list, grid view, repeater, data list, detail view, form view, in-line editing of records, advance function with grid view, binding to collection and lists [2 Hours]

Merging content of a page in webform: Simple and advanced merging, Master page [2

Hours]

33

Caching: usage of caching , page output cache, data caching depending on control parameter, setting cache duration, expiring items from the cache [2 Hours]

Mailing with ASP.NET: creating and sending mails with MailMessage and SmtpMail class, creating auto responders, providing security while sending mails. [2 Hours]

Uploading files: using upload control to select file, setting the location and file name, upload the file, restricting the size and type of the file [2 Hours]

Creating auto changeable ads: creating schedule files for ads, define the adv. Size, providing XML files to AdRotator control [2 Hours]

Skins and themes: understanding the themes and skin, creating themes with default skin, applying themes and skin to web forms, applying theme to website [2 Hours]

Web services: introduction to XML web services, creating web service with Visual Studio .NET, testing web method, consuming web service in web application, using data with web services, understanding the WSDL and Disco, Creating proxy for web service with WSDL tool [2 Hours]

AJAX with ASP.NET: Understanding the AJAX technology, creating AJAX enabled website and web services, using UpdatePanel control [2 Hours]

Creating and using the crystal reports: Overview of crystal reports, creating reports with wizard, creating sub-reports, integrating report with windows and web application, customizing the report viewer, using formal and logic, working with .NET data, adding database or table to report, providing security information in report [3 Hours]

Deployment of website: using FTP software, using browsers, using visual studio .NET, creating MSI file for the website. [3 Hours]

Reference Books:1. Dino Esposito, Introducing Microsoft ASP.NET AJAX, Microsoft Press; 1 edition

(May 9, 2007) ISBN-10: 0735624135.

2. Bill Evjen, et al, Professional ASP.NET 3.5: In C# and VB, Wrox; Pap/Pas edition (March 4, 2008) ISBN-10: 0470187573

3. Scott Mitchell, Sams Teach Yourself ASP.NET 2.0 in 24 Hours Publisher: Sams (April 6, 2006) ISBN-10: 0672327384

34

MCA-529 DATA WAREHOUSING & DATA MINING [4 0 0 4 ]

1. Data Warehousing: Introduction, Data warehouse definition, Multi dimensional data model, OLAP operations, Warehouse schema, Data Warehousing Architecture, Warehouse server, Metadata, OLAP Engine, Data Warehouse Backend Process.

[6 hours]2. Data Preprocessing : Data cleaning, Data Integration and transformation, Data

reduction, Data cube arrogation, Dimensionality reduction, Sampling, Discretization and concept hierarchy generation, Segmentation by natural partitioning.

[8 hours]

3. Data mining: Introduction, Association rules mining, market based analysis, Apriori Algorithm, Partition Algorithm, Pincer – Search Algorithm, Dynamic item set counting algorithm, FP-tree growth Algorithm, Multilevel association rules, Approaches to mining multilevel association rules, correlation analysis, Issues and challenges in Data mining.

[12 hours]

4. Clustering Techniques: Introduction, Clustering paradigms, Partitioning Algorithms, k – Medoid & k- means Algorithms, CLARA, CLARANS, Hierarchical Clustering, DBSCAN.

[9 hours]

5. Classification and Prediction: Introduction, Tree Construction principle, Best Split, Splitting Indices, Splitting Criteria, Decision Tree Construction Algorithm.

[10 hours]

6. Web Mining: Introduction, Text mining, Content mining.[3 hours]

References:1. Arun K Pujari, “ Data Mining Techniques”,PHI 1st Edition, Universities Press

India, 2001.2. Jiawei Han and Micheline Kamber , “ Data Mining Concepts And Techniques”,1 st

Edition, Morgan Kauffmann Publishers, 2001.

MCA-531 SOFTWARE PROJECT MANAGEMENT [ 4 0 0 4]1. INTRODUCTION Introduction to Competencies - Product Development Techniques - Management Skills . The SEI CMM - International Organization for Standardization Formulation of a test case plan or test bed at the requirements stage: Ways to gather requirements and documentation. [6 hours]2. DOMAIN PROCESSES Managing Domain Processes - Project Selection Models - Project Portfolio Management - Financial Processes - Selecting a Project Team - Goal and Scope of the Software Project -

35

Project Planning - Creating the Work Breakdown Structure - Approaches to Building a WBS - Project Milestones - Work Packages - Building a WBS for Software.

[12 hours]3. SOFTWARE DEVELOPMENT Tasks and Activities - Software Size and Reuse Estimating : A Regression Model - COCOMO II - SLIM Organizational Planning - Project Roles and Skills Needed.

[5 hours]

4. SCHEDULING ACTIVITIES Project Management Resource Activities - Organizational Form and Structure - Software Development Dependencies - Brainstorming - Scheduling Fundamentals - PERT and CPM - Leveling Resource Assignments - Map the Schedule to a Real Calendar - Critical Chain Scheduling. [8 hours]

5. QUALITY ASSURANCEQuality: Requirements – The SEI CMM - Guidelines - Challenges - Quality Function Deployment - Building the Software Quality Assurance - Plan - Software Configuration Management: Principles - Requirements - Planning and Organizing - Tools - Benefits - Legal Issues in Software . [ 6 hours]

6.USABILITYMode of good interface design-simple pleasant dialog boxes, non-interfering colors, non crowding of user controls on the interface panel. [5 hours]

7. Team Structure, Development-Approach, Testing StrategyIdentification of deadlines-deciding on type of team to handle the project Best Sandwich strategy: Suitability of box model white box or black box testing strategies.

[6 hours]

MCA-533 ENTERPRISE RESOURCE PLANING[ 4 0 0 4]

1. INTRODUCTION TO ERP

Integrated Management Information Seamless Integration – Supply Chain Management – Integrated Data Model – Benefits of ERP – Business Engineering and ERP – Definition of Business Engineering – Principle of Business Engineering – Business Engineering with Information Technology.

[9 hours]

2. BUSINESS MODELLING FOR ERP

Building the Business Model – ERP Implementation – An Overview – Role of Consultant, Vendors and Users, Customisation – Precautions – ERP Post Implementation Options-ERP Implementation Technology –Guidelines for ERP Implementaion [9 hours]

3. ERP AND THE COMPETITIVE ADVANTAGE

36

ERP domain MPGPRO – IFS/Avalon – Industrial and Financial Systems – Baan IV SAP-Market Dynamics and Dynamic Strategy. [9 hours]

4. COMMERCIAL ERP PACKAGE

Description – Multi-Client Server Solution – Open Technology – User Interface- Application Integration. [9 hours]

5. ARCHITECTURE

Basic Architectural Concepts – The System Control Interfaces – Services – Presentation Interface – Database Interface. [9 hours]

Text Books

1. Vinod Kumar Garg and N.K.Venkita Krishnan, "Enterprise Resource Planning – Concepts and Practice", Second Edition, PHI, 2006.

References

1. Jose Antonio Fernandz, The SAP R/3 Handbook, MGH, 3rd edition 1998.

MCA 535 ELECTIVE III [ 3 0 0 3]

MCA-535.1 INFORMATION STORAGE & MANAGEMENT

1. Storage devices & I/O Subsystems Traditional Backup devices, Disk arrays, Disk physical structure- components, properties, performance, and specifications. Tape drives, JBODs, RAIDs, Hot spares. Storage I/O & Storage system connectivity protocols.

[8 hours]

2. Introduction to Networked Storage Discussion of Direct Attached Storage (DAS), Storage Area Networks (SAN), Network Attached Storage (NAS) and Content Addressable Storage(CAS), Basic architecture, connectivity and management principles.

[8 hours]

3. Introduction to Information availability Business Continuity and Disaster Recovery Basics, Local business continuity techniques, Remote business continuity techniques, Disaster Recovery principles & techniques.

[4 hours]

4. EMC Products& tools – A Case study

37

Discussion of CLARiiON Architecture, Snap view, Mirror view, Power path and SANCOPY.

[10 hours]5. Storage Area Networks (SAN) SAN components & Building blocks, SAN software, data access over SAN. Fiber channel basics, protocols & connectivity,SAN topologies, Elements of SAN design, scalability, availability, performance, security, capacity, and manageability issues. Studies and critiques of existing SAN design scenarios (partial mesh, full mesh, core/edge, & tiered designs).

[10 hours]Reference Books

1. Marc Farley Osborne, “Building Storage Networks”, Tata McGraw Hill 2. Robert Spalding, “Storage Networks: The Complete Reference“, Tata

Mcgraw Hill.3. Gupta Meena, “Storage Area Network Fundamentals”, Pearson Ed.4. NIIT, “Introduction to Information Security Risk Management” , Prentice-Hall

of India.5. EMC Technology Foundations student guide.

MCA-535.2 SELECTED TOPICS IN COMPUTER APPLICATIONS

1. E-Commerce: Introduction to business model and strategies, internet and the WWW, ecommerce technologies hardware and software, cryptography and network security, payment systems and transaction processing, creating and managing content, advertising, case studies, future trends. [10 hours]

2. M-commerce: Introduction to satellite and wireless communication, mobile telephony, service technologies like SMS, SAT, WAP etc. m-commerce terminals, Bluetooth, smartcards, killer application.

[8 hours]

3. E-governance: challenges and opportunities, issues, routes, technologies and infrastructure, case studies.

[6 hours]

4. Distance Learning: Computer aided instruction, virtual university, multimedia technologies, electronics boards.

[4 hours]

5. E-banking: Electronic funds transfer, MICR and bar coding. [4 hours]

6.Telemedicine: medical diagnostic packages, microcontrollers for the disabled and handicapped, remote patient monitoring, multimedia in healthcare, special imaging requirements. [8 hours]

Prerequisite: Knowledge of programming languages.Reference Books:

38

1. Ravi Kolakota & Andrew Whinston “ Frontiers of Electronic Commerce”.2. Vivek & Rajiv Sharma “Developing E-Commerce Sites – An Integral Approach”3. Daniel Amor “E-Business (R) Evolution”- HP Professional Books.4. K.Raina & Anurag Harsh,”MCommerce Security : A Beginners Guide”, 20015. Mehdi KhosrowPom, “Encyclopedia of Ecommerce, EGovernance &

MCommerce”, 2006.

MCA-535.3 DIGITAL IMAGE PROCESSING

1. Mathematical Foundations for Image Processing[6 hours]

2. Digital image representation: Fundamentals steps in image processing, Elements of digital image processing systems.

[4 hours]

3. Elements of visual perception: Sampling and quantization, Basic relationships between pixels, image geometry. [10 hours]

4. Discrete Fourier Transforms: Properties, FFT, DCT, Walsh transforms [10 hours]

5. Image enhancement: spatial and frequency domain methods, enhancement by point processing, Spatial filtering, Color image processing.

[10 hours]References:1. Rafalc C Gonzalez and Richard E Woods, “Digital Image Processing”, Addison

Wesley 1993.2. A.K.Jain, “Fundamentals of Digital Image Processing, PHI, 1994.

MCA-535.4 PARALLEL PROCESSING

1. Introduction to Parallel Processing : Criteria for judging the architecture, Architectural classification schemes, Trends towards parallel processing, Parallelism in uniprocessor systems, Parallel Computer Structure, Applications of parallel processing. [4 hours]

2. Principles of Pipelining : Principles of Linear and non-linear pipelining, classification of pipeline processors, general pipelines and reservation tables, Interleaved memory organization (Chapter 3 of Text 1 and Chapter 6 of Text 2)

[6 hours]

3. Structures and algorithms for Array Processors : SIMD array processors : SIMD computer organization, Masking and data routing mechanisms, SIMD interconnection networks : static v/s dynamic, mesh connected ILLIAC network, Barrel Shifter network, Shffle-exchange and omega network. (Chapter 5 of Text 1)

[8 hours]

4. Multiprocessor Architecture : Functional structures, UMA and NUMA multiprocessor. Interconnection Networks: Time shared or common buses, Bus arbitration algorithm,

39

Cross bar switch and multiport memories, Comparison of multiprocessor interconnection structure, multistage networks for multiprocessors. (Chapter 7 of Text 1 and Text 3)

[6 hours]

5. Algorithm Analysis (Chapter 1 and 2 of Text 4) Tree (4.1 to 4.4 of Text 4)[3 hours]

6. Algorithm design techniques (Chapter 10 of Text 4)[4 hours]

7. Parallel processing terminology and sieve of eratosthenes.(Chapter 1 of Text 3) Speed up, scaled speed up and parallelizability (3.6 of Text 3)

[3 hours]

8. Elementary parallel Algorithms (Chapter 6 of Text 3)[4 hours]

9. Matrix multiplication (Chapter 7 of Text 3)[3 hours]

10. The fast Fourier transform (Chapter 8 of Text 3)[3 hours]

11. Sorting (Chapter 10 of Text 3)[2 hours]

Text books:1. Kaihwang and Faye A. Briggs, “Computer Architecture and Parallel Processing”,

McGraw Hill series.2. Kaihwang, “Advanced Computer Architecture – Parallelism, Scalability,

Programmability”.3. Michael J. Quinn, “Parallel Computing – Theory and Practice ”, McGraw Hill

Publication.4. Mark Allen Weiss , “Data Structures and Algorithm Analysis in C ”,

Benjamin/Cummings Publication.

MCA-535.5 EMBEDDED SYSTEMS

8051 Micro controller

1. Micro controllers & Embedded processors: overview of 8051 family. [2 hours]

2. Detailed 8051 block diagram: functional pin diagram, I/O programming, Bit manipulation.

[4 hours]3. 8051 Assembly Language programming: Addressing modes, Assembler directives,

Instruction set, Assembly language programs.[6 hours]

40

4. 8051 serial communication, Interrupts programming, Timer/ Counter programming, interfacing real world (key board, stepper motor), Interfacing to external memory.

[10 hours]

Real Time Operating Systems

1. Basic real time concepts : Real time definition, Events and determinism, synchronous and asynchronous events, Determinism, examples of real time systems.

[2 hours]2. Real time specification and design issues. [2 hours]

3. Real time Kernels : Polled loop systems, phase/state driven code, Interrupt driven systems, Foreground and background systems, full featured real time operating systems, POSIX.

[4 hours]4. Inter task communication & synchronization: Real time memory management, system

performance analysis and optimization[4 hours]

5. Real time applications : Real time systems as complex system, Real time database, Real time image processing, Real time UNIX, Building real time applications with real time programming Languages.

[6 hours]References:

1. Muhammed Ali Mazidi & Janice Gillispe Mazidi - 8051 Micro controller and Embedded system –, 2002, Pearson Education

2. Philip A Laplante - Real time systems design and Analysis –, Second Edition

MCA-537 (ELECTIVE – IV)

[3 0 0 3]

MCA-537.1 VISUAL PROGRAMMING1. Over View of OOP: A brief overview of object oriented programming concepts like

objects, classes, encapsulation, polymorphism, and inheritance. [2 hours]

2. Introduction to visual programming: User interface design including graphics, sound and video. Overview of ADO controls. Use and configuring ODBC. Concept of OLE. A review of SQL.

[2 hours]

3. File handling: concepts (both sequential and random access files), data reporting, and overview of windows registry.

[2 hours]4. Case study: VC++I. Understanding Windows Programming: The essentials of a Windows Program,

The Microsoft Foundation classes, Windows Programming with Visual C++.[3 hours]

41

II. Working with Menus and Toolbars: Communicating with windows, Elements of a Menu, Using class wizard for Menu Messages, Adding Toolbar Buttons.

[3 hours]

III. Drawing in a window: Basic of Drawing in a window, The Drawing Mechanism in Visual C++, Drawing Graphics in Practice, Programming the Mouse.

[3 hours]

IV. Creating the Document and improving the view: What are collection classes? Using the CList Template class, creating the document, Improving the view, Deleting and Moving shapes, Dealing with Masked elements.

[3 hours]

V. Working with Dialogs and controls: Understanding Dialogs, understanding controls, Creating a Dialog Resource, Programming for a Dialog, Supporting the Dialog Controls, Completing Dialog operations, using a spin Button control, using a List Box, using an Edit Box control. [3 hours]

VI. Writing your own DLLs: Understanding DLLs, Deciding what to put in a DLL, writing DLLs.

[3 hours]

VII. Connecting to Data Sources: Database Basics, A little SQL, Database Support in MFC, creating a Database Application.

[4 hours]

VIII. Updating Data Sources: Update operations, A simple update Example, Managing the update process, Adding Rows to a Table.

[4 hours]

IX. Understanding OLE Documents: Object linking and Embedding, Implementing a OLE container, Implementing an OLE server, executing the server.

[4 hours]X. ActiveX controls: ActiveX and OLE, What is OLE controls, How OLE controls

work, implementing an ActiveX control. [4 hours]

Text Book: 1. Ivor Horton,” Beginning Visual C++ 6 “ by Wrox Press Lt., (Chapter 13 to 23)

Reference Books:1. Michael J Young, “Mastering Visual C++ 6”, BPB Publishers.2. Pappas, Chris H, “The Complete Reference Visual C++ 6”, TMH Publishers.

MCA-537.2 MANAGERIAL ECONOMICS

42

1. Definitions, Nature and Scope of Managerial Economics, Role and responsibilities of managerial economist.

[2 hours.]

2. Demand Analysis : Theory of Consumer behavior, Meaning of demand, Determinants of demand, law of demand, Movement and shift in demand, Nature of demand, Elasticities of demand and their significance.

[4 hours.]

3. Supply : Meaning, Law of supply, Elasticity of supply and its uses, Production function with one variable, two variables and multivariable inputs. Cobb Douglas Production function.

[4 hours.]

4. Cost Analysis : Types of costs, cost output relationships in short run and long run, Economies and diseconomies of scale.

[2 hours.]

5. Market structures in short run such as perfect competition, monopoly, monopolistic competition, discrimination monopoly, Oligopoly with and without differentiation and kinky demand curve, Duopoly.

[4 hours.]

6. Factor pricing, wages, rent, interest and profit.[1 hour.]

7. Profit planning using Break-Even Analysis : Single and multi-product analysis, Application of break even analysis.

[4 hours.]

8. Capital Budgeting : Meaning and Scope, Appraisal Criteria such as pay back, ARR, NPV, IRR and Profitability Index.

[4 hours.]

9. Cost of Capital : meaning, Determination of cost of debt capital, Preference capital, Equity capital, Retained earnings.

[3 hours.]

10. National Income : Meaning, concepts, measurement, difficulties in measurement, Importance, Equilibrium level of national income, Multiplier and Accelerator principle. [4 hours.]

11. Fiscal and Monetary : Policy, Business cycles, characteristics, phases, ill effects, remedial measures and theories of business cycle, Inflation definition and costs, causes and cures.

[4 hours.]

43

12. Theories of international trade, Comparative advantage, Modern theory, Terms of trade, Free trade VS Protection, Balance of Payments, Foreign exchange and its control. [4 hours.]

Reference Books :

1. Paul A Samuelson & William D Nordhaus, “ Economics”, Mc-Graw-Hill Book Company, 12th edition.

2. P L Mehta, “ Managerial Economics” Sultan Chand & Sons, I Edition.3. K K Dewett, “ Modern Economic Theory”, Shyam Lal Charitable Trust, 21st

Edition.

MCA-537.3 SOFT COMPUTING

1. Introduction to neurofuzzy systems and soft computing: from conventional AI to computational intelligence, neural networks, Fuzzy set theory, evolutionary computation, characteristics of neurofuzzy and soft computing systems. [8 hours]

2. Fuzzy set theory: fuzzy sets, set-theoretic operations, membership functions, fuzzy union, intersection, complement, fuzzy rules, reasoning and interference. [6 hours]

3. Optimization: derivative and non-derivative based. [4 hours]

4. Neural networks: back-propagation, feed-forward, hybrid systems, supervised learning: perceptrons, multilayer perceptrons, radial basis function, unsupervised learning: Kohenenself- organizing networks, Hebbian learning, Hopfield learning. [8 hours]

5. Neurofuzzy modeling: Adaptive Neuro fuzzy Inference Systems (ANFIS), classification and regression trees, CART algorithm, data clustering, neurofuzzy control. [6 hours]

6. Genetic algorithms: fuzzy logic and Gas, fuzzy logic databases. [4 hours]

7. Soft computing Applications: in cardiology, agriculture, automobile industry, robotics, etc.

[4 hours]

Reference Books:

1. JSR Jang, CT Sun and E Mizutani, ‘Neurofuzzy and soft computing’, Pearson Ed., Delhi, 2005.

2. M Bouchon, RA Yager, LA Zadeh, ‘Fuzzy logic and soft computing’, World Scientific, Singapore, 1995.

3. B. Andrea, ‘Soft Computing applications’, Physica Verlag, NY, 2003.

MCA-537.4 DISTRIBUTED SYSTEMS

44

1. Characterization of Distributed Systems: Introduction, Examples, Key characteristics, Design Goals: Introduction, Basic design issues, and user requirements.

[2 hours]

2. Networking and Internetworking: Introduction, Network technologies, Protocols, Technology case studies, Ethernet, Token Ring and ATM, Protocol case studies: Internet protocols and FLIP.

[4 hours]

3. Inter process communication: Introduction, Building blocks, client-server communication, Group communication, case study: inter process communication in UNIX. Remote Procedure calling: Introduction, Design issues, implementation, case studies: Sun and ANSA. Asynchronous RPC.

[6 hours]

4. Distributed operating Systems: Introduction, the Kernel, Process and Threads, Naming and Protection, Communication and invocation, Virtual memory. File service: A Model: Introduction, File service components, Design issues, Interfaces, Implementation Techniques. File service: Case Studies: Introduction, The sun Network, file System, the Andrew File System, The Coda File System.

[8 hours]

5. Name Services: Introduction, The SNS- a name service model, Discussion of the SNS and further design issues, Case studies: DNS, GNS and X.500. Time and Coordination: Introduction, Synchronizing physical clocks, Logical time and logical clocks, distributed co-ordination.

[8 hours]6. Shared Data and Transactions: Introduction, conversations between a client and a

server, Fault tolerance and recovery, Transactions, Nested transactions. Distributed Transactions: Introduction, simple distributed transactions and nested transactions, Atomic commit protocols, Concurrency control in distributed transactions, Distributed dead locks, Transactions with replicated data.

[8 hours]7. Security: Introduction, Cryptography, Authentication and Key distribution, Case study: Kerberos, Logics of authentication, Digital Signature.

[4 hours]

Text Books: 1. George Coulouris, Jean Dollimore and Tim Kindberg,” Distributed

Systems :Concepts and Design”, Second Edition, 1994 Low Price Edition.2. Andrew S. Tanenbaum & Maarten Van Steen, “Distributed Systems Principle &

Paradigms”, Pearson Education Asia.

45

MCA-539 MINI PROJECT [0 0 6 2]

Students are required to do a miniproject using Networking principles in J2EE Framework.

MCA- 541 DATA WAREHOUSING & DATA MINING LAB

[0 0 3 1]

In this lab students will be implementing the concepts studied in the Data warehousing & Data mining.

SIXTH SEMESTER

MCA-530 MAJOR PROJECT [0 0 0 20]

The duration of this major project is 16 weeks. Students are required to undertake innovative and research oriented projects, which not only reflect their knowledge gained in the previous semesters but also additional knowledge gained from their own effort. They must show the phase wise development of their project submitting the appropriate documents at the end of each phase.

46