thapar mca syllabus.pdf

7/27/2019 Thapar MCA Syllabus.pdf

1/53

MCA Programme

Eligibility: Recognised Bachelors degree of minimum 3 years duration in any discipline

with Mathematics at least at 10+2 school level and has also qualified in the Entrance Test

to be conducted by the University.

OR

Recognised Bachelor's Degree of minimum 3 years duration in any discipline with

Mathematics as one of the subjects and has also qualified in the Entrance Test to be

conducted by the University.

Duration of The Programme: The programme is spread over a period of three years

consisting of six semesters. The students study courses for five semesters at the

University and do a Software Development Project (SDP) in the sixth semester in some

reputed industry.

Number of Seats: 120 + 60 ( for Chandigarh Campus*)

* These students shall commence their curriculum in Patiala Campus and

shall move to

Chandigarh Campus when it starts. The geographical location of 'ChandigarhCampus' is at DeraBassi on the fringe of Chandigarh.

Distribution of Seats: General- 86 SC/ST- 30 PH- 04 Total- 120 (+18 FN/NRI

seats)

MCA Distance Education Mode:

Number of Seats: General- 43 SC/ST- 15 PH- 2 Total- 60

Document created by Sunny Kinger


2/53

Semester I

Sr. No Course Title Credits

1 Discrete Mathematical Structures 3.5

2 Elements of Electronics Engineering 4.5

3 Problem Solving and Programming in C 5.0

4 Operating Systems 4.0

5 Computer Organization and Architecture 3.5

-Total- 20.5

Semester II


1 Data Structures 4.5

2 Fundamental Of Microprocessors and Interfacing 4.5

3 Object Oriented Programming using C++ and Java 5.0

4 System Analysis and Design 4.5

5 Statistics and Combinatorics 4.5

-Total- 23.0



3/53

Semester III


1 Software Engineering 4.0

2 Data Base Management System 5.0

3 Design and Analysis of Algorithms 3.5

4 Operations Research 4.5

5 Computer Networks 4.5

-Total- 21.5

Semester IV


1 Advanced Java and Network Programming 4.0

2 Computer Graphics and Multimedia 4.5

3 ERP and Tools 4.0

4 Elective - I 3.5

5 Elective - II 4.0

6 Minor Project 2.0

-Total 22.0



4/53

Semester V


1 Information and Network Security 4.0

2 Software Project Management 3.5

3 .Net Framework and C# Programming 4.0

4 Elective - III 4.0

5 Elective - IV 3.5

-Total- 19.0

Semester VI


1 System Development Project 10

Elective I


1 E-Commerce 3.5

2 Software Testing and Quality Management 3.5

3 Object Oriented Analysis and Design 3.5

4 Theory of Computation 3.5

Elective II


1 Data Base Administration 4.0



5/53


2 Artificial Intelligence and Applications 4.0

3 Parallel and Distributed Computing 4.0

Elective III


1 Visual Programming using VC++ 4.0

2 Image Processing and Computer Vision 4.0

3 System Programming 4.0

Elective IV


1 Data Mining and Data Warehouse 3.5

2 Soft Computing 3.5

3 Wireless Networks and Mobile Computing 3.5

4 J2EE and Applications 3.5



6/53

Discrete Mathematical Structures

Mathematical Logic: Statement and notations, normal forms, theory and Inference for

statement calculus, predicate calculus, Inference theory for predicate calculus.

Relations and Functions: Binary relations, Composition of relations; Equivalence

relations and partitions; Transitive Closure, Partially ordered sets and lattice Hasse

diagrams; Functions, Injection, Surjection and bijection; Composition of functions.

Discrete Structures: Bit vector and Bit Map implementation, Weighting Rule for Disjoint

Union (i,j), Collapsing Rule for Find, Application of Set Union-Matrix.

Graph and Tree: Introduction to Tree and graph, Adjacency list, Traversal of graph,Breadth First Search, Depth First Search, Spanning Tree, Kruskals algorithm, Prims

Algorithm. Shortest Path, Topological sort, Activity network.

Boolean Algebra: Special types of Lattices, Boolean Algebra, Basic circuits and

theorems, Boolean expressions; Logic gates and relation of Boolean function.

Algebraic structures: Introduction to algebraic structures, semi groups, Groups and

subgroups, Applications of algebra to control structure of a program, congruencies,

applications of Congruence.

Recursion and Recurrence Relations: Recursive functions, iteration, sequences and

discrete functions, Recurrence relations, Generating function and their applications.

Text Books

1. Trembley J.P.and Manohar R., Discrete Mathematical Structures with Applications

to Computer Science, Tata McGraw Hill (2003).

2. Doerr Alan., Applied Discrete Structures for Computer Science, Galgotia

Publications (2005).

Reference Books

1. Liu C.L., Elements of Discrete Mathematics, Tata McGraw Hill (2000).

2. Ram Babu, Discrete Mathematics, Vinayak Publications (2005).



7/53

Elements of Electronics Engineering

Semiconductors Diodes: Atomic structure : Brief introduction to conductor, insulator and

semiconductor : energy band diagram p-type, n-type semiconductor, ideal diode, PN

semiconductor diode, Zener diode, light emitting diodes, Photo diode.

Biopolar Junction Transistor: Introduction, transistor operation, Transistor configuration,

CB, CC, CE. Transistor Amplifiers, Power Amplifiers, FET, MOSFET

Operational Amplifier: Introduction, Differential and Common Mode operation,

Applications of Operational Amplifier, Voltage Summing, integrator differentiator etc.

Cathode Ray Oscilloscope: Introduction, Cathode ray Tube, Theory and construction,Block diagram of CRO. Use of CRO for voltage, current, phase and frequency

measurements.

Number Systems: Number systems, conversions, Number Representations, Demorgans

Theorem, Boolean Algebra and Arithmetic operations Binary codes

Combinational circuits: Simplification of Boolean functions by K map method, Half adder,

Full adder, BCD adder, subtractor, ALU , code conversion, Magnitude, comparators,

Encoders, Decoders, Multiplexers and Demultiplexers.

Sequential circuits: Various types of flip flops, Registers, counters Synchronous/

Asynchronous

D/A and A.D. converters: Sample and hold circuits. D/A converter Ladder, R-2R and A/

D converters.

Laboratory Work: Experiments will be conducted covering the problems related to

Diodes, Transistors, FET, MOSFET, Operational Amplifier, CRO, Gates, Counters,

Registers, Encoder, Decoders, MUX, DEMUX.

Text Books

1. Thomas L. Floyd Electronic devices, Pearson Education (2006).

2. Tocci R J., Digital Systems Principles and Applications Prentice Hall of India (2003)

Reference Books

1. David A Bell, Electronic Devices and Circuits, Prentice Hall of India (2003).



8/53

Problem Solving and Programming in C

Introduction to computer software: software definition, categories of software system

software, application software, compiler, interpreter, utility program.

Introduction to C: Need for computer languages, Algorithms , C character set, Identifiers

and keywords, Data types, Declarations, , Standard input-output statements, Formatted

input-output statements, Pre-processor commands, Preparing and running a complete C

Program.

Operators and expressions: Arithmetic, unary, logical, bit-wise, assignment and

conditional operators, Library functions.

Control statements: while, do-while, for statements, nested loops. If else, switch, break,

continue and goto statements, comma operator.

Functions: Defining and accessing : passing arguments, Function prototypes, Recursion,

Use of library functions, Storage classes : automatic, external and static variables.

Arrays and Strings: Defining and processing, Passing to a function, Multi dimensional

arrays, Operations on strings.

Pointers: Declarations. Passing to function. Operations on pointers. Pointers and arrays.

Arrays of pointers.

Structures: Defining and processing, Passing to a function. Unions.

Files Handling: Open, close, create, process, Unformatted data files.

Laboratory Work: The laboratory work will be based on contents of course material like

expression, control statements, functions arrays, strings, pointers, structures, File

handling.

Text Books

1. Kernighan B.W. and . Ritchie D.M, The C Programming Language, PHI (1999)

2. Kanetkar,Y. P. Let us C, BPB (2006)

Reference Books

1. Herbert Schildt, The Complete Reference C, Tata Mcgraw Hill (2004).

2. Kaicker Sudhir,, The complete ANSI C, BPB (1996).



9/53

Operating Systems

Introduction: Evolution of operating system, fundamental of operating system functions,

multiprogramming, multiprocessing and time sharing systems.

Process Management: Processor scheduling, scheduling model, schedulers, CPU

scheduling algorithms, CPU scheduling algorithm, Concurrent process - introduction,

concurrency specifications, process graphs, process creation and termination, system

models, introduction to conflicts due to concurrency, simple examples to illustrate the

problem. Critical section problem, Pipes, FIFO, Message queue, semaphores, shared

memory, classical process co-ordination problem, Deadlock - introduction, analysis of

conditions, prevention & avoidance, Detection & recovery, deadlocks: practices today.

Memory Management: Contiguous memory allocation, address bindings, overlays, fixed

partitioning vs. variable partitioning, paged memory, virtual memory: Demand paging and

Segmentation.

File Management: File concepts, access methods, directory structure, file protection, file

system structure, allocation methods, Secondary storage management - disk structure,

disk scheduling, disk management, swap-space management, disk reliability.

Input/Output: Device controllers and device drivers, disks, other devices.

Example Systems: MS Windows, Unix/Linux.

Laboratory Work: Implementation of CPU scheduling algorithms, process management,

memory management and file management functions of Linux/Unix operating systems.

Text Books

1. Galvin and Silverscatz, Operating systems concept, Addison Wesley (1998).

2. Gary Nutts, Operating Systems- A Modern Perspective, Pearson Education (2003)

Reference Books

1. Dhamdhere,Operating Systems - A Concept-Based Approach, Tata McGraw Hill

(2003)



10/53

Computer Organization and Architecture

Basic computer organization: CPU, overview of data representation in computer,

instruction, instruction codes, instruction types, instruction set completeness, instruction

cycle, execution cycle, addressing modes.

Control Unit and Arithmetic Unit: ALU, data path design, control path design, hardwired

control, micro programmed control, micro programmed control Vs hardwired control, RISC

Vs CISC, hardware implementation of algorithms for addition, subtraction, multiplication

and division.

Pipeline: Parallel processing, pipeline general consideration, arithmetic pipeline,instruction pipeline, complexities in pipeline, super scalar processing.

Memory System: Memory, memory hierarchy, main memory, associative memory, cache

memory, virtual memory, architectural tools to implement these different memories.

Input Output Organization: Input & output interface, asynchronous data transfer, Modes

of transfer, DMA, I/O interrupts, channels.

Text Books

1. Mano Morris, Computer System Architecture, Pearson Education (2005).

2. Hayes J P., Computer Architecture and Organization, McGraw Hill (1998).

Reference Books

1. David A Patterson, Computer Architecture A Quantitative Approach, Morgan

Kaufmann Publishers, (2003).

2. Stallings W., Computer Organization and Architecture, PHI (2007).



11/53

Data Structures

Introduction: Algorithm complexity and Big O notation, recursion and its

importance,Tower of Hanoi problem.

Stacks: Concept, operations and representation in C, application to evaluation of postfix

expressions, conversion from infix to postfix representation.

Queues: Sequential representation, operations, priority queues, and array implementation.

Linked Lists: Concept, operations, stacks and queues as lists, array and dynamic

representation circular lists, doubly linked lists, Josephus problem.

Trees: definition, array and dynamic representations, operations, lists as trees, almost

complete binary trees, threaded binary trees, AVL trees.

Sorting: Efficiency considerations, O notation, Bubble sort, Quicksort, Selection sort,

binary tree sort Heap, heapsort, heap as a priority queue , Insertion sort, Shell sort, Merge

sort, Radix sort.

Graphs: Directed graphs, undirected graphs, DFS,BFS

Searching: Sequential searching, indexed Sequential searching, binary search,

interpolation search, binary tree searching, insertion and deletion, Optimum search trees,

height balanced trees, single and double rotations, Multiway, search trees, B-trees, B+-

trees, Hashing methods of resolving clashes, methods of choosing hash functions.

Laboratory Work: Implementation of Stacks, Queues, Linked Lists, Trees, Graphs,

Sorting and Searching algorithms.

Text Books

1. Mark Allen Weiss, Data Structures and Algorithm Analysis in C, Addison Wesley

(2006).

2. Kruse, Data Structures and Program design, Prentice Hall of India (1991).

Reference Books

1. Aho Alfred V., Ullman Jeffrey D., and Hopcroft John E., Data Structures and

Algorithms, Addison Wesley (2003).

2. Tenenbaum A M., Data Structures Using C, Prentice Hall of India (1991).

3. Seymour lipschutz,Theory and problems of data structures, Tata McGraw Hill(2002).



12/53

Fundamental of Microprocessors and Interfacing

Introduction to Microprocessors: Need for flexible logic, Evolution of Microprocessors,

Microprocessor applications, Generic Architecture of Microprocessor, Microcomputer

system.

Intel 8085 Microprocessor: Pin functions, Architecture, Addressing Modes, Instruction

set, Microprocessor

Programming Techniques: Counters & Delays, Subroutines & Stacks, Programming

Examples, Timing Diagrams, Interrupts.

Intel 8086 Microprocessor: PIN Functions, Architecture, Characteristics and BasicFeatures of Family, Segmented Memory, Instruction Set: Data Transfer Instructions,

Arithmetic, Logical, Shift & Rotate Instructions, String Instructions, Flag Control

Instructions, Transfer of Control Instructions, Processor Control Instructions. Programming

Examples, Interrupt Structure.

Intel 8086 System Configuration: Basic 8086 CPU Hardware Design, Generating the

8086 System Clock and Reset Signals, Min/Max Mode System Configuration.

Main Memory System Design: Types of Main Memories, Memory Organization, CPU

Read/Write Timing Diagrams, RAM and ROM Interface Requirements, DRAM Interfacing

and DRAM Controller (8203).

Basic Input/Output: Serial I/O, Parallel I/O, Programmed I/O, Interrupt driven I/O, Direct

Memory Access, DMA Controller (8237).

Peripheral Controllers: Programmable Peripheral Interface (8255), Programmable

Interrupt Controller (8259), Programmable Timer (8253/8254), Programmed Keyboard and

display Interface (8279), Serial Interface controller

(8251), interfacing with A/D & D/A converters.

Main Features of Advanced Microprocessors like 80286, 80386, 80486 & Pentium

Processors.

Laboratory Work

1. Familiarization with Microprocessor Kit, System Specifications, Facilities, Hardware

Description and Keyboard Description



13/53

2. Programs based on various addressing modes, Data Transfer techniques.

3. Testing all Arithmetic and Logical Instructions and their affect on various flags.

(Using various data Types).

4. Programs on Branch and Loop, String Instructions.

5. Programs of Sorting, Sum Of natural Numbers, Multiplication, Division, Factorial,

etc.

6. Programs using built-in Software Routines.

7. Interfacing experiments like programs to introduce delays, to generate square &

rectangular waves at different frequencies,

8. Familiarity with Assembler.

Text Books

1. Gaonkar R. S., The 8085 Microprocessor Architecture, Programming and

Interfacing, Penram International (2002).2. YU-Cheng Liu and Glenn A. Gibson, Microprocessor Systems: The 8086/8088

Family Architecture, Programming and Design, Prentice Hall of India (2004).

Reference Books

1. Hall, D. V., Microprocessor Interfacing, Programming and Hardware, Tata Mc

Graw Hill (2006).

2. Barry B. Brey, The Intel Microprocessors 8086 Family, Prentice Hall Of India

(1994).

3. John Uffenbeck, The 8086/8088 Family Design, Programming and Interfacing,

Prentice Hall of India (1999).



14/53

Object Oriented Programming using C++ and Java

Introduction: Object Oriented vs. Procedural Programming ,OOP Features & Benefits,

Identifying Object Classes, Class Identification Example, Sample C++ Class Definition,

Enhancement of C++ over C.

Classes and Objects: Defining member functions, Members access control, Use of scope

resolution operator, Inline functions, Nesting of member functions, Static data members,

Static member functions, Array of objects, Friend functions.

Constructors and Destructors: Types of constructors- default, parameterized and copy

constructors, Dynamic constructors. Destructors for destroying objects, new and delete

operators.

Operator Overloading and Type Conversions: Overloading unary, binary operators,

Operator overloading using friend functions, Rules for overloading operators, Type

conversions.

Inheritance: General concepts of Inheritance, Types of derivation. Types of inheritance.

Constructors in derived classes, Containership, Polymorphism with pointers, Pointers,

Virtual functions and Polymorphism.

Files and Streams: Streams, Unformatted and Formatted I/O operations, Managing

output with manipulators, File Streams, opening, reading, writing to file.

Templates and Exception Handling: Class templates and function templates,

overloading of template functions, Basics of exception handling, Exception handling

mechanisms.

Java: Primitive Data Types and Variables, Operators, Expressions and Statements,

Decision and Interactive Constructs, Classes and Objects, Inheriatnce and Polymorphism,

Packages and Interfaces, Exception handling, I/O in Java, Strings and Characters,

Exploring Java I/O, Introduction to Applets, Graphics and User Interfaces, Networking

Features and Java Servlets.

Laboratory Work: Implementation of object-oriented features using C++ and Java

including inheritance, overloading, Polymorphism, Visual Programming etc.

Text Books



15/53

1. Balaguruswamy, E., Objected Oriented Programming with C++, Tata McGraw Hill

(2001).

2. Gary Cornell and Cay S. Horstmann, Core Java Vol I and Vol II, Sun Microsystems

Press (1999).

Reference Books

1. Deitel and Deitel, C++ How to Program, Pearson Education (2003).

2. Deital and Deital, Java How to Program, Prentice Hall (2007).



16/53

System Analysis and Design

Introduction to System Development: Categories of Information Systems, Structured

Analysis Method, System Prototype Method, Succeeding as System Analyst., Systems

Development Life Cycle. Concept and Models requirements determination. Logical design.

Physical design, communication, interviewing, presentation skills; group dynamics; group-

based approaches. JAD structures walkthroughs.

Requirement Analysis: Basic Requirements, fact-Finding Techniques, Various Tools:

Data Flow Diagrams, Data Dictionaries, Decision Tables, Decision Trees; Feasibility Study,

feasibility considerations, steps in feasibility analysis, Cost and benefit analysis, Procedure

for cost and benefit determination.

Design: System design considerations, Process and stages of system Design: Logical

and Physical, selection of best alternate design strategy, Design of Input: Capturing data

for Input, Input, validation, Design of Output: Output objectives, Types of Output,

Presentation format of Output, user interface design.

System Engineering and Quality Assurance: Program Structure Chart, Purpose, Data

Passing, Quality Software Design: Top Down Structure, Coupling, Cohesion, Span of

Control, Module Size, and Shared Modules.

Testing: Managing Testing practices, Testing Strategies, Levels of Testing

System Implementation: Training, Conversion Methods, Computer Aided System/

Software Engineering Tools: Role and Benefit of CASE Tools, Categories of Automated

Tools, Various components of CASE tools, CASE Repository.

Design and Implementation of OO Platforms: Object oriented analysis and design

through object modeling technique, object modeling, dynamic modeling and functional

modeling, object oriented design and object oriented programming systems for

implementation, Unified Modelling Language.

Case Study of Some Common Systems: Inventory Control, Laboratory Management

Systems, Hotel Reception System, Hospital Management System etc. The course should

be based on lectures, case analysis and laboratory work. Cases should be used to

illustrate each major topic in the course.



17/53

Laboratory work: The laboratory work will be based upon the major assignment based

upon the various case study like Inventory control, Hospital management, Library

management, Railway/ airline reservation, Banking system, Loan management etc..

Text Books

1. Senn, James A., Analysis and Design of Information Systems, Tata McGraw Hill(1989).

2. Rumbaugh James, Jacobson Ivar, and Booch Grady, Unified Modeling Language

Reference Manual, Addison-Wesley Object Technology Series (2004).

Reference Books

1. Jeffrey A. Hoffer, Joey F. George, and Joseph S. Valacich, Modern Systems

Analysis and Design, Pearson Education (2004).

2. Whitten, Bentley and Barlow, System Analysis and Design Methods, Tata McGraw

Hill (2004).



18/53

Statistics and Combinatorics

Random Number Generation and Statistical Data: Basic concepts in random number

generation; Methods for generating random numbers and their efficiency test; Methods for

generating random numbers for probability distributions; Frequency distribution; frequency

curve and histogram; Measure of central tendency and dispersion.

Probability Distributions: Basic Concepts of Probability, its properties, conditional

probability and independent events; Binomial, Poisson, Rectangular, Exponential and

Normal distributions; Bivariate Distributions; Notion of Random Sample and sampling

distributions; Chi-square, t, F distributions; Basic ideas of testing of hypothesis; Testing of

significance based on normal, Chi-square, t and F distributions; Analysis of Variance;

Interval estimation.

Principle of Least Square: Curve fitting; Correlation and Regression (two variables only);

Rank Correlation.

Permutations and Combinations: Basic Concepts; Rules of counting; Combinational

distribution of distinct and non-distinct objects; Generating functions for permutation and

combinatorial enumeration.

Recurrence Relations: Linear recurrence relation with two indices; inclusion and

exclusion principle; Formula derangement; Restrictions on relative positions.

Laboratory Work: Implementation of statistical techniques using C/C++ including

Generation of Random Numbers for some distributions; Regression analysis using least

square approximation; Correlation Analysis; Hypothesis Testing; Program to obtain

Frequency Charts for large data set and fitting a distribution.

Text Books

1. Hogg, Robert V, Elliot A Tanis and Rao, Jagan M., Probability and Statistical

Inference, Pearson Education (2006).

2. Grimaldi, R.P. and Ramana B.V., Discrete and Combinatorial Mathematics, Pearson

Education (2007).

Reference Books

1. Meyer P.L, Introductory Probability and Statistical Applications, Oxford and IBH

(1970).

2. Krishnamurthy V., Combinatorics: Theory and Applications, Affiliated East-West

Press (1989).



19/53

Software Engineering

A Generic view of Software Engineering: Process Models, Software Requirements,Fundamentals, Requirements Process, Requirements Elicitation, Requirements Analysis,Requirements Specification, Requirements Validation, Practical Considerations.

Software Design: Software Design Fundamentals, Key Issues in Software Design,Software Structure and Architecture, Software Design Quality Analysis and Evaluation,Software Design Notations, Software Design Strategies and Methods.

Software Construction and Maintenance: Software Construction Fundamentals,Minimizing Complexity, Anticipating Change, Constructing for Verification, Standards inconstruction, Managing Construction: Construction Models, Construction Planning,Construction Measurement, Practical Considerations: Construction Design, ConstructionTesting, Reuse, Construction Quality, Integration Software Maintenance Fundamentals,

Key Issues, Maintenance Process, Techniques for Software Maintenance.

Software Configuration Management: SCM Process, Organizational Context for SCM,Constraints and Guidance for SCM Process, Planning for SCM, Software ConfigurationIdentification, Identifying Items to be controlled, Software Configuration Control, SoftwareConfiguration Status Accounting, Software Configuration Auditing, Software ReleaseManagement and Delivery

Software Testing: Fundamentals, Levels of Testing, Testing Techniques, TestingStrategies.

Software Engineering Tools and Methods: Software Requirements Tools, SoftwareDesign Tools, Software Construction Tools, Software Maintenance Tools, SoftwareConfiguration Management Tools, Software Engineering Process Tools, CASEEnvironments, Miscellaneous Tools.

Laboratory work: Study of Rational Rose software including UML diagrams like classdiagram, State diagram, Activity diagram, Competent diagram, Use case diagram.Text Books

1. A Guide to the Software Engineering Body of Knowledge (SWEBOK), IEEE

Computer Society, (http://www.nt.fh-koeln.de/fachgebiete/inf/nissen/softeng/swebok.pdf) (2004)2. Pressman Roger S and Roger Pressman, Software Engineering: A Practitioner's

Approach, McGraw Hill International Edition (2004).Reference Books

1. Peters James F. and Witold Pedrycz, Software Engineering - An EngineeringApproach, John Wiley (2001).

2. Sommerville Ian, Software Engineering, Pearson Education (2006).3. Jalote Pankaj, An Integrated Approach to Software Engineering, Narosa Publishing

House (2005).

http://www.nt.fh-koeln.de/fachgebiete/inf/nissen/softeng/swebok.pdfhttp://www.nt.fh-koeln.de/fachgebiete/inf/nissen/softeng/swebok.pdfhttp://www.nt.fh-koeln.de/fachgebiete/inf/nissen/softeng/swebok.pdfhttp://www.nt.fh-koeln.de/fachgebiete/inf/nissen/softeng/swebok.pdfhttp://www.nt.fh-koeln.de/fachgebiete/inf/nissen/softeng/swebok.pdfhttp://www.nt.fh-koeln.de/fachgebiete/inf/nissen/softeng/swebok.pdf


20/53

Data Base Management System

Introduction: Basic Concepts, Database & Database Users, Characteristics of the

Database system, Database Systems Architecture, Schemas & Instances, DBMS

Architecture and DBMS components Data Independence, Data Base languages &

Interfaces. Data Models: Network, Hierarchical, Relational, OODBMS, ORDBMS and their

comparison.

Data Modeling using the Entity-Relationship Approach: ER model concepts, notation

for ER diagram, mapping constraints, keys, concepts of primary key, candidate key and

super key.

Relational Model, Languages & Systems: Relational Data Model, Relational ModelConstraints Relational Algebra: Set theoretic operations: Union, Intersection, difference,

Cartesian product, Selection, Projection, Types of Join: Theta, Inner, Left Outer, Right

Outer, Natural & Division, Relational calculus: Tuple and Domain relational calculus.

SQL: A Relational Database Language, SQL data types, Constraints: Primary key, Foreign

key, check, unique, not null. Table level and column level specifications, DDL, DML and

DCL Queries in SQL, Data retrieval statements and sub-queries, various Data type

functions : Numeric, character and date data type functions. Views, Sequences,

Synonyms, Indexing .

PL/SQL: Introduction to PL/SQL, data types, Cursors, Triggers, Functions, Procedures,

Packages and Exception Handling.

Relational Data Base Design: Function Dependencies & Normalization for Relational

Databases. Closure, Loss less join & Dependency preserving decomposition. Normal

forms: INF, 2NF, 3NF, BCNF, 4NF and 5NF.

Concurrency Control & Recovery Techniques: Transactions, Concurrency Control

Techniques: Serialiazability, Locking Techniques, Time stamping Protocols, Multiple

Granularity of Data items, Recovery Techniques, Recovery concepts, Database backup

and recovery from catastrophic failures.

Distributed Database Systems: Introduction to Distributed DBMS concepts, Data

Fragmentation, Replication & Allocation techniques for distributed database design, Types

of Distributed Database systems, Query Processing in Distributed databases, overview of



21/53

concurrency control & recovery in distributed databases, Concepts of Object Relational

Data Base Management Systems.

Laboratory Work: Laboratory work will be based on Data Definition queries, Data

Manipulation and control queries in SQL, Views, Synonyms, Indexing, Sequences,

Introduction to PL/SQL, Cursors and Triggers, Procedures/Functions, Package, Exception

Handling.

Text Books

1. Elmasri R, Navathe S. B., Fundamentals of Database Systems, Pearson Education

(2006).

2. Korth H.F., Silbertz, S. Sudarshan A., Database Concepts, McGraw-Hill (2005).

3. Date, C.J., An Introduction to Database Systems, Narosa Publishing House

(2006). .Reference Books

1. Hector Garcia-Molina, Ullman, J. D. and Widom, J. D.., Database Systems: The

Complete Book, Pearson Publications (2002).

2. Desai, Bipin.C, An Introduction to Database Concepts, Galgotia Publication (2002).



22/53

Design and Analysis of Algorithms

Introduction and Models of Computation: Quick revision of Data Structures-stacks,

queues, trees, heaps, sets and graphs. Algorithm Definition, Analysing algorithms, order

arithmetic, time and space complexity.

Algorithm Design Techniques: Divide and Conquer: general method, binary search,

merge sort, quick sort, selection problem. Greedy method: Job Sequencing, Knapsack

problem, optimal merge patterns, minimum spanning trees.

Dynamic Programming: Use of table instead of recursion, all pair shortest path, 0/1

knapsack, optimal binary search tree, traveling salesperson problem,

Search And Traversal: Search techniques: breadth first search, depth first search, code

optimization.

Backtracking: 8 queens problem, sum of subsets, graph coloring, knap sacking problem.

Integer Programming: Branch and Bound Algorithm: 0/1 knapsack problem, Traveling

salesperson problem.

Lower Bound Theory: Comparison trees for sorting and searching, Oracles and

adversary arguments, techniques for algebraic problems.

Internal And External Sorting And Merging Techniques.

Problem Cases: P, NP, NP- Hard and NP-complete, deterministic and non deterministic

polynomial time algorithm approximation, algorithm for some NP complete problems.

Text Books

1. Horwitz Ellis, Sahni S., Rajasekaran S., Fundamentals of Computers Algorithms,Galgotia Publications (2003).

2. Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein,

Introduction to Algorithms, MIT Press (2001).

Reference Books

1. Anany Levitin, Introduction to the design and analysis of algorithms, Pearson

Education (2003).

2. Aho A.V., Hopcraft J.E., Dulman J., Design and Analysis Algorithms, Addison

Wesley (2002).



23/53

Operations Research

Definition of Optimization: Meaning of Operations Research, Modeling in operation

research, principles of modeling, Introduction to linear and non-linear programming

problems and formulation.

Linear Programming: Characteristics, Assumptions and Applications, Graphical solutions

of two variables LP Problem, Linear programming in standard form, Solution of LP by

Simplex and revised Simplex methods, Special cases of LP, Duality and dual Simple

method, Sensitivity analysis of LP problems.

Network Models: Transportation problem, Transshipment problem, Assignment problem,

Traveling-salesman problem, Shortest route problem, Minimal spanning tree problem,Maximum flow problem, Project Management(CPM and PERT).

Dynamic Programming and their applications.

Non-linear Programming: Characteristics, Concepts of convexity, maxima and minima of

functions of n variables using Lagrange multipliers and Kuhn-Tukker conditions, One

dimensional search methods, Fibonacci and golden section method, Optimization using

gradient methods for unconstrained problems.

Lab work: Introduction to some optimization software, implementation of graphical,

simplex, revised simplex methods, implementation of assignment and transportation

problems, programs for queuing models, implementation of CPM and PERT.

Text Books

1. Taha H.A., Operations Research: An introduction, Prentice Hall of India (2004)

2. Billy E. Gillett, Introduction to Operations Research: A Computer Oriented

Algorithmic Approach, McGraw Hill (1979).

Reference Books

1. Ronald R Rardin, Optimization in Operations Research, First Edition, Pearson

Education (2002)

2. Pant J. C., Introduction to Optimization, Jain Brothers (1998).

3. Kasana H. S., Introduction to operation Research, Springer-Verlag (2005)



24/53

Computer Networks

Introduction to Computer Networks: Advantages of networks, point-to-point and multi-

drop circuits, data flow and physical circuits, network topologies, topologies and design

goals. Hierarchical topology, horizontal topology (Bus), star topology, ring topology, mesh

topology. Protocol hierarchy, Design issue for the layers, connection- oriented and

connectionless services, service primitives, OSI reference model, TCP/IP reference model,

comparison of OSI and TCP/IP reference model. Type of networks, standard

organizations, Analog and digital signals, data rate limits, digital and analog transmission,

transmission media, Frequency division multiplexing, Wavelength division multiplexing,

Time division multiplexing, circuit switching, packet switching, message switching. Network

devices.

Data Link layer: Services provided to the network layer, framing, error control, Flow

control, Error correcting codes, Error detecting codes, Sliding Windows protocols: one bit

sliding window protocol, protocol using go back n, protocol using selective repeat, HDLC,

PPP, Channel allocation problem, Multiple access protocols, Ethernet.

Network Layer: Network layer design issues, routing algorithms: shortest path algorithm,

flooding, distance vector routing, link state routing, hierarchical routing, broadcast routing,

multicast routing, congestion control algorithms, Internetworking, IP protocol, IP

addressing, subneting, superneting, ARP, RARP, BOOTP, DHCP, ICMP, OSPF, BGP,

Internet multicasting, Mobile IP, Ipv6.

Transport layer: Services provided to the upper layer, Addressing, UDP, TCP, Connection

establishment, connection release, Flow control and buffering, multiplexing, TCP

congestion control, TCP timer management.

Application layer: Domain name system, E-mail, File transfer protocol, HTTP, HTTPS,

World wide web.

Laboratory work: The lab work will be based on network installation using Windows

server and Linux server, implementation of the different application layer protocols on

these server, configuration of network devices like switches, routers and implementation of

the protocols on these devices. Simulation of different LAN protocols etc.

Text Books

1. Forouzan B. A., Data communications and networking, Fourth Edition, Tata McGraw

Hill (2006)2. Tannenbaum A.S., Computer Networks, Fourth Edition, Pearson Education (2004)

Reference Books



25/53

1. Stalling, W., Data and Computer Communication, Seventh Edition, Pearson

Education (2003)

2. Antonako J.L., Mansfield K.C., An Introduction to Computer Networks, Pearson

Education (2002).



26/53

Advanced Java and Network Programming

Java Basics Review: Java streaming, Networking, Event handling, Multithreading, Byte

code Interpretation, Customizing application, Data Structures, Collection classes, Generic

interfaces, classes and methods.

Networking: Networking fundamentals, Client/server model, Internet addresses, Sockets,

Networking classes and interfaces, using Java.net package, TCP/IP and datagram

programming,HTTP protocol and URLs

Distributed Computing: Custom sockets, Remote Method Invocation, Activation - Object

serialization, Distributed garbage collection, RMI, IIOP, Interface definition language,

CORBA, JINI overview.

Java Beans and Swing: Bean concepts, Events in bean box, Bean customization,

Persistence, Application deployment using swing, Advanced swing techniques, JAR file

handling.

Introduction to Java Enterprise Applications: JNI, Servlets, Java Server Pages, JDBC,

Session beans, Entity beans, Programming and deploying enterprise Java Beans, Java

transactions.

Related Java Techniques: Java Media Frame work, 3D graphics, Internationalization,

Case study, Deploying n-tier application, E- commerce applications.

Laboratory Work: Implementation of Networking, Multithreading, JNI, Servlets, Java

Server Pages, JDBC and Remote Method Invocation etc.

Text Books

1. Gary Cornell and Horstmann Cay S., Core Java, Vol I and Vol II, Sun MicrosystemsPress (1999).

2. Herbert Schildt, Java: The Complete Reference, McGraw-Hill (2006).

3. Todd Courtois, Java networking and communications, Prentice Hall (1998).

Reference Books

1. Stalling, W., Data and Computer Communication, Seventh Edition, Pearson

Education (2003)

2. Antonako J.L., Mansfield K.C., An Introduction to Computer Networks, Pearson

Education (2002).



27/53

Computer Graphics and Multimedia

Introduction to Computer Graphics: Introduction, Interactive and Passive graphics,

advantages of interactive graphics

Interactive Devices: Graphics input devices; refresh CRTS, display devices-random scan

and raster scan displays. , color CRT monitors, LCD

Graphics Hardware: Video controller, raster scan display processor.

Scan Conversions: Scan converting lines, circles, ellipses, arcs and sectors. DDA

algorithm, Bresenham Algorithm, midpoint algorithms for line and circle, scan converting

curves using midpoint algorithms

Filling Polygons: Boundary fill, flood fill, scan line polygon fill algorithm

Transformations: 2D transformations, 3D transformations, Homogeneous coordinates

and matrix representation of 2D transformations and 3D transformations: translation,

scaling, rotation. Composition of 2D Transformations and 3D Transformations.

Viewing Transformations And Clipping: Window-to-Viewport transformation, clipping

Lines, clipping Polygons, clipping Circles.

Mathematics Of Projection: Perspective projection, parallel project ion.

Geometric Forms and Models: Polygon surfaces, curved surfaces, parametric equations,

Beizer curves, spline curves, Beizer surfaces, spline surfaces.

Visible Surface Determination: Algorithms for visible line determination, z-buffer

algorithm, list priority algorithm, scan-line algorithm, visible ray tracing, painters algorithm,

subdivision algorithm.

Illumination And Shading: Illumination models, shading models for polygons, shadows,

transparency.

Multimedia: Multimedia building blocks, animation, different audio and video file formats

Laboratory Work: The lab work will be based on: line generation using DDA, midpoint,

Bresenham algorithm midpoint/Bresenham, circle algorithm, midpoint ellipse



28/53

algorithm ,curve generation using midpoint algorithm ,flood fill ,boundary fill, scan line

polygon fill algorithms, transformation techniques (2D ,3D):translation, rotation, scaling,

reflection, orthographic ,oblique projections ,Line clipping ,polygon clipping, Bezier curves,

piecewise Bezier curves with zero order continuity, Bezier surface, sphere and ellipsoid

generation using parametric equations,Animation using multimedia softwares(like flash)

Text Books

1. Hearn D and Baker P., Computer Graphics, Pearson Education (1997).

2. Rogers D. and Adams J., Mathematical Elements for Computer Graphics,

Internatiional Student Edition (2002)

Reference Books

1. Plastock R. and . Kalley G, Theory and Problems of Computer Graphics, Tata

McGraw-Hill (1986).

2. Foley J., A. van Dam, Feiner, S. and Hughes J., Computer Graphics: Principles and

Practice, Pearson Education (2002).



29/53

ERP and Tools

Introduction to ERP: ERP Overview, Benefit, Business Process Reengineering, Data

ware Housing, Data Mining, LAP, Supply chain Management.

ERP: A Manufacturing Perspective, ERP Module, ERP Market, ERP implementation life

cycle, Options of various paradigms, Identification of suitable platforms, Role of SDLC/

SSAD, Object oriented architecture.

ERP & Future Directives: ERP and Internet, Critical Factors guiding selection and

evaluation, Strategies for successful implementation, Impediments and initiatives to

achieve success, Critical success and failure factors, Integrating ERP into organizational

culture.

SAP: Architecture of SAP R/3, Three-tier Architecture, SAP settings, Assigning user role,

SAP user interface, Creating favorites ,starting and shutting the SAP system , Handling

Tasks in SAP, Reports in SAP, Variants in Report, Background Scheduling, Scheduling

Background jobs, Status of a background jobs.

SAP system Administration Utilities, SAP R/3 Basis system, Understanding ABAP

workbench, Data types and Tables in ABAP, ABAP programming Language, ABAP User

Dialogs, Running ABAP programs, Accessing Database Access, open SQL, Native SQL,

Programming database Updates, ABAP Object Orientation, Classes and objects in ABAP,

Object Handling, Declaring and Calling methods, Inheritance, Interfaces, Triggering and

Handling Events, ABAP data dictionary, Batch Data Communication.

Laboratory Work: Implementation of ERP concepts using any ERP package.

Text Books

1. Garg Vinod Kumar and Venkita Krishnan N.K., Enterprise Resource Planning-Concepts and Practice, PHI (1998)

2. Dreamtech Software Team, SAP Architecture, Administration, Basis, ABAP

Programming with MM and SD modules, Dreamtech Press (2005).

Reference Books

1. Fernandz Jose Antonio, The SAP R/3 Handbook, Tata McGraw Hill (1998).

2. Buck-Emden, Rudiger, The SAP R/3 System: An Introduction to ERP and Business

Software Technology, Pearson Education (2000)

3. Carol A. Ptak and Eli Schragenheim, ERP Tools, Techniques and Applications for

Integrating the Supply Chain, CRC Press (1999)



30/53

Information and Network Security

Introduction: Security problem in computing, Elementary Cryptography Introduction,

Substitution ciphers, Transpositions Encryption Algorithms DES, AES, Public key

encryption, Uses of encryption. Program security, Secure programs, Nonmalicious

program errors, Viruses and other malicious code, Targeted malicious code, Controls

against program threats

Protection in general purpose operating systems: Protected objects and Methods of

protection Memory and address protection Control of access to general objects File

protection mechanisms User authentication Designing Trusted operating systems

Security policies Models of security Trusted operating system design Assurance in

trusted operating systems.

Security in Networks, Threats in networks, Network security controls, Firewalls,

Intrusion detection systems. Sniffers: Passive Sniffing, Active Sniffing, Spoofing and

Sniffing Attacks, ARP Poisoning and countermeasures, Denial of Service: Goals, Impact

and Modes of Attack, Internet Security Architectures- Basic security deficits of Internet

protocol, IPSec, Authentication Header (AH), Encapsulating Security Payload (ESP).

Session Hijacking, Spoofing vs Hijacking, Steps in Session Hijacking, Types of Session

Hijacking, Protocol vulnerabilities- examples of protocol vulnerabilities, Secure socket

layer/ Transport layer security, secure shell (SSH), Firewall architectures, packet filtering,

proxy services and bastion hosts.

Network Aadministration: Introduction, configuration of DNS, DHCP, and NAT, Mail

services- email, news, administration of mail services, File services, directory services,

print services, LAN and WAN fundamentals, Network designing, configuration and

management

Laboratory Work: The lab work will include implementation of algorithms of cryptograpgy.

In network security, the lab work will include firewall implementation, SSH, certificates and

security tools implementation, database security, program seciruty etc. The lab work will

also include configuring DNS, DHCP, NAT etc., router configuration, WAN networking,

Building VPN.

Text Books

1. Charles. P. Pfleeger and Shari Lawrence Pfleeger, Security in Computing, Pearson Education (2002).



31/53

2. William Stallings, Network Security Essentials, Applications and Standards,

Pearson Education (2008)

Reference Books

1. Stallings W., Cryptography and Network Security Principles and practice, Pearson

Education (2003).2. Michael. E. Whitman and Herbert J. Mattord Principles of Information Security,

Course Technology (2004).



32/53

Software Project Management

Project Management Framework: Project Management Knowledge Area and

Framework, Project Phases and Project Life Cycle, Project Stakeholders, Project

Management Processes: Project Processes: Initiating Processes, Planning Processes,

Control Processes, Executing Processes, Closing Processes, Process Groups, Process

Interactions, Project Integration Management: Project Plan Development, Project Plan

Execution, Overall Change control.

Project Scope Management: Initiation: Product description, Strategic Plan, Project

Selection Criteria, Historical Information, Project Selection Methods, Expert Judgment,

Scope Planning: Constraints, Assumptions, Product Analysis, Cost Benefit Analysis,

Alternative Identification, Expert Judgment, Scope Statement, Supporting Detail, Scope

Management Plan, Work Breakdown Structure, Scope Definition, Scope Verification,

Scope Change Control.

Project Schedule and Time Management: Activity Definition, Activity Sequencing,

Activity Duration Estimation, Schedule Development, Schedule Control

Project Cost Management: Resource Planning, Cost Estimation, Cost Budgeting, Cost

Control.

Project Human Resources Development: Organizational Planning, Staff Acquisition,

Team Development

Project Risk Management: Risk Identification: Sources of Risk, Risk Symptoms, Risk

Quantification: Potential Risk Events, Cost Estimates, Risk Projections, Risk Impact, Risk

Management Plan, Risk Response Control.

Software Measurements: Software Process and Project Metrics: Size Oriented Metrics,Function-Oriented Metrics, Extended Function Point Metrics, A Framework for Technical

Software Metrics, Metrics for Requirement Specification Quality, Metrics for Analysis,

Metrics for Design, Metrics for Source Code, Metrics for Testing, Metrics for Maintenance.

Text Books

1. A Guide to the Project Management Body of Knowledge (PMBOK), Project

Management Institute, PA, (2004).

2. Harold Kerzner, Frank P. Saladis, Project Management Workbook and PMP/CAPM

Exam Study Guide , Wiley Publishers (2006)



33/53

Reference Books

1. Claudia M. Baca, Patti, PMP: Project Management Professional Workbook, Sybex,

Workbook (2003).



34/53

.Net Framework and C# Programming

Introduction to C#, CLR, Visual studio console app, Simple windows forms, C# language

fundamentals, Enumerations, structures, Namespaces

C# Object oriented programming: OOPs, Encapsulation, Inheritance, Polymorphism,

Object Lifetime, Components, Modules, Windows Forms, Interface, Cloneable objects,

Comparable objects, Collections Namepaces

Advanced Class Construction: Custom Indexer, Overloading operators, Delegates,

Events

Assemblies, Thread, and AppDomains: C# assemblies, GAC, threads, contexts,

Appdomains, Processes concepts, Concurrency and synchronization- Locks, Monitors,

ReaderWriterLock, Mutexes, Thread pooling,

IO, Object serialization and remoting: System.IO, Streams, TextWriter, TextReader,

BinaryWirter, BinaryReader, Serialized Object Persistence and formatters, Remoting

ADO.Net, C# windows forms for data control: Grid, Datasource and databindingcontrols, Connected and disconnected scenarios, ADO.Net system, Data, Dataset,

connections, Adapters, commands, datareaders,

ASP.net: Introduction, Architecture, Web forms, Server controls, Data connectivity using

ASP.net,

Laboratory Work: The lab work will be based on the C# programming concepts, console

applications, window forms, database connectivity using ADO.net and ASP.net, webservices and server controls .net technologies.

Text Books

1. A Guide to the Project Management Body of Knowledge (PMBOK), Project

Management Institute, PA, (2004).

2. Harold Kerzner, Frank P. Saladis, Project Management Workbook and PMP/CAPM

Exam Study Guide , Wiley Publishers (2006)

Reference Books

1. Claudia M. Baca, Patti, PMP: Project Management Professional Workbook, Sybex,

Workbook (2003).



35/53

E-Commerce

Concepts, Dimensions and Performance of E-Commerce: History, Scope,

Opportunities, Benefits, Impact of E-Commerce. Classification of E-Commerce,

Challenges and solutions for developing countries.

E-Strategy: Developing E-commerce Strategy, use of Internet in E-Commerce Market

Research, finding the buyers, Role of Communications in the E-Commerce. Organizational

Structure of E-Commerce.

Legal and Ethical Issues: E-Commerce Legal Framework, Rights and Obligations in the

world of E-Commerce: Copyrights, Defamation, Privacy, Contracts, And Taxation on the

Internet, Domain Name and Registration, Contract Signing.

Customer Effective Web Design: Websites designing and Performance, Internet

Advertising, Corporate Website, Essential elements of a well-designed website, creating a

website, Business Protection.

Sale Price and Online Payment: Real world payment system, credit card transactions:

risk management and international issues, Electronic Funds Transfer and AutomatedClearing House, Micro Payment, Financial costs and payment modes of E-Commerce, E-

payment System..

E-Security: Security Design, Analysis Risk, E-Banks and Security, safety and privacy of

Internet Transactions. Online Shopping, Firewalls for security.

Introduction to Mobile Commerce: Mobile Commerce: Challenges of E-Commerce,

Global Mobile Commerce, Security of Mobile Commerce.

Introduction to E-Business: Moving from E-Commerce to E-Business, E-Business

Design issues, E-Business Communities, Role of E-commerce in Indian Business context.

Text Books

1. Mahmoudi Maymand M., E-Commerce, Deep and Deep Publications (2005).

2. Joseph P.I. , E-Commerce: An Indian Perspective, PHI. (2007).

Reference Books

1. Kalakota Ravi, Robinson Martia, E-Business Roadmap For Success, (2001)



36/53

2. Reynolds Janice, The Complete E-Commerece Book Design Built and Maintain,

Janice Publications (2004).



37/53

Software Testing and Quality Management

Software Testing Fundamentals: Testing-Related Terminology, Key Issues: Test

selection criteria/Test adequacy criteria, Testing effectiveness/Objectives for testing,

Testing for defect identification, Theoretical and practical limitations of testing, the problem

of infeasible paths, Testability, Relationship of Testing with other activities, Testing Levels:

Unit Testing, Integration Testing, System Testing, Acceptance Testing.

Testing Techniques: Based on the software engineers intuition and experience, Ad hoc

testing, Exploratory testing, Specification-based techniques, Equivalence partitioning,

Boundary-value analysis, Decision Table Testing, Testing with Formal Specifications, Finite

State Machine based, Code Based, Data Flow Based, Mutation Testing, Techniques based

on nature of the application: Object-oriented testing, Component-based testing, Web-based testing, GUI testing, Testing of concurrent programs, Protocol conformance testing,

Testing of real-time systems, Testing of safety-critical Systems, Selecting and combining

techniques

Software Quality: Software Engineering Culture and Ethics, Value and Cost of Quality,

Models and Quality Characteristics: Software Engineering Process Quality, Software

Product Quality, Quality Improvement, Software Quality Management Processes: Quality

assurance process, Veification process, Validation process, Review process, Audit

process, Practical Considerations: Software Quality Requirements, Dependability, Integrity

levels of software, Defect Characterization.

Software Quality Management: Techniques, Software Quality Measurement, ISO

9000:2000 Quality management systems --Fundamentals and vocabulary, ISO 9001:2000

Quality management systems Requirements, ISO 9004:2000 Quality management

systems --Guidelines for performance improvements, Quality Management Processes:

Quality Planning, Quality Assurance, Quality Control.

Quality Planning: Inputs, Tools and Techniques, Outputs

Quality Assurance: Inputs, Quality Management Plan, Results of Quality Control

Measurements, Operational Definitions, Quality Planning tools and techniques, Quality

Audits, Quality Improvements

Quality Control: Inputs, Tools and Techniques: Inspection, Control Charts, Pareto

Diagrams, Statistical Sampling, Flowcharting, Trend Analysis, Outputs: Quality



38/53

Improvements, Acceptance Decisions, Rework, Completed Checklist, Process

Adjustments.

Text Books

1. Mahmoudi Maymand M., E-Commerce, Deep and Deep Publications (2005).

2. Joseph P.I. , E-Commerce: An Indian Perspective, PHI. (2007).Reference Books

1. Kalakota Ravi, Robinson Martia, E-Business Roadmap For Success, (2001)

2. Reynolds Janice, The Complete E-Commerece Book Design Built and Maintain,

Janice Publications (2004).



39/53

Object Oriented Analysis and Design

Object Oriented Design Fundamentals: The object model - Classes and Objects,

Complexity ,Classification, Notation, Process - Pragmatics - Binary and entity relationship,

Object types - Object state, OOSD life cycle

Object Oriented Analysis: Overview of Object Oriented Analysis, Shaler/Mellor, Coad/

Yourdon, Rumbagh, Boochs Approach towards the analysis, UML , Usecase, Conceptual

model, Behaviour ,Class, Analysis patterns, Overview, Diagrams, Aggregation.

Object Oriented Design Methods: Unified Modeling Language : UML static view,

Dynamic view, Model Management View, UML Diagrams, Collaboration - Sequence -

Class - Design patterns and frameworks - Comparison with other Design methods

Managing Object Oriented Development Managing analysis and design - Evaluation

testing - Coding - Maintenance Metrics, case Studies In Object Oriented Development

Design of foundation class libraries - Object Oriented databases - Client/Server computing

- Middleware.

Text Books

1. Craig Larmen, Applying UML and Patterns: An Introduction to Object Oriented

Analysis and Design and Iterative Development, Prentice Hall (2004)

2. Booch G., Rambaugh J., Jacobson Ivar, The Unified Modeling Language User

Guide, Pearson Education (2003)

Reference Books

1. Booch G, Maksimchuk, Engel, Young, Conallen and Housten, Object Oriented

Analysis and Design with Applications, Addison Wesley Professional (2007)

2. Booch G., Object Oriented Analysis and Design, Addision Wesley (1994)



40/53

Theory Of Computation

Recursive Languages: Recursive Definition, Alphabets, Language, Regular Expression,

definitions of Finite State Machine, Transition Graphs, Deterministic & Non-deterministic

Finite State Machines, Regular Grammar, Left-Linear and Right Linear, Thomsons

Construction to Convert Regular Expression to NDFA & Subset Algorithm to convert NDFA

to DFA. Minimization of DFA, Finite State Machine with output (Moore machine and Melay

Machine), Conversion of Moore machine to Melay Machine & Vice-Versa.

Properties of Regular languages: Conversion of DFA to Regular Expression, Pumping

Lemma, Properties and Limitations of Finite state machine, Decision Properties of Regular

Languages, Application of Finite Automata.

Context Free Grammar and PDA: Context Free Grammar, Writing Context free Grammar

for Problems, Derivation tree and Ambiguity, Application of Context free Grammars,

Chomsky and Greibach Normal form, Conversion of CFG to CNF and GNF. Properties of

context free grammar, CYK Algorithm, Decidable properties of Context free Grammar,

Pumping Lemma for Context free grammar, Push down Stack Machine, Design of

Deterministic and Non-deterministic Push-down stack, Parser Design.

Turing Machine: Turing machine definition and design of Turing Machine, Church-Turing

Thesis, Variations of Turing Machines, Combining Turing machine, Universal Turing

Machine, Post Machine, Chomsky Hierarchy.

Incommutability: Halting Problem, Turing Enumerability, Turing Acceptability and Turing

Decidabilities. Unsolvable problems about Turing machines.

Computation Complexity: P, NP and NP Complete Problems.

Text Books

1. Daniel A. Cohen, Introduction to Computer Theory, John Wiley and Sons (1996)

2. Hopcroft John E., Ullman Jeffrey D. and Motwani R., Introduction to Automata

Theory, Languages and Computation, Pearson Education (2006).

Reference Books

1. Michael Sipser, Introduction to the Theory of Computation, Thomson (2007)

2. Lewis Harry R., Elements of Theory of Computation, PHI (1997)



41/53

Data Base Administration

Introduction: Describe the basic concepts of a relational database, Know core database

administrator tasks

Installing Oracle Database 10g Software ,Create an Oracle Database, Database

interfaces: Use structured query language (SQL), Use Procedural Language/Structured

Query Language (PL/SQL), Use Java, Use the Oracle C++ Call Interface

(OCCI) ,Controlling the database: Start and stop the agent, Start and stop the enterprise

manager database console , Start and stop the listener, Startup and shutdown the

database

Storage Structures management ,Administering users: Create and manage databaseuser accounts, Create and manage roles, Grant and revoke privileges ,Managing

Schema Objects: Create and modify tables, Define constraints, View the attributes of a

table, View the contents of a table, Create indexes and views ,Managing Data:

Manipulating data through SQL, Using Import, Using Export, Using SQL Loader.

PL/SQL: Identify PL/SQL objects, Understand triggers and triggering events, Identify

configuration options that affect PL/SQL performance

Oracle Database Security: Apply the principal of least privilege, Manage default user

accounts, Implement standard password security features and Audit database activity.

Oracle Net Services: Understand Oracle Net concepts, Use Oracle Net Manager to

create and configure listeners, Use the listener control utility to control the Oracle Net

Listener, Use the Oracle Net Manager to configure client and middle-tier connection, Use

TNSPING to test Oracle Net connectivity

Performance Monitoring and Proactive Maintenance: Troubleshoot invalid and

unusable objects, Gather optimizer statistics, View performance metrics, React to

performance issues, Set warning and critical alert thresholds, Collect , Undo

Management: Monitor and administer undo, Configure undo retention, and Guarantee

undo retention, Use the undo advisor ,Monitoring and Resolving Lock Conflicts: Types

of locks, Detect and resolve lock conflicts, Manage deadlocks

Backup and Recovery Concepts: Describe the basics of database backup, restore and

recovery, List the types of failure that may occur in an Oracle Database, Database

backups: Create consistent database backups, Back your database up without shutting it



42/53

down, Create incremental backups, Automate database backups, Monitor the flash

recovery area,

Database Recovery: Recover from loss of a control file, Recover from loss of a redo log

file, Recover from loss of a data file.

Laboratory Work: Laboratory work will be based on Oracle Installation, managing oracle

Instance/ Database, database Storage structure, Schema Objects, and Oracle Net

Services. Also practicals will be undertaken on user administration, security, SQL and

utilities, Proactive Database and implementation of database recovery.

Text Books

1. John Watson (OCP) and Damir Bersinic, Oracle 10g Database OCP Certification

All-in-One Exam Guide, Tata McGraw Hill (2005).

2. Kevin Loney, Oracle Database 10g DBA Handbook, McGraw-Hill (2004).3. Sam Alapati, OCP Oracle Database 10g: New Features for Administrators Exam

Guide, Oracle Press (2004)

Reference Books

1. Gavin Powell, Carol McCullough-Dieter, Oracle 10g Database Administrator:

Implementation and Administration, Thomson Course Technology (2006).

2. Doug Stun ,Tim Buterbaugh and Bob Bryla, Oracle 10g Administration, BPB

Publication (2005).



43/53

Artificial Intelligence and Applications

Introduction to expert systems, various subsets of expert systems as AI, ANNs, Fuzzy

Set theory, the differences & comparisons of various theories

Introduction and Overview of AI: Historical foundations, development of logic, turning

test, problem spaces, problem characteristics, characteristics of intelligent algorithm,

structures and strategies for state space search.

Problem Solving Techniques: Heuristic search, A* algorithm, AO* algorithm, generate

and test, hill climbing. Problem reduction, Constraint propagation

Knowledge representation: predicate logic, resolution in predicate logic, questionanswering, theorem proving.

Semantic networks, Frames and scripts, conceptual graphs. Game playing: Minimax

and alpha beta procedures

Natural language Processing: role of knowledge in language understanding, the natural

language problem, syntax, specification and parsing using context free grammar.

Fundamentals of Neural Networks, Supervised and Unsupervised Learning, learning

tasks & learning strategies, single layer & multiplayer Perceptions, Back propagation,

Hopfield nets, Adaptive resonance theory , Recent trends and Future Directions

Fuzzy set Theory: Introduction, Basic definitions & terminology, Fuzzy union, intersection,

complement. Fuzzy rules, relations & principles, Fuzzy inference systems

Laboratory Work: Programming in Prolog to implement Arithmetic operators, List

Processing, Defining Human Relationships, Cut Operations, Files, Trees, Graphs and

Natural Language Processing. Implementation of Heuristic and Minimax Searches using

C/C++/Java.

Text Books

1. Dan W, Introduction to Artificial and Expert Systems, PHI (1996)

2. Luger, G. F., Artificial Intelligence, Pearson Education (2004)



44/53

Parallel and Distributed Computing

Introduction: Parallel Computing Basic concepts and key issues, Classification, Serial

versus parallel processing, Parallel processing applications.

Program and Network Properties: Conditions of Parallelism, Hardware versus Software

Parallelism, Program partitioning and scheduling- Grain size/granularity, Latency, Levels of

parallelism, Grain packing and scheduling, Program flow mechanisms- Control follow, Data

flow, Demand-driven, System Interconnect Architectures- Network characteristics, Static

networks and dynamic networks. Performance metrics and measures.

Architecture: Single Instruction Multiple Data (SIMD) and Multiple Instruction Multiple

Data (MIMD) architectures, Shared memory multiprocessors: uniform memory access(UMA), non-uniform memory access (NUMA) and cache only memory access (COMA)

model, Distributed memory multicomputers. Synchronization, Cache coherence problem.

Distributed computing issues, message passing model, Remote Procedure Calls. Parallel

languages

Algorithms: Parallel algorithms- Broadcast & reduction- Task partitioning & load

balancing.

Laboratory Work: Simulation of SIMD/MIMD architectures using PVM/MPI.

Text Books

1. Hwang K., Advanced Computer Architecture: Parallelism, Scalability,

Programmability, Tata McGraw Hill (2004)

2. Sasikumar M., Shikhare D., Ravi Prakash P., Introduction to Parallel Processing,

Prentice Hall India (1999).

Reference Books

1. Hwang K., Briggs F. A., Computer Architecture and Parallel Processing, McGraw-

Hill (2002)

2. Kumar Vipin, Grama Ananth, Gupta Anshul and Karypis George, Introduction to

Parallel Computing, Pearson Education (2003).



45/53

Visual Programming using VC++

Introduction to Visual programming: Introduction of popular visual programming tools.

VC++ as sample language for visual programming. Introduction to VC++ development

environment-IDE, Compiler, linker.

Concepts: Program development using Object Oriented Approach, Windows

Programming basics, Comparative View: C++ vs. VC++

Programming in VC++: Creation of various kinds of projects in VC++ without and with

project wizard. Introduction to Object Orientation, Class definition in C++: Aggregation

Inheritance Function & Operator Overloading, Input - Output streams, Exception handling.

Basics of Windows Programming: Win API, Resource editor, Programming with MFC

Windows XP/Vista and NT programming techniques. Introduction to ActiveX component

development using VC++.

Web Forms & Web Services: Creating a Web Form Project, Develop a Web Services

Project, Access a Web Service from a Web Forms Project, Delete, Exclude, or Remove

Solution, Project, or Folder Items using Java/ .NET Technologies.

Laboratory Work: The lab work will be based on the general programming, windows

programming in VC++ and programming using .NET technologies.

Text Books

1. Swanke John, Visual C++ MFC Programming by Example, McGraw Hill (1999)

2. Pearce, Windows Programming Using MFC, Addison Wesley (2004).

Reference Books

1. Deitel H. M., Getting Started with Microsoft Visual C++ 6 with an Introduction toMFC, Prentice Hall (2000).

2. Archer, Extending MFC Applications with .NET Framework, Addison Wesley (2003).



46/53

Image Processing and Computer Vision

Introduction: Image analysis and computer vision, Imaging systems, Fundamental Steps

in Image Processing, Elements of Digital image processing systems, Sampling and

quantization, some basic relationships like neighbours, connectivity, Distance measure

between pixels, Imaging Geometry.

Image Transforms: Discrete Fourier Transform, Some properties of the two-dimensional

Fourier transform, Fast Fourier transform, Inverse FFT, Wavelet transforms.

Image Enhancement: Spatial domain methods, Frequency domain methods,

Enhancement by point processing, Spatial filtering, Lowpass filtering, Highpass filtering,

Homomorphic filtering, Colour Image Processing.

Image Restoration: Degradation model, Diagnolization of Circulant and Block-Circulant

Matrices, Algebraic Approach to Restoration, Inverse filtering, Wiener filter, Constrained

Least Square Restoration, Interactive Restoration, Restoration in Spatial Domain.

Image Compression: Coding, Interpixel and Psychovisual Redundancy, Image

Compression models, Error free comparison, Lossy compression, Image compression

using wavelets, Image compression standards.

Image Segmentation: Detection of Discontinuities, Edge linking and boundary detection,

Thresholding, Region Oriented Segmentation, Motion based segmentation.

Representation and Description: Representation schemes like chain coding, Polygonal

Approximation, Signatures, Boundary Segments, Skeleton of region, Boundary

description, Regional descriptors, Morphology.

Recognition and Interpretation: Elements of Image Analysis, Pattern and Pattern

Classes, Decision-Theoretic Methods, Structural Methods, Interpretation.

Laboratory Work: The lab work will be based on operations on images. The programs will

be based on image enhancement, image zooming, image cropping, image restoration,

image compression and image segmentation etc.

Text Books

1. Gonzalez R. C., and Woods R. E., Digital Image Processing, Pearson Education(2007).



47/53

2. Umbaugh S. E, Computer Vision and Image Processing: A Practical Approach

Using CVIPtools, Prentice Hall (1998)

Reference Books

1. Gonzalez R. C., and Woods R. E., Digital Image Processing using MATLAB,

Pearson Education (2004)2. Pratt W.K., Digital Image Processing, John Wiley (1991).



48/53

System Programming

Introduction to System Software: Machine Structure, evolution of operating system,

machine language.

Assembler: Elements of Assembly Language Programming, General design procedure,

design of a Two Pass Assemblers, A Single Pass Assemblers Design.

Table Processing: Searching & Sorting.

Macro and Macro Processors: Macro instructions, Features of a macro Facility: macro

Instruction arguments, Conditional macro expansion, Macro calls within macros, Macro

instruction defining macros, Advanced Macro Facilities, Implementation of simple macroprocessor, Two-pass algorithm, Implementation of macro calls within macros,

Implementation within an assembler.

Loaders: Loader scheme, absolute loaders, Subroutine linkages, Relocating loaders,

Direct linking loaders, binders, linking loaders, overlays, Dynamic Binders, Design of an

Absolute Loader, Design of a Direct-Linking Loader.

Compilers: Phases of Compiler Construction, Symbol Table, Top-down and bottom-up

Parsing, Operator-Precedence Parsing, LR Parsers, Code Generation and Code

Optimization, Memory management, Design & other issues.

Laboratory Work: Lab work will be based on the development of system software like

assembler, Lexical Analyzer, Parser, macro processor, binder, linker, loader.

Text Books

1. Donavan J., System Programming, Tata McGraw Hill (1993)

2. Dhamdhere D. M., System Programming and Operating System, Tata McGraw Hill(2007).

Reference Books

1. Beck L., System Software, Addison Wesley Publication (1996).

2. Aho A. V., Ullman J. D., Sethi R., Compilers Principles, Techniques and Tools,

Pearson Education (2005).



49/53

Data Mining and Data Warehouse

Introduction: Data Warehousing, Characteristics of a Data Warehouse, Data marts and

Data mining.

Developing Data Warehouse: Building a Data Warehouse, Data Warehouse architectural

strategies, Design considerations, Data content , metadata, distribution of data, Tools for

Data Warehousing, performance considerations, Crucial decisions in Designing a Data

Warehouse, various technological considerations.

Developing Data Mart based Data warehouse: Types of Data Marts, Loading a Data

Mart, Metadata for a data Mart, Data Model for a Data Mart, Maintenance of a Data Mart,

Nature of Data in Data Mart, Software components for a Data Mart, Tables in Data Mart,External Data, Reference Data, Performance issues, Monitoring requirements for a Data

Mart, Security in Data Mart.

OLTP and OLAP Systems: Data Modeling, Star Schema for multidimensional view, multi

fact star schema, categories of OLAP tools, Managed Query Environment

Data Mining: Introduction, From Data Warehouse To Data Mining, Steps Of Data Mining

Process, Types Of Data Mining Tasks, Data Mining Algorithms Viz. Classification,

Association Rules And Clustering, Database Segmentation, Predictive Modeling, Link

Analysis, Tools For Data Mining.

Laboratory Work: Applications of Data Warehousing and Data Mining, Case studies of

Data Warehousing in Indian Railway reservation system and other industrial use.

Text Books

1. Inmon W. H,. Building the Data Warehouse,, John Wiley (2002).

2. Inmon W. H., Developing the Data Warehouse, John Wiley (1996).3. Mattison, Data Warehousing and Knowledge Management, Tata McGraw Hill (1999)

Reference Books

1. Inmon W.H., Managing the Data Warehouse, , C.L.Gassey, John Wiley (1999

2. Fayyad, Usama M, Advances in knowledge discovery and Data Mining., MIT Press

(1996).

3. Jiawei Han, Micheline Kamber, Data Mining: Concepts and Techniques, Morgan

Koffman Elsvier (2000).



50/53

Soft Computing

Neural Networks: History, overview of biological Neuro-system, Mathematical Models of

Neurons, ANN architecture, Learning rules, Learning Paradigms-Supervised,

Unsupervised and reinforcement Learning, ANN training algorithms-perceptions, Training

rules, Delta, Back Propagation Algorithm, Multilayer Perceptron Model, Hopfield Networks,

Associative Memories, Applications of Artificial Neural Networks to different problems

Fuzzy Logic: Overview of Classical Sets introduction to Fuzzy Logic, Classical and Fuzzy

Sets:, Membership Function, Fuzzy rule generation.

Operations on Fuzzy Sets: Compliment, Intersections, Unions, Combinations of

Operations, aggregation Operations.

Fuzzy Arithmetic: Fuzzy Numbers, Linguistic Variables, Arithmetic Operations on

Intervals & Numbers, Lattice of Fuzzy Numbers, Fuzzy Equations.

Introduction of Neuro-Fuzzy Systems, Architecture of Neuro Fuzzy Networks.

Applications of Fuzzy Logic: Medicine, Economics etc.

Genetic Algorithm: An Overview of GA, GA operators, GA in problem solving,

implementation of GA.

Laboratory Work: Design and implementation of neural networks, genetic algorithms in

various search problems.

Text Books

1. Anderson J. A., An Introduction to Neweal Networks, PHI (2005)

2. Min Fu Li, Neural networks in Computer intelligence, Tata McGraw Hill 2003Reference Books

1. G.J. Klir and B. Ynan, Fuzzy Sets and Fuzzy Logic, PHI (1997).

2. Raj-asekaran, G.A. vijaylakshmi Pai, Neural Network, Fuzzy Logic and Genetic

algorithms- Symthesis and Application, PHI (2001).



51/53

Wireless Networks and Mobile Computing

Introduction to wireless networking, advantages and disadvantages of wireless networking,

Characteristics of radio propagation, Fading, multipath propagation.

Wireless Communication systems- Evolution of mobile communication generations,

Cellular Concept- Frequency reuse, Channel assignment strategies, Handoff strategies,

Interference and system capacity, Trunking and grade of services, Improving coverage and

capacity in cellular systems.

Medium Access Control: MAC protocols for digital cellular systems such as GSM, MAC

protocols for wireless LANs such as IEEE 802.11,a, b, g and HIPERLAN I and II, The near

far effect, Hidden and exposed terminals, Collision Avoidance (RTS, CTS) protocols.

Bluetooth: Radio specification, baseband specification, Link manager specification,

Logical link control and adaptation protocol.

Transport over wireless networks: Introduction, TCP over wireless networks,

Approaches to improve transport layer performance.

Security and Fraud detection in Mobile and wireless networks, Mobile adhoc networks.

Laboratory: The lab work will be based on the configuration of wireless LANs using

access points, routers etc, implementation of WAP protocol stack, wireless programming

using Bluetooth, RFID, GSM and Wi-Fi development kits etc.

Text Books

1. Stallings W., Wireless Communications and Networks, Pearson Education (2005)

2. Stojmenic I., Handbook of Wireless Networks and Mobile Computing, John Wiley

(2002).3. Rappaport T.S., Wireless Communications- Principle and Practices, PHI (2002).

Reference Books

1. Lin Yi Bing and Chlamtac Imrich, Wireless and Mobile Network Architectures, John

Wiley (2000).

2. Pandya R., Mobile and Personal Communications Systems and Services, PHI

(2004).



52/53

J2EE and Applications

Integrated Application Development: Introduction to Integrated Application

Development, Web Server Versus Application Server.

Servlets and Java Server Pages (JSP): MVC (Model View Controller) Architecture,

Servlet, Servlet life cycle, web application structure, Session management, Handling

cookies, Creating war files, JDBC, JSP elements - declaration, directive, scriplet,

expression, and action, JSP Architecture and implementation, Java Beans, JSP Bean

tags, JSP session handling, JSP Authentication, Introduction to JSTL (JSP Standard Tag

Library), JSTL Expression Language (EL), Miscellaneous Tags, Writing a Custom Tag

Library

Web Application Frameworks: Java Server Faces (JSF) and Struts architecture, Struts

classes Action Forward, Action Form, ActionServlet, Action classes, config.xml, Action

Mappings, Struts flow, Combining Struts and Tiles, Building and using tiles, Creating a

Definition in XML file and deploying, JSF specification and API Javadoc

Enterprise JavaBeans (EJB) Fundamentals: Enterprise JavaBeans Communication,

EJB Details, Session Beans, Entity Bean, Message Driven Bean, Writing Beans, EJB

Development Overview, The Enterprise Bean Class, The Remote Interface, The Home

Interface, Deployment Descriptors and EJB-JAR files, Writing an EJB Client, Persistence

Advanced Concepts and Technologies: Introduction to Java Message Service (JMS),

Portal Server and Portlet architecture, Advanced J2EE Security, Performance, Profiling

Technologies and Tools, IDEs and Development Tools, Xdoclet, J2EE App Server

Products, Web Services support, Internationalization and localization, Rich client

Hibernate, Spring framework, Web services, SOA, SOAP, AXIS, WSDL, UDDI, Endpoint,

Callback, AJAX etc.

Laboratory Work: Implementation of JNI, Servlets, Java Server Pages, JDBC, Session

beans, Entity beans and JSF and Struts Based applications development etc.

Text Books

1. Alur Deepak, Malks Dan and Crupi John, Core J2EE Patterns: Best Practices and

Design Strategies, Prentice Hall India (2001)

2. Horton I., Beginning J2EE 1.5, SPD (2005).

Reference Books



53/53

1. Austin and Pawlan, Advanced Programming for JAVA 2 Platform, Pearson

Education (2004)

thapar mca syllabus.pdf

Documents