Professional Documents
Culture Documents
SEMESTER – I
MCA - 1 SEMESTER
L T P Total Credits-4
4 0 0 4 Duration of Exam- Three hours
Programming and problem solving: Basics of Computer organisation, High level and low level
languages, Steps involved in computer programming, Developing algorithms and flow charts,
Pointers, Pointers and Arrays, String Handling, Functions and pointers, Dynamic
Memory Allocation.
User defined data types – Structures and Unions, Bit Fields, Array of Structures,
Structures with arrays.
Suggested References
1. The C Programming Language, Second Edition, Brian W. Kernighan and Dennis
M. Ritchie, PHI, New Delhi.
2. C++ The Complete Reference, Herbert Schildt, Tata McGrawHill, 2005.
3. Programming with C, Gottfried & J.K. Chhabra, Schaum’s Series, McGraw Hill.
4. E. Balagurusamy, Programming in ANSI C, 2004, McGrawHill, New Delhi
DEPARTMENT OF COMPUTER APPLICATIONS, NIT Kurukshetra
MCA - 1 SEMESTER
L T P Total Credits-4
4 0 0 4 Duration of Exam- Three hours
Arithmetic and Logic Unit, Instruction Sets, Types of operands and operations,
Addressing modes, Register Organization, Simple ALU design, Instruction cycle and
pipelining.
Peripheral Devices, Data Transfer Techniques- Programmed I/O, Interrupt Driven and
DMA, I/O Processors, Asynchronous Data transfer.
Suggested References
MCA - 1 SEMESTER
L T P Total Credits-4
4 0 0 4 Duration of Exam- Three hours
Algebraic System
Definitions and elementary properties of algebraic structures, Semigroups, monoids
and submonoids, Groups and subgroups, Homomorphisms and Isomorphisms of
Monoids and Groups, Definition and Examples of Rings and Subrings, Types of
Rings, Commutative Ring, Ring with Unity, Ring with or without Zero divisions,
Integral Domain, Division Ring, Relation of Isomorphism in the set of rings, Field, its
characteristics and subfield.
Suggested References
MCA - 1 SEMESTER
L T P Total Credits-4
4 0 0 4 Duration of Exam- Three hours
8085 Microprocessors
Microprocessors and Microcomputers, 8085 Microprocessor Architecture, Timing and
Control unit, Machine cycles, Interrupts.
8086 Microprocessors
Salient features of x86 architecture, Addressing modes and basic operations.
Suggested References
L T P Total Credits-4
4 0 0 4 Duration of Exam- Three hours
File Processing Operations: Physical and Logical files, Opening, reading & writing and
closing files in C, seeking and special characters in files, Physical devices and logical
files, file related header files in C.
Secondary Storage : Disks – Organization, tracks, sectors, blocks, capacity, non-data
overhead, cost of a disk access, Magnetic tape, disk vs tape, CDROM – CDROM as a file
structure, Physical Organization, strengths and weakness of CD-ROMS, Storage
hierarchy.
Byte Journey and Buffer Management: File Manager, IO Buffer, IO Processing, Buffer
strategies and bottlenecks.
File Structure concepts: A stream file, field structures, reading a stream of fields, record
structures and that uses a length indicator, Mixed numbers and characters – use of a hex
dump, reading the variable length records from the file.
Managing records in C files: Retrieving records by keys, sequential search, direct access,
choosing a record structure and record length, header records, file access and file
Organization.
Organizing files for performance: Data compression, reclaiming space – record deletion
and storage compaction, deleting fixed – length records for reclaiming space
dynamically, deleting variable – length records, space fragmentation and replacement
strategies.
Indexing: Index, a Simple index with an entry sequenced file, basic operations on an
index, entry sequenced file, indexes that are too large to hold in memory, indexing to
provide access by multiple keys, retrieval using combination of secondary keys,
improving the secondary index structure – inverted lists
Index Sequential files : Access and prefix B+ trees – Simple index to the sequence set,
the content of the index : separators instead of keys, the simple prefix B+ tree, simple
prefix B+ tree maintenance, index set block size, internal set block size, the internal
structural of index set blocks : a variable order B-tree, loading a simple prefix B+ tree.
Hashing: Collisions in hashing, a simple hashing algorithm, function and record
distributions, memory requirements, collision resolution by progressive overflow,
buckets, deletion, Extendable hashing: Working of extendable hashing, implantation,
deletion, extendable hashing performance
Suggested References
1. File Structures – An Object Oriented Approach with C, Muchael J Folk, Bill
Zoellick and Greg Riccardi , Addission Wesley
2. M.E. Loomis: Data Management and File Structures, 2nd Ed. PHI. 1997.
DEPARTMENT OF COMPUTER APPLICATIONS, NIT Kurukshetra
MCA - II SEMESTER
SEMESTER – II
MCA - II SEMESTER
L T P Total Credits-4
4 0 0 4 Duration of Exam- Three hours
Review of data types: Scalar types – Primitive types, Enumerated types, Subranges
Structures types – Character strings, arrays, records, sets, files. Data abstraction.
Complexity of algorithms: Time and space complexity of algorithms using “big oh”
notation.
Recursion: Recursive algorithms, Analysis of recursive algorithms.
Linear data structures: Stacks, queues, lists. Stack and queue implementation using
array, linked list. Linked list implementation using pointers.
Non linear Structures: Graphs, trees, sets. Graph and tree implementation using array
linked list. Set implementation using bit string, linked list.
Searching: Sequential Search – Searching arrays and linked lists. Binary Search –
Searching arrays and binary search trees. Hashing – Introduction to simple hash
functions, resolution of collisions.
Sorting : n2 Sorts – Bubble sort, insertion Sort, selection sort. nlogn sorts – quick sort,
heap sort, merge sort. External sort – merge files.
Suggested References
1. Sahni S., Data Structures, Algorithms, and Applications in C++, Mc Graw Hill,
Singapore, 1998.
2. Cormen T.H., Leiserson C.E, and Rivest R.L., Introduction to Algorithms,
Prentice Hall India, New Delhi, 1990.
DEPARTMENT OF COMPUTER APPLICATIONS, NIT Kurukshetra
MCA - II SEMESTER
Classes, Constructors, Friend Class: Introduction, Comparing class with Structure, Class
Scope, Accessing Members of a class, Constructor, Destructor, Const objects, Const
member functions, Friend class, Friend function, This pointer, Data abstraction and
Information hiding, container classes and Iterators.
Virtual functions, Streams, Files: Introduction, Type fields and switch statements, Virtual
functions, Abstract base classes and concrete classes, Polymorphism, Dynamic binding,
Virtual destructors. C++ Stream I/O: Streams, Stream Input, Stream Output, Unformatted
I/O, Stream manipulators, Stream format states, Stream error, States.
Files: File Operations –File pointers, error handling during file Operations
Templates & Exception Handling: Templates, Function templates, Class templates,
Overloading template functions, Class template and non type parameters –Templates
with Multiple parameters. Exception Handling: When exception handling, Basic of C++
exception, Catching an exception, re throwing an exception, exception specifications.
Namespace: Introduction to Namespace
Suggested References
1. Deitel H.M. & Deitel P.J., “How to Program C++”, PHI, 2003
2. AL Stevenes, “C++ Programming”, Wiley Dreamtech, 2003.
3. Herbert Scheldt, “C++, The Complete Reference”, 2003.
4. E. Balagurusamy, “Object Oriented Programming with C++”, 2nd Edition., 2001.
DEPARTMENT OF COMPUTER APPLICATIONS, NIT Kurukshetra
MCA - II SEMESTER
Structured programming, its need and design issues, block structures, types, variables,
binding, types of binding, type checking, strong typing, type conversion, named constant,
principle data types, character string, user defined data types, pointer and reference.
Suggested References
1. T.W. Pratt, Programming Languages: Design & Implementation, PHI, 3rd Ed.
2. Ravi Sethi, “Programming Languages – Concepts and Constructs”, Addison
Wesley, 1989.
DEPARTMENT OF COMPUTER APPLICATIONS, NIT Kurukshetra
MCA - II SEMESTER
Types of Operating Systems (OS), historical evolution of operating systems, Real time
systems, Distributed systems. OS concepts – Processes, Files, System calls, Shell,
Interrupt mechanisms.
File Systems: Functions of the system, File access and allocation methods, Directory
Systems: Structured Organization, directory and file protection mechanisms,
implementation issues; hierarchy of file and device management.
Suggested References
1. Peterson, J.L. & Silberschatz, A.: Operating System Concepts, Addison, Wesley-
Reading.
2. Silberschatz Galvin – “Operating system concepts” – John Wiley & Sons – 2004
DEPARTMENT OF COMPUTER APPLICATIONS, NIT Kurukshetra
MCA - II SEMESTER
L T P Total Credits-4
4 0 0 4 Duration of Exam- Three hours
Suggested References
SEMESTER – III
L T P Total Credits-4
4 0 0 4 Duration of Exam- Three hours
Basic Concepts
What is database system, why database, Data independence, 3 levels of architecture;
external level, conceptual level, internal level, mapping DBA, DBMS, organization of
databases, components of DBMS, Data Models, Relational Models, Networks data
model, Hierarchical Model, semantic data model.
Relational Model
Introduction – Relational Model, base tables & views, relations, domains, candidate keys,
primary key, alternate keys, foreign key, Integrity rules, relational Operators – relational
algebra, relational calculus, Data Base Design – Introduction, Basic Definitions, Non-loss
decomposition and functional dependencies, 1NF, 2NF, 3NF, BCNF, MVD & 4NF, JD &
5NF, Normalization procedure, other normal forms.
SQL: Data definition, Constraints, & Schema Changes in SQL, insert, Delete and update
statements, View in SQL, Specifying constraints and Indexes in SQL, Queries in SQL.
Concurrency
Transaction concept, transaction state, concurrent executions, serializability lock based
protocols, timestamp based protocols, validation based protocols, deadlock handling.
Suggested References
1. C.J. Date: An Introduction to Database systems 7th Ed. Addison Wesley, Indian
Edition, 2000.
2. A.K. Majumdar and Bhattacharyya: Database Management Systems, THM, 1996.
3. A Silberschatz, H.F. Korth & S. Sudarshan: Data Base System Concepts, TMH, 1997.
4. S. B. Navathe, R. Elmasri: Fundamentals of database
DEPARTMENT OF COMPUTER APPLICATIONS, NIT Kurukshetra
Introduction
Introduction to Software crisis & Software processes; Software life cycle models – Build
& Fix, waterfall prototype evolutionary, spiral model.
Software Design
What is design? Modularity, strategy of design, function oriented design, object oriented
design.
Software Metrics
Introduction, size metrics, data structure metrics, information flow metrics, entropy-based
measures, metric analysis.
Software Reliability
Importance, Software reliability & Hardware reliability, failures & faults, reliability
concepts, reliability models – macro, basic, logarithmic Poisson, calendar time
component, micro models; estimating number of residual errors; reliability allocation.
Software Testing
Introduction, Functional testing, structural testing, activities during testing, debugging,
testing tools.
Software Maintenance
Introduction, types of maintenance, maintenance process, maintenance models, reverse
engineering, re-engineering.
Suggested References
1. K.K.Aggarwal, Yogesh Singh: Software Engineering, New Age International Ltd,
2001.
2. R.S. Pressman, Software Engineering – A Practitioner’s Approach, 5th Ed, TMH,
2000.
3. Ian Sommerville, Software Engineering, 4th Ed., Addison Wesley.
DEPARTMENT OF COMPUTER APPLICATIONS, NIT Kurukshetra
Introduction
Network Functions, Network Topology, Network Services, Switching Approaches,
Transmission media and systems, multiplexing and signaling techniques, Error detection
and correction, ISDN and BISDN
Layered Architectures
Examples, OSI Reference Model, Overview of TCP/IP architecture, Socket system calls,
SNMP, Electronic Mail.
Peer-to-Peer Protocols
Protocols, Service Models and End-to-End requirements, ARQ, Sliding Window, RTP,
HDLC, PPP protocols, Statistical Multiplexing.
TCP/IP
Architecture, Internet protocols – IP packet, Addressing, Subnet addressing, IP routing,
CIDR, ARP, RARP, ICMP, Reassembly, IPv6, UDP, Transmission Control Protocol –
TCP, Reliable stream service, operation, protocol, DHCP, Mobile IP, Internet Routing
protocols, Multicast Routing.
Suggested References
1. Leon Garcia and Indra Widjaja: Communication Networks – Fundamental Concepts
and Key Architectures, TMH, 2000.
2. A.S. Tanenbaum: Computer Networks, 3/e, PHI, 1997.
3. Forouzan, Coombs and Fegan: Introduction to Data Communications and Networks,
TMH, 1999.
4. William Stallings: Data and Computer Communications 5/e, PHI.
DEPARTMENT OF COMPUTER APPLICATIONS, NIT Kurukshetra
Visual Basic
Concepts of Object based Event Oriented Languages, Visual Architecture: Method,
Statement, Properties and Events; Basic concept of Visual Program Design and
comparison with Non-Visuals.
Designing a VB application: Working with VB forms and managing forms at run time,
coding event procedures, implementing drag and drop operations, menu designing.
Visual C++
Windows basic concepts, window API, DEF files, creating windows, message, Mouse
and keyboard. Introduction to resources, designing and creating menus, pop-up menus,
user defined resources. Bitmaps and dialogues; windows animation; font basics; window
controls; font display; static controls, edit controls, list boxes.
Suggested References
1. Visual Basic – 6 by Howard Hawee PHI
2. Teach yourself Visual Basic by Warner TMH
3. Mastering VB – 6 by Evangelos Petroutsos TMH
4. Programming inVB – 6 by J C Bradley TMH
5. VB – 6 The Complete Reference by Jerks TMH
6. Windows Programming by Charles Petzol
7. Windows Programming by Jim Conger.
8. Visual C++ by Yashwant Kanetkar.
DEPARTMENT OF COMPUTER APPLICATIONS, NIT Kurukshetra
L T P Total Credits-4
4 0 0 4 Duration of Exam- Three hours
HTML Basic Concepts, Good Web Design, Process of Web Publishing, Phases of Web
Site development, Structure of HTML documents, HTML Elements – Core attributes,
Language attributes, Core Events, Block Level Events, Text Level Events, Linking
Basics, Linking in HTML, Images and Anchors, Anchor Attributes, Image Maps,
Semantic Linking Meta Information, Image Preliminaries, Image Download Issues,
Images as Buttons, Introduction to Layout: Backgrounds, Colors and Text, Fonts, Layout
with Tables. Advanced Layout: Frames and Layers, HTML and other media types.
Audio Support in Browsers, Video Support, Other binary Formats. Style Sheets,
Positioning with Style sheets. Basic Interactivity and HTML: FORMS, Form Control,
New and emerging Form Elements.
C#.NET — Variables, Operators and Expressions, Writing Methods and Applying Scope,
Decision statements, Iteration statements, Managing errors and Exceptions values and
references, Value types with enumerations and Structures, Arrays and Collections
parameter arrays, Inheritance, Garbage collection and Resource management.
Suggested References
MCA - IV SEMESTER
SEMESTER – IV
List of Electives
MCA - IV SEMESTER
L T P Total Credits-4
4 0 0 4 Duration of Exam- Three hours
An overview of Java: - Java features how java differs from C & C++, data types,
constants & variables, operators & expressions, control structure in java, classes, objects
& methods, arrays, strings & vectors introduction to Java Design patterns.
Suggested References
1. Ivor Horton 1.Beginning Java 2 – JDK 5 Edition, Wiley-India
2. Mark Grand Patterns in Java Vol. 1-3, Wiley-India
3. Steve Holzner Java 2 (JDK 5 Edition) Black Book Wiley-India
4. B. Eckel Thinking in JAVA, Pearson Education.
5. Deitel & Deitel How to Program JAVA. Pearson Education.
DEPARTMENT OF COMPUTER APPLICATIONS, NIT Kurukshetra
MCA - IV SEMESTER
1. Linux Startup
User accounts, accessing linux – starting and shutting processes, Logging in and Logging
out, Command line, simple commands
2. Shell Programming
Unix file system: Linux/Unix files, inodes and structure and file system related
commands, Shell as command processor, shell variables, creating command substitution,
scripts, functions, conditionals, loops, customizing environment
4. The C Environment
The C compiler, vi editor, compiler options, managing projects, memory management,
use of makefiles, dependency calculations, memory management – dynamic and static
memory, building and using static and dynamic libraries, using ldd, soname, dynamic
loader, debugging with gdb
5. Processes in Linux
Processes, starting and stopping processes, initialization processes, rc and init files, job
control – at, batch, cron, time, network files, security, privileges, authentication,
password administration, archiving, Signals and signal handlers, Linux I/O system
Suggested References
1. John Goerzen: Linux Programming Bible, IDG Books, and New Delhi, 2000.
2. Sumitabha Das: Your Unix – The Ultimate Guide, TMH, 2000.
3. Mathew: Professional Linux Programming, vol.1 & 2, Wrox-Shroff, 2001.
4. Welsh & Kaufmann: Running Linux, O’Reiley & Associates, 2000.
DEPARTMENT OF COMPUTER APPLICATIONS, NIT Kurukshetra
MCA - IV SEMESTER
INTRODUCTION
Suggested References
1.Leland L. Beck," System Software — An Introduction to Systems Programming", 3rd
Edition, 1999, Addison Wesley.
2. D.M.Dhamdhare, "Systems Programming and Operating Systems", 2 Edition, 1997.
TMH.
3. Donovan J.J. "Systems Programming", 1972, McGraw Hill.
DEPARTMENT OF COMPUTER APPLICATIONS, NIT Kurukshetra
MCA - IV SEMESTER
INTRODUCTION
Data Mining-motivation, importance-DM Functionalities, Basic Data Mining Tasks, DM
Vs KDD, DM Metrics, DM Applications, Social implications.
DATA WAREHOUSING
Difference between Operational Database and Data warehouse-Multidimensional Data
Model: From tables to data Cubes, Schemas, Measures-DW Architecture: Steps for
design and construction of DW, 3-tier DW Architecture-DW Implementation: Efficient
computation of DATA Cubes, Efficient Processing of OLAP queries, Metadata
repository.
Suggested References
1.Jiawei I-lan, & Micheline kamber,"data mining: Concepts and Techniques". Harcourt
India Private Limited, First Indian Reprint,2001
2.Margaret H.Dunham,"Data Mining: Introductory and Advanced Topics”. Pearson
Education,First Indian Reprint,2003
3.Arun K. Pujari," Data Mining Techniques", University Press (India) Limited, First
Edition,2001
DEPARTMENT OF COMPUTER APPLICATIONS, NIT Kurukshetra
MCA - IV SEMESTER
L T P Total Credits-4
4 0 0 4 Duration of Exam- Three hours
Number Theory
Prime Numbers, Greatest Common Divisor, Euclidean algorithm, Modular Arithmetic,
Properties of Modular Arithmetic, Computing the inverse, Fermat’s Theorem, algorithm
for computing inverses, Random number generation
Hash Algorithms
Hash concept, description of Hash algorithms, Message Digest Algorithms such as MD4
and MD5, Secure Hash Algorithms such as SH1 and SHA2
DEPARTMENT OF COMPUTER APPLICATIONS, NIT Kurukshetra
Suggested References
MCA - IV SEMESTER
L T P Total Credits-4
4 0 0 4 Duration of Exam- Three hours
Law and policies, IT Act. Right for Information Act, Introduction to various Tax Payable,
Purchase and Tender procedures and E-filing of Information, Concepts of E-portals
Suggested References
MCA - IV SEMESTER
L T P Total Credits-4
4 0 0 4 Duration of Exam- Three hours
Strategies for marketing - creating web presence - identifying and reaching customers -
web branding - sales on the web - strategies for purchasing and support activities - EDI -
supply chain management - softwares for purchasing - strategies for web auctions -
virtual communities and web portals - international - legal - ethical and tax issues -
planning and managing e-commerce projects.
Implementation of sample E-Commerce model in .NET/ Enterprise Java
Suggested References
1. Kalakota R. & Whinston A.B., "Frontiers of Electronic Commerce", Addison-Wesley,
New Delhi
2. Schneider G. P. & Perry J. T., Electronic Commerce, Course Technology, Cambridge
3.Westland J. C. & Clark T.H. K., "Global Electronic Commerce", University Press,
2001.
4. Minoli D. & Minoli E., "Web Commerce Technology Handbook", Tata McGraw Hill,
New Delhi
5. Treese G.W. & Stewart L. C., "Designing Systems for Internet Commerce", Addison
Wesley, New Delhi
DEPARTMENT OF COMPUTER APPLICATIONS, NIT Kurukshetra
MCA – V SEMESTER
Proposed (2007-2010)
List of Electives:
MCA - V SEMESTER
L T P Total Credit 04
4 0 0 4 Duration of Exam- 03 hours
System Design: Design Phase Activities, Traditional and Object Oriented approach to
Design, Designing of Databases, UI, System Interfaces, Controls and Security.
Suggested References
1. John W.Satzinger, Robert B. Jackson and Shephon D.Burd: System Analysis &
Design, 2nd Ed., Course Technology Ptr, 2006.
2. James P.Clements and Jack Gido: Effective Project Management, Thomson Learning,
2007.
DEPARTMENT OF COMPUTER APPLICATIONS, NIT Kurukshetra
MCA - V SEMESTER
L T P Total Credits 04
4 0 0 4 Duration of Exam- Three hours
Suggested References
MCA - V SEMESTER
L T P Total Credits-4
4 0 0 4 Duration of Exam- Three hours
Run time system: Storage Organization, Activation Tree, Activation Record, Parameter
Passing, Symbol Table, Dynamic Storage Allocation.
Suggested References
1 A.H. Aho and J.D. Ullman: Principles of Compiler Design, Addison Wesley,1974.
2. J. Donovan: System Programming, TMH, 1972.
3. D.M. Dhamdhere: Compiler Construction- Principles and Practice, McMillan India.,
2001.
4. David Gries: Compiler Construction for Digital Computer, John Wiley & Sons, 1971.
5. Wilhelm and Maurer: Compiler Design, Addison-Wesley, 1995.
DEPARTMENT OF COMPUTER APPLICATIONS, NIT Kurukshetra
MCA - V SEMESTER
L T P Total Credits-4
4 0 0 4 Duration of Exam- Three hours
(Wireless) Medium Access Control: Motivation for a specialized MAC (Hidden and
exposed terminals, Near and far terminals), SDMA.
Publishing & Accessing Data in Air: Pull and push based data delivery models, Data
dissemination by broadcast, Broadcast disks, Directory service in air, Energy efficient
indexing scheme for push based data delivery.
File System Support for Mobility: Distributed file sharing for mobility support, Coda
and other storage manager for mobility support.
Mobile Transaction and Commerce: Models for mobile transaction, Kangaroo and
Joey transactions, Team transaction, Recovery model for mobile transactions, Electronic
payment and Protocols for mobile commerce.
Suggested References:
MCA –V SEMESTER
MCA-315 BIOINFORMATICS
L T P Total Credits-4
4 0 0 4 Duration of Exam- Three hours
Suggested References
MCA –V SEMESTER
L T P Total Credits-4
4 0 0 4 Duration of Exam- Three hours
ERP Modules and Vendors: Finance, Production Planning, Control and Management,
Sales and Distribution, Human Resources Management, Inventory Control System,
Quality Management, ERP market.
ERP Implementation Life Cycle: Evaluation and selection of ERP package, Project
planning and implementation, Team training and Testing, End User Training and Going
Live, Post Evaluation and Maintenance.
Suggested References:
MCA – VI SEMESTER
Proposed (2007-10)