KALINGA UNIVERSITY, NAYA RAIPUR (C.G.

Course of study and scheme of Examination

MASTER OF COMPUTER APPLICATIONS

2nd Semester

S. No Subject Code Subject Credit Internal Marks External Marks Total Marks

Theory of
1 MCA201 Automata & 3.0 30 70 100
Formal Languages

Object Oriented
2 MCA202 3.0 30 70 100
Programming

Operating
3 MCA203 3.0 30 70 100
Systems

Database
4 MCA204 Management 3.0 30 70 100
Systems

Data Structures &

5 MCA205 Analysis of 3.0 30 70 100
Algorithms

Object Oriented
6 MCA207P 2.0 20 30 50
Programming-Lab

Database
7 MCA208P Management 2.0 20 30 50
Systems-Lab

Data Structures &

8 MCA209P Analysis of 2.0 20 30 50
Algorithms-Lab

Elective Specialization:

1 MCA206A Web Technology 3.0 30 70 100

SEMESTER II
 MCA Total Marks: 100

Semester - II Internal Marks: 30

Paper Code. MCA201 External Marks: 70
Data and File Structures No. of Hours: 90
Total Credits: 03
Unit No. Details Nos. of Hours
1.1 Fundamentals of algorithm analysis Big ‘O’ notations, Time and space
complexity of algorithms,
1 1.2 linked lists: singly and doubly linked lists, stacks, queues, double stack, 20
multistacks and multiqueues, deques, polynomial arithmetic, infix, postfix
and prefix arithmetic expression conversion and evaluations.
2.1 Trees:
2.1.1 Binary trees: Definition, Binary Search Tree basic operations, Tree
2 Traversals (recursive and stack based non-recursive), Heaps and 20
priority queues, Threaded binary tree, AVL Trees BTree: need,
properties, creation, uses. B+ tree, B* tree.
3.1 Graphs:
3.1.1 Representation (Matrix and Linked), Traversals, Connected
components, Spanning trees, Shortest path and Transitive closure,
Topological sort, Activity network, Critical path, Path
Nenumeration. Dijkstra’s Algorithm, Floyd Warshall’s Algorithm,
3 Coloring of Graphs, Spanning Tree, Minimum Spanning Tree 25
Algorithms (Kruskal’s Algorithm, Prim’s Algorithm)
3.2 Searching & Sorting:
3.2.1 Binary search, Hash function, Hash table, Search tree. Internal
sort: Radixsort, Insertion sort, Selection sort, Shell sort, Quick
sort, Merge sort, Heap sort.
4.1 Files:
4.1.1 Sequential file organization, creating updating retrieving from
sequential files advantages and disadvantages of sequential file
organization.
4 4.1.2 Data representation and denisity, parity and error control 25
techniques, devices and channels, double buffering and block
buffering, handling sequential files in C language, seeking,
positioning, reading and writing binary files in C. External Sorting
and merging files k way and polyphase merge

Text books:
1. E. Horowitz and S. Sahani, “Fundamentals of Data Structures in C”, 2nd Edition, Universities
Press, 2008.
2. Mark Allen Weiss, “Data Structures and Algorithm Analysis in C”, 2nd Edition Addison-
Wesley, 1997.
References books:
1. Schaum’s Outline Series, “Data Structure”, TMH, Special Indian Ed., Seventeenth Reprint, 2009.
2. Y. Langsam et. al., “Data Structures using C and C++”, PHI, 1999.
3. N. Dale and S.C. Lilly, D.C. Heath and Co., “Data Structures”, 1995.
4. R. S. Salaria, Khanna, “Data Structure & Algorithms”, Book Publishing Co. (P) Ltd., 2002.
5. Richard F. Gilberg and Behrouz A. Forouzan, “Data Structure A Pseudocode Approach with C”,
Cengage Learning, 2nd Ed., 2005.
6. Mary E. S. Loomes, “Data Management and File Structure”, PHI, 2nd Ed., 1989.
 MCA Total Marks: 100

Semester - II Internal Marks: 30

Paper Code. MCA202 External Marks: 70
Object Oriented Programming in C++ No. of Hours: 90
Total Credits: 03
Unit No. Details Nos. of Hours
1.1 OOP Paradigm: Comparison of Programming paradigms,
Characteristics of Object-Oriented Programming Languages, Object-
based programming languages C++: Brief History of C++, Structure of a
C++ program, Difference between C and C++ - cin, cout, new, delete
operators, ANSI/ISO Standard C++, Comments, Working with Variables
1 and const Qualifiers. Enumeration, Arrays and Pointer. 20
1.2 Implementing oops concepts in c++ Objects, Classes, Encapsulation,
Data Abstraction, Inheritance, Polymorphism, Dynamic Binding,
Message Passing, Default Parameter Value, Using Reference variables
with Functions.
2.1 Abstract data types, Class Component, Object & Class, Constructors
Default and Copy Constructor,
2.2 Assignment operator deep and shallow coping, Access modifiers –
private, public and protected.
2.3 Implementing Class Functions within Class declaration or outside the
Class declaration. instantiation of objects,
2.4 Scope resolution operator, Working with Friend Functions,
2.5 Using Static Class members. Understanding Compile Time
2 Polymorphism function overloading Rules of Operator Overloading 25
(Unary and Binary) as member function/friend function,
2.6 Implementation of operator overloading of Arithmetic Operators,
Overloading Output/Input,
2.7 Prefix/ Postfix Increment and decrement Operators, Overloading
comparison operators, Assignment, subscript and function call Operator ,
concepts of namespaces.

3.1 Inheritance:
3.1.1 Inheritance, Types of Inheritance, Abstract Classes, Ambiguity
resolution using scope resolution operator and Virtual base class,
Aggregation, composition vs classification hierarchies,
Overriding inheritance methods, Constructors and Destructor in
derived classes. Multiple Inheritance.
3 3.2 Polymorphism: 25
3.2.1 Polymorphism, Type of Polymorphism – compile time and
runtime, Understanding Dynamic polymorphism: Pointer to
objects, Virtual Functions (concept of VTABLE) , pure virtual
functions, Abstract Class.
3.3 Advanced Input/Output, Exception Handling and Manipulating
strings, Using istream /ostream member functions, Using Manipulators,
 Creating Manipulator Functions, Understanding Implementation of Files,
Writing and Reading Objects. Understanding of working and
implementation of Exception Handling.
4.1 Generic Programming and mastering STL :
4.1.1 Understanding Generic Functions with implementation of
searching sorting algorithm. Overloading of Function Templates.
4.1.2 Understanding Class Templates using Implementation of Generic
stack, linked lists: singly and doubly linked lists, Binary Search
Tree basic operations.
4.1.3 Understanding Inheritance with Generic Class. Standard
Template Library:– Understanding Components of Standard
4 Template Library, 20
4.1.4 Working of Containers, Algorithms, Iteraters and Other STL
Elements. Implementation of Sequence and Associative
containers for different Algorithms using their Iterator.
Understanding of Algorithms Requiring Operations on the
element using function objects.
4.1.5 Implementing graph algorithm dfs, bfs, minimum spanning tree ,
dijkastra etc using STL

Text books:
1. A. R. Venugopal, Rajkumar, and T. Ravishanker “Mastering C++”, TMH, 1997.
2. S. B. Lippman and J. Lajoie, “C++ Primer”, 3rd Edition, Addison Wesley, 2000.
3. Bruce Eckel, “Thinking in C++”, President, Mindview Inc., Prentice Hall, 2nd Ed.

Reference Books:
1. D . Parasons, “Object Oriented Programming with C++”, BPB Publication.
2. Bjarne Stroustrup , “The C++ Programming Language”, Addison Welsley, 3rd Ed.
3. Steven C. Lawlor, “The Art of Programming Computer Science with C++”, Vikas Publication.
4. Schildt Herbert, “C++: The Complete Reference”, Tata McGraw Hill, 4th Ed., 1999.
5. Behrouz A. Forouan, Richrad F. Gilberg, Computer Science - A Structural Approach Using
C++”, Cengage Learning, 2004.
6. Nell Dale, “C++ Plus Data Structure”, Jones and Bartlett, 4th Ed., 2010.
7. Nell Dale, Chips Weens, “Programming and Problem Solving with C++”, Jones and Bartlett , 5th
Ed., 2010.
 MCA Total Marks: 100

Semester - II Internal Marks: 30

Paper Code. MCA203 External Marks: 70
Operating Systems No. of Hours: 90
Total Credits: 03
Unit No. Details Nos. of Hours
1.1 Operating System:
1.1.1 Introduction, Role, Types of OS; Batch Systems, multi
programming, time–Sharing parallel, distributed and real-time
systems, Operating system structure, Operating system
Components and services, System calls.
1.2 Processes:
1 1.2.1 Process Concept, Process Scheduling, Operation on Processes, 25
Cooperating Processes, Threads.
1.3 CPU Scheduling:
1.3.1 Basic Concepts, Scheduling Criteria, Scheduling Algorithms,
Multiple-Processor Scheduling, Real-Time Scheduling,
Algorithm Evaluation.
2.1 Interposes Communication and Synchronization:
2.1.1 Background, the Critical-Section Problem, Synchronization
Hardware, Semaphores, Classical Problems of Synchronization,
Critical Regions, Monitors, Message Passing.
2.2 Deadlocks:
2.2.1 System Model, Deadlock Characterization, Methods for Handling
Deadlocks, Deadlock Prevention, Deadlock Avoidance, Deadlock
Detection, Recovery from Deadlock, Combined Approach to
2 Deadlock Handling. 25
2.3 Memory Management:
2.3.1 Background, Logical vs. Physical Address space, swapping,
Contiguous Allocation, Paging, Segmentation, Segmentation with
Paging.
2.4 Virtual Memory:
2.4.1 Demand Paging, Page Replacement, Page-replacement
Algorithms, Performance of Demand Paging, Allocation of
Frames, Thrashing, Other Considerations, Demand Segmentation.
3.1 Device Management:
3.1.1 Techniques for Device Management, Dedicated Devices, Shared
Devices, Virtual Devices; Device Characteristics-Hardware
Consideration, Channels and Control Units, Independent Device
Operation, Buffering, Multiple Paths, Block Multiplexing, Device
3 Allocation Consideration. 20
3.2 Secondary-Storage Structure:
3.2.1 Disk Structure, Disk Scheduling, Disk Management, Swap-Space
Management, Disk Reliability.
 1.1 File-System Interface: File Concept, Access Methods, Directory
Structure.
1.2 File-System Implementation: Introduction, File-System Structure, Basic
File System, Allocation Methods, Free-Space Management, Directory
Implementation.
4 1.3 Security : The Security problem, Goals of protection, Access matrix, 20
Authentication, Program Threats, System threats, Intrusion detection ,
Cryptography.
1.4 Case Study: Linux Operating System and Windows XP.

Text books:
1. Silbersachatz and Galvin, “Operating System Concepts”, John Wiley, 8th Ed., 2009.
2. Milan Kovic., “Operating Systems”, Tata McGraw Hill, 2001
3. Deitel, Deitel and Choffnes, “Operating Systems”, Pearson ,3rd Edition

References books:
1. Tannenbaum, “Operating Systems”, PHI, 4th Ed., 2000.
2. Madnick E. and Donovan J., “Operating Systems”, Tata McGraw Hill, 2001.
3. Flynn McHoes, “Operating System”, Cengage Learning, 2006.
4. Pbitra Pal Choudhury, “Operating System Principles and Design”, PHI, 2009.
5. Sibsankar Halder and Alex A. Aravind, “Operating System”, Pearson, 2009.
6. William Stallings, “Operating Systems Internals & Design Principles”, Pearson Education, 6th
Ed., 2009.
 MCA Total Marks: 100

Semester - II Internal Marks: 30

Paper Code. MCA204 External Marks: 70
Data Base Management Systems No. of Hours: 90
Total Credits: 03
Unit No. Details Nos. of Hours
1.1 Basic concepts:
1.1.1 Database & database users, characteristics of the database,
1.1.2 database systems, concepts and architecture, date models,
schemas & instances,
1 1.1.3 DBMS architecture & data independence, database languages & 25
interfaces, data modeling using the entity-relationship approach.
1.1.4 Overview of hierarchical, Network & Relational Data Base
Management Systems.
2.1 Relational model, languages & systems:
2.2 relational data model & relational algebra:
2 2.3 relational model concepts, relational model constraints, relational algebra, 20
2.4 SQL- a relational database language: date definition in SQL, view and
queries in SQL, specifying constraints and indexes in sql.
3.1 Oracle Architecture, Logical Data Structures Physical Data Structure,
Instances, Table Spaces,
3 3.2 Types of Tablespaces, Internal Memory Structure, Background Processes, 20
Data Types, Roles & Privileges, Stored Procedures, User Defined
Functions, Cursors, Error Handling, Triggers.
4.1 Relational data base design:
4.1.1 Function dependencies & normalization for relational databases:
4.2 Functional dependencies, normal forms based on primary keys, (1NF,
2NF, 3NF & BCNF), lossless join and dependency preserving
ecomposition.
4 4.3 Concurrency control & recovery techniques: concurrency control 25
techniques, locking techniques, time stamp ordering, granularity of data
items, recovery techniques:
4.4 recovery concepts, database backup and overy from catastrophic failures.
Concepts of object oriented database management systems,
4.5 Distributed Data Base Management Systems.

Text books:
1. Elmsari and Navathe, “Fundamentals of Database Systems”, Pearson Education, 5th Ed., 2006.
2. Korth, Silberschatz, “Fundamentals of Database System Concepts”, TMH, 6th Ed., 2010.
3. Desai, B., “An Introduction to Database Concepts”, Galgotia.
4. Sham Tickoo and Sunil Raina, “Oracle 11g with PL/SQL Approach”, Pearson, 2010.

References books:
1. Date C. J., “An Introduction to Database Systems”, Narosa Publishing, 7th Ed., 2005.
2. S. K. Singh, “Database Systems: Concept, Design, and Applications”, Pearson’s Education, 1st
Ed., 2008.
3. Kiffer, “Database Systems: An Application oriented Approach”, Pearson.
4. Ullman J. D., “Principals of database systems”, Galgotia .
5. Shio Kumar Singh, “Databases Systems Concepts, Design and Applications,” Pearson, 2006.
 MCA Total Marks: 100

Semester - II Internal Marks: 30

Paper Code. MCA205 External Marks: 70
Software Engineering No. of Hours: 90
Total Credits: 03
Unit No. Details Nos. of Hours
1.1 Introduction:
1.1.1 Software Crisis, Software Processes & Characteristics, Software
life cycle models, Waterfall, Prototype, Evolutionary and Spiral
Models.
1.2 Software Requirements analysis & specifications:
1 1.2.1 Requirement engineering, requirement elicitation techniques like 25
FAST, QFD & Use case approach, requirements analysis using
DFD, Data dictionaries & ER Diagrams, Requirements
documentation, Nature of SRS, Characteristics & organization
of SRS, Requirement Management, IEEE Std. for SRS.
2.1 Software Project Planning:
2.1.1 Size Estimation like lines of Code & Function Count, Cost
Estimation Models, COCOMO, Putnam resource allocation
2 model, Validating Software Estimates, Risk Management. 25
2.2 Software Design:
2.2.1 Cohesion & Coupling, Classification of Cohesiveness &
Coupling, Function Oriented Design, Object Oriented Design.
1.1 Software Metrics:
1.1.1 Software measurements: What & Why, Token Count, Halstead
Software Science Measures, Data Structure Metrics, Information
Flow Metrics.
3 1.2 Software Reliability: 20
1.2.1 Importance, Hardware Reliability & Software Reliability,
Failure and Faults, Reliability Models- Basic Model,
Logarithmic Poisson Model, Software Quality Models, CMM &
ISO 9001.
4.1 Software Testing:
4.1.1 Testing process, Design of test cases, Introduction to functional
testing & Structural testing, Unit Testing, Integration and
System Testing, Debugging, Alpha & Beta Testing.
4 4.2 Software Maintenance: 20
4.2.1 Management of Maintenance, Maintenance Process,
Maintenance Models, Regression Testing, Reverse Engineering,
Software Re-engineering, Configuration Management,
Documentation.
Text books:
1. K. K. Aggarwal and Yogesh Singh, “Software Engineering”, New Age International,
3rd Ed., 2005.
2. R. S. Pressman, “Software Engineering – A Practitioner’s Approach”, McGraw Hill Int. ,
5th Ed., 2001.
3. Pankaj Jalote, “An Integrated Approach to Software Engineering”, Narosa, 3rd Ed., 2005.

References books:
1. Stephen R. Schach, “Classical & Object Oriented Software Engineering”, IRWIN,
1996.
2. James Peter, W. Pedrycz, “Software Engineering: An Engineering Approach”, John
Wiley & Sons.
3. I. Sommerville, “Software Engineering”, Addison Wesley,8th Ed., 2009.
4. Frank Tsui and Orlando Karan, “Essentials of Software Engineering”, Joes and Bartlett,
2nd Ed., 2010.
5. Kassem A. Saleh, “Software Engineering”, Cengage Learning, 2009.
6. Rajib Mall, “Fundamrntal of Software Engineering”, PHI, 3rd Ed., 2009.
7. Carlo Ghizzi , Mehdi Jazayeri and Dino Mandrioli, “ Fundamental of Software Engineering”, PHI, 2nd
Ed.,2003.
 MCA Total Marks: 50

Semester - II Internal Marks:20

Paper Code. MCA206-P External Marks:30
Data and File Structure Lab No. of Hours: 30
Total Credits: 01
Unit No. Details Nos. of Hours
1.1 Program to represent sparse matrix manipulation using arrays.
1.2 Program to represent Singly Linked List.
1.3 Program to represent Doubly Linked List.
1.4 Program to represent Circular Linked List.
1.5 Polynomial addition using Arrays and Linked List.
1.6 Program to represent Stack operations using array and linked list
1.7 Program to represent Queue operations using array and linked list
1.8 Program for Conversion of infix to postfix.
1 1.9 Program for Evaluation of Expressions. 30
1.10 Program to represent Binary Tree Traversals.
1.11 Program to represent Searching procedures ( Linear search , Binary
search and Interpolation search)
1.12 Program to represent sorting procedures ( Selection , Bubble , Insertion
,Quick , Heap , Merge)
1.13 Program to find the minimum cost spanning tree using Prim’s Method.
1.14 Program to implement 8-Queens Problem.
 MCA Total Marks: 50

Semester - II Internal Marks:20

Paper Code. MCA207-P External Marks:30
Object Oriented Programming in C++ Lab No. of Hours: 30
Total Credits: 01
Unit No. Details Nos. of Hours
1.1 Simple C++ Programs to Implement Various Control Structures.
a. If statement
b. Switch case statement and do while loop
c. For loop
d. While loop
1.2 Programs to Understand Structure & Unions.
a. Structure
b. union
1.3 Programs to Understand Pointer Arithmetic.
1.4 Functions & Recursion.
a. Recursion
b. function

1.5 Inline Functions.

1.6 Programs to Understand Different Function Call Mechanism.
a. Call by reference & Call by Value
1 1.7 Programs to Understand Storage Specifiers. 30
1.8 Constructors & Destructors.
1.9 Use of “this” Pointer. Using class
1.10 Programs to Implement Inheritance and Function Overriding.
a. Multiple inheritance –Access Specifies
b. Hierarchical inheritance – Function Overriding /Virtual Function
1.11 Programs to Overload Unary & Binary Operators as Member Function &
Non Member Function.
a. Unary operator as member function
b. Binary operator as non member function
1.12 Programs to Understand Friend Function & Friend Class.
a. Friend Function
b. Friend class
1.13 Programs on Class Template
 MCA Total Marks: 50

Semester - II Internal Marks:20

Paper Code. MCA208-P External Marks:30
Data Base Management Systems Lab No. of Hours: 30
Total Credits: 01
Unit No. Details Nos. of Hours
1.1 Working on SQL queries

1.1.1 Creating database objects

1.1.2 Modifying database objects
1.1.3 Manipulating the data
1 1.1.4 Retrieving the data from the database server 30
1.1.5 Performing database operations in a procedural manner using pl/sql
1.1.6 Performing database operations (create, update, modify, retrieve,
etc.) using front-end tools Design and Develop applications like
banking, reservation system, etc.,