AScheme and Syllabus MCA 2013

Scheme of Examination
and Syllabus
for
Master of Computer Applications

Batch 2013 2016
Chandigarh University,
Gharuan, Punjab
Chandigarh University, Gharuan, Punjab

Scheme of Master of Computer Applications for Batch 2013-2016
Master of Computer Applications Semester I
Paper
Code
MCT-401
MCT-402
MCT-403
MCT-404
MCT-405
MCP-406
MCP-407
MCP-408
Title
Computer Organization and Architecture
Problem Solving and Programming with C
Computer and Internet Fundamentals
Discrete Mathematical Structure
Human Values and Professional Ethics
Programming Lab using C Project - 1
Web Programming Lab Project - 2
Communication Skills
Total
4 1 4 - 4 - 4 1 4 - - - 4
- - 4
- - 2
20 2 10
Total Int. Ext. Total Credits

5
4
4
5
4
4
4
2
32
40
40
40
40
40
60
60
100
420
60
60
60
60
60
40
40
380
100
100
100
100
100
100
100
100
800
4.5
4
4
4.5
4
2
2
1
26
Master of Computer Applications Semester II

Paper
Code
MCT-421
MCT-422
MCT-423
MCT-424
MCT-425
MCP-426
MCP-427
MCT-428
Title
Total Int. Ext. Total Credits
Software Engineering
4 1
Data Base Systems
4 Object Oriented Programming with C++
4 Organizational Structure and Principle of
4 Management
Computer Oriented Statistical
and
4 1
Numerical Methods
Data Base Systems Lab Project - 3
- Object Oriented Programming Lab Project
- - 4
Colloquium
2 22 2
Total
Int: Internal, Ext: External
5
4
4
40
40
40
60
60
60
100
100
100
4.5
4
4
40
60
100
40
60
100
4.5
60
40
100
60
40
100
2
32
100
420
380
100
800
2
27

Master of Computer Applications Semester III
Paper
Code
MCT-501
MCT-502
MCT-503
MCT-504
MCT-505
MCP-506
MCP-507
MCT-508
MCT-509
Paper
Code
MCT-521
MCT-522
MCT-523
MCT-524
MCT-525
MCP-526
MCP-527
MCT-528
MCT-529
Title
Total Int. Ext. Total
Operating System
4 - 4
40
Data Structures
4 1 5
40
Data Communication and Networks
4 - 4
40
System Modelling and Simulation
4 1 5
40
Business Process Management and
4 - 4
40
Intelligence
Data Structures Lab Project - 5
- - 4
4
60
Case Tools Lab Project - 6
- - 4
4
60
Colloquium
2 - 2
100
Seminar
2 - 2
100
24 2 8
34
520
Total
Master of Computer Applications Semester IV
Title
Unix / Linux OS & Shell
Programming
Computer Graphics and Multimedia
Analysis & Design of Algorithms
Java Programming and Internet
Applications
Artificial Intelligence and Expert
Systems
Unix/ Linux Programming Lab
Project - 7
Java Programming Lab Project - 8
Colloquium
Seminar
Total
Credits
60
60
60
60
100
100
100
100
4
4.5
4
4.5
60
100
40
40
380
100
100
100
100
900
2
2
2
2
29
Total Int. Ext. Total
Credits
40
60
100
4
4
1
1
5
5
40
40
60
60
100
100
4.5
4.5
40
60
100
40
60
100
60
40
100
- 2 2 24 2
4
8
4
2
2
34
60
100
100
520
40
380
100
100
100
900
2
2
2
29

Master of Computer Applications Semester V
Paper
Code
MCT-601
MCT-602
Title
Total
Int. Ext. Total
Web Technologies
4 - 4
40
60
Software Project Management
4 - 4
40
60
Elective I
4 1 5
40
60
Elective II
4 1 5
40
60
(From Pool 2 / Pool 3)
Elective III
4 1 5
40
60
(From Pool 4 / Pool 5)
MCP-603 Web Technologies Lab
- - 4
4
60
40
Project - 9
MCP-604 Minor Project
- - 6
6
60
40
MCT-605 Seminar
2 - 2
100
Total
22 3 10
35
420 380
Elective Pool I
MCT-606
Information Retrieval System
MCT-607
Enterprise Resource Planning
MCT-608
Soft Computing Technologies
MCT-609
Open Source Technologies
Elective Pool II
MCT-610
Data Warehousing and Data Mining
MCT-611
Master Data Management
MCT-612
Human Computer Interface
MCT-613
Advanced Database Management Systems
Elective Pool III
MCT-614
Mobile Application Development
MCT-615
Advanced Computer Networks
MCT-616
Cryptography & Security Systems
MCT-617
Microprocessor and Interfacing
Elective Pool IV
MCT-618
Object Oriented Software Engineering
MCT-619
Object Oriented Analysis and Design
MCT-620
Software Quality Assurance
MCT-621
Software Testing
Elective Pool V
MCT-622
Distributed Operating Systems
MCT-623
Advanced Computer Architecture and Parallel
Processing
MCT-624
Cloud Computing and Java Development
MCT-625
Embedded System
Credits
100
100
100
4
4
4.5
100
4.5
100
4.5
100
100
100
800
3
2
28.5

Master of Computer Applications Semester VI
Paper
Code
MCT-701
MCT-702
Title
Dissertation / Thesis
Project Seminar
Total
Total
Int. Ext. Total

100
100
200
200
100
300
300
200
500
Credits
20
10
30
Note: The student will submit a synopsis for approval from the departmental committee
in a specified format. The student will have to present the progress of the work through
seminars and progress reports.
MCA 1st Semester
COMPUTER ORGANISATION AND ARCHITECTURE

(MCT-401)
L
4
T
1
P
-
Cr
4.5
External Marks: 60
Internal Marks: 40
Time Duration: 3 Hrs.
Total Marks: 100
NOTE: Ten questions are to be set in all by the examiners by taking three questions from
each unit and one compulsory question having 05 short answer type questions from all
the units. Students will be required to attempt six questions in all including compulsory
Question i.e. question No. 1 and by selecting not more than two questions from each unit.
OBJECTIVES
To have a thorough understanding of the basic structure and operation of a digital

computer.
To discuss in detail the operation of the arithmetic unit including the algorithms &
implementation of fixed-point and floating-point addition, subtraction, multiplication
& division.
To study the hierarchical memory system including cache memories and virtual
memory and different ways of communicating with I/O devices and standard I/O
interfaces.
UNIT I
Information Representation: Number systems, BCD codes, character codes, error

detecting and correcting codes, fixed-point and floating point representation of
information. Binary arithmetic operations.
Binary Logic: Logic gates, Boolean algebra, Boolean functions, truth tables, canonical
and standard forms, simplification of Boolean functions.
Combinational Logic circuits: Design procedure, adders, subtractors, encoders,
decoders, multiplexers and demultiplexers.
UNIT II
Sequential Logic circuits: Flip-flops: R-S, J-K FF, Master slave J-K FF, D FF, T FF,
computer registers.
Counters: Synchronous, Asynchronous, updown and programmable counters.
Memory System: Memory management, memory hierarchy, semiconductor RAMs,
ROMs, magnetic and optical storage devices, Virtual memory, Cache memory and
mapping.
UNIT III
CPU organization: Processor organization, Machine instructions, instruction cycles,
memory reference instructions, stack organization, instruction formats and addressing
modes, microprogramming concepts, Types of interrupts.
I/O Organization: I/O interface, interrupt structure, transfer of information between

CPU/memory and I/O devices, DMA and IOP.
References :
Mano, M. Morris Digital Logic and Computer Design, Pearson Education.
Rajaraman, V., Radhakrishanan,T., An Introduction To Digital Computer
Design,Prentice Hall of India Pvt. Ltd., 4th Ed.
Hayes, J.P., Computer Architecture and Organization, McGraw Hill, 1998, Third Ed.
Heuring, V.P., Jordan, H.F., Computer Systems Design and Architecture, Addison
Wesley, 2000.
MCA 1st Semester
PROBLEM SOLVING AND PROGRAMMING WITH C

(MCT-402)
L
4
T
-
P
-
Cr
4
External Marks: 60
Internal Marks: 40
Total Marks: 100
OBJECTIVES:
To facilitate the development and application of problem-solving skills in

students.
This subject will teach them programming logic, use of programming instructions,
syntax and program structure. This subject will also create foundation for student
to learn other complex programming languages like C++, Java etc.
UNIT I
An introduction to programming languages-their need and evolution, An introduction to

various problem solving techniques- algorithms, flowcharts, pseudo code, decision table,
Structured programming concepts, Modular Programming, Programming methodologies:
top-down and bottom-up programming, Characteristics of good programming language.
UNIT II
Elements of C: C character set, identifiers and keywords, Data types: declaration and
definition.
Operators: Arithmetic, relational, logical, bitwise, unary, assignment and conditional
operators and their hierarchy & associativity, Data input / output.
Control statements: Sequencing, Selection: if and switch statement; alternation,
Control Statements: for, while, and do-while loop; break, continue.
Functions : Definition, prototype, passing parameters, recursion.
UNIT III
Arrays, structures, union, string.
Pointers: Declaration, operations on pointers, array of pointers, pointers to arrays.
C Files: Their Importance and Need, File structure, Opening and Closing of Files, File
Opening Modes, Types of Files-Text and Binary Files, Reading and Writing onto File,
Random Access.
References :
Yashwant Kanetker, Let us C, BPB Publications.
Gottfried, Programming with C, Tata McGraw Hill.

Problem Solving with C, Keith Harrow, J. Jones, Pearson Education.
Jeri R. Hanly & Elliot P. Koffman, Problem Solving and Program Design in C, 3rd
Ed., Addison Wesley, 2000.
Al Kelley, Ira Pohl, A Book on C, Programming in C, 4th Ed, Addison Wesley, 2000.
MCA 1st Semester
COMPUTER AND INTERNET FUNDAMENTALS

(MCT-403)
L
4
T
-
P
-
Cr
4
External Marks: 60
Internal Marks: 40
Total Marks: 100
OBJECTIVES:
This course is designed to provide you with experience in using modern technologies to
create e-Commerce or web-based systems
UNIT-1
Computer Fundamentals: Computer components, characteristics & classification of
computers, hardware & software, peripheral devices. Algorithmic Development:
Programming languages: Low level programming languages: Machine and Assembly
languages. High level languages. Translation process- Assembler, Complier, Interpreter.
Operating System Principles: Concept of process, multi-programming. Functions of an
operating system, User interface and Windows, working with Windows operating
systems.
UNIT-2
Introduction to Networks and its Features, Types of Networks. Internet: working of
internet, Diff. b/w internet, Intranet &extranet, Modems: Types of Modems, Modes of
connecting to internet, internet service providers (ISPs), Internet address.(IPV4 &IPV6).
DNS: Domain Name System, Types of DNS.
World Wide Web: Introduction, miscellaneous Web Browser, searching the WWW:
Directories search engines and Meta Search Engines, working of the search engines,
TCP/IP, UDP: formats & difference. Introduction to Browser, Coast-to-Coast Surfing,
Web Page Installation, Web Page Setup, Using front page express, plug ins.
UNIT-3
Internet Tools: Telnet and FTP, HTTP, gopher commands, SMTP, MIME, Newsgroups.
Electronic Mail: introduction, advantages and disadvantages, user Ids, pass words, email address, message components, message composition, E-mail inner workings,
mailing lists, chat rooms and secure mails, PICO, PINE.
HTML: Hypertext mark-up language, basics of HTML & formatting and hyperlink
creation, commands of HTML, DHTML, Difference b/w HTML and XML.
Text Books:
P.K.Sinha, Priti Sinha, Computer Fundamentals, BPB Publications
Fundamentals of the Internet and the Word Wide Web, Raymond Greenlaw and
Ellen Hepp, TMH, New Delhi.
Reference books:
Internet and Word Wide programming, Deitel, Deitel & Nieto, Pearson Education,
New Delhi.
Complete Idiots Guide to Java Script,. Aron Weiss, QUE.
Networks Firewalls, Kironjeet Syan New Rider Pub.
Networling Essentials Firewalls Media, New Delhi.
Alferd Glkossbrenner-internet 101 computing MGH, New Delhi.
MCA 1st Semester
DISCRETE MATHEMATICAL STRUCTURE

MCT-404
L
4
T
1
P
-
Cr
4.5
External Marks: 60
Internal Marks: 40
Total Marks: 100
OBJECTIVES:
To extend students mathematical maturity and ability to deal with abstraction and to
introduce most of the basic terminologies used in computer science courses and
application of ideas to solve practical problems.
UNIT-1
Set Theory: Introduction to set theory, Set operations, Algebra of sets, combination of
sets, Duality, Finite and Infinite sets, Classes of sets, Power Sets, Multi sets, Cartesian
Product, Representation of relations, Types of relation, Binary relations, Equivalence
relations and partitions , Partial ordering relations and lattices. Mathematics Induction,
Principle of Inclusion &Exclusion, Propositions .Function and its types, Composition of
function and relations, Cardinality and inverse relations, Functions & Pigeon hole
principles.
Propositional Calculus: Basic operations: AND (^), OR (v), NOT (~), Truth value of a
compound statement, propositions, tautologies, contradictions.
Techniques of Counting: Rules of sum and product, Permutations with and without
repetition, Combination. Modular Arithmetic, Grammars, Language, Regular
Expressions, Finite State Machine.
UNIT-2
Sequence, Series And Recurrence Relation :Polynomials and their evaluation,
Sequences, Introduction to AP, GP and AG series, partial fractions, linear recurrence
relation with constant coefficients, Homogeneous solutions, Particular solutions, Total
solution of a recurrence relation using generating functions.
Latices and boolean algebra: Relations to partial ordering, Lattices, Hasse Diagram,
Axiomatic definition of Boolean Algebra as algebraic structures with two operations,
Boolean Functions, Representing Boolean Functions, Switching Circuits, Gate Circuits.
Algebric Structures Definition, elementary properties of algebraic structure, examples
of a monoid, Semigroup, permutation groups, Groups and rings, Homomorphism,
Isomorphism and Automorphism, Subgroups and Normal subgroups, Cyclic groups,
Integral domain and fields, Cosets, Lagranges theorem, Rings, Division.
UNIT-3
Graphs And Trees: Introduction to graphs, Directed and Undirected graphs,

Homomorphic and Isomorphic graphs, Subgraphs, Cut points and Bridges, Multigraph
and Weighted graph, Paths and circuits, Shortest path in weighted graphs, Eurelian path
and circuits, Hamilton paths and circuits, Planar graphs, Eulers formula, Trees, polish
notation, Rooted trees, Spanning trees & cut trees, Binary trees and its traversals.
Text Books:
Elements of Discrete Mathematics, C.L Liu, 1985, McGraw Hill, New Delhi.
Discrete Mathematical Structures, B. Kolman and R.C. Busby, 1996, PHI, New
Delhi.
Discrete Mathematical Structures with Applications to Computers by Trembley &

Manohar, 1995, MGH, New Delhi.
Reference Books
Concrete Mathematics: A Foundation for Computer Science, Ronald Graham,
Donald Knuth and Oren Patashik, 1989, Addison-Wesley, New Delhi.
Mathematical Structures for Computer Science, Judith L. Gersting, 1993,
Computer Science Press.
Applied Discrete Structures for Computer Science, Doerr and Levasseur,
(Chicago: 1985, SRA)
Discrete Mathematics by A. Chtewynd and P. Diggle (Modular Mathematics

Series), 1995, Edward Arnold, London,
Discrete Mathematics, Schaums Outline series: McGraw-Hills Singapore.
MCA 1st Semester
HUMAN VALUES AND PROFESSIONAL ETHICS

MCT-405
L
4
T
-
P
-
Cr
4
External Marks: 60
Internal Marks: 40
Total Marks: 100
OBJECTIVE: This paper intends to acquaint the student with basic human values i.e.
ethical, spiritual, social, civic and national to develop group and social attitudes, team
work, group work and place the student on the path of self confidence and self-sacrifice.
UNIT -1
Group and Social Values: Patriotism, respect to law, patience belongingness to a group,
co-operation, sharing, hospitality, leadership, respect for parents, teachers and elders,
dignity for labour, good manners and etiquette, diligence, self exploration, punctuality
and regularity
UNIT-2
Ethical Values: Courage to stand for truth, forgiveness, friendliness, honesty, respect for
all religions, service and helpfulness, sympathy
UNIT-3
Ethics and Business: Why be ethical in business, How might ethical decision-making
work, corporate culture and ethical leadership, corporate social responsibility, the role of
business in society, employer/employee rights and duties (internal issues), sexual
harassment, technology and privacy, ethical issues with consumers (external issues)
marketing and sales, advertising
Recommended Books:
1.
2.
Tripathi, A.N., Human Values, New Age International Publishers.

Gupta, Ananda Das, Human Values in Management, Ashgate Publishing Limited.
3.
Hartman, Laura P. and Joe DesJardins, Business Ethics: Decision-Making for

Personal Integrity & Social Responsibility. McGraw-Hill/Irwin.
Arthur, John. Studying Philosophy: A Guide for the Perplexed. Pearson/Prentice
Hall.
4.
MCA 1st Semester
PROGRAMMING LAB USING C PROJECT -1

MCP-406
L
-
T
-
P
4
Cr
2
External Marks: 40
Internal Marks: 60
Total Marks: 100
NOTE: Five questions are to be set in all by the examiners. Students will be required to
execute and attempt three questions in all including.
List of Programs for C Language not limiting to:
[1]
[2]
[3]
[4]
[5]
[6]
[7]
[8]
[9]
[10]
[11]
[12]
[13]
[14]
WAP to read one integer and one float type variable, calculate sum, difference,
product and division of them and display the results in formatted manner.
WAP to find volume of a cylinder using formula:
Volume= r2h
WAP to divide a number with 2 using bitwise operator
WAP to read a number between 1 to 7 and print day of the week using switch
statement.
WAP to find the commission on a salesman's total sales
The commission on a salesmans total sales is as follows:
a) If sales <100, then there is no commission.
b) If 100>= sales <=500, then commission = 10% of sales.
c) If sales > 500, then commission = 100+8% of sales above 500
WAP to generate a series of prime numbers between 2 to n.
WAP to print
1
12
123
1234
12345
1234
123
12
1
WAP that prints a given positive integer in reverse order and also sum of the
individual digits involved in the given integer.
Write a C program to find the exponential series of 1+x+x2/2!+x3/3!+.......+xn/n!
WAP to read and display all the elements of 1-d array.
WAP to sort a list of numbers using following method:
Selection sort
Bubble sort
WAP to search for a particular number using method:
Linear search
Binary search
WAP to enter a string and check if it is palindrome or not.
WAP to find a substring in a given string S.
[15]
[16]
[17]
[18]
[19]
[20]
WAP to create a function to calculate factorial of a number and calculate sum of

series
S=1/!1+2/!2+3/!3-------n terms.
WAP to declare the two matrices using pointers read them and calculate their
product using functions.
Write a program to find largest among 3 numbers using macros.
Write a program to create structure student having members name, roll no, marks
obtained and percentage. Enter the data of 10 students and display their result.
WAP to create a data file and display its contents on the screen.
WAP to search a particular record in data file.
MCA 1st Semester
WEB PROGRAMMING LAB PROJECT 2

MCP-407
L
-
T
-
P
4
Cr
2
External Marks: 40
Internal Marks: 60
Total Marks: 100
List of Programs not limiting to:
[1]
Create a Web page depicting yours personal and academic details.
[2]
Create a Web page to list students with 1st, 2nd and 3rd division.
[3]
Create a Web page applying anchor tag with various properties on it.
[4]
Create a home page of your own Institute.
[5]
Create a web page for students information. Show links on your page for every
detail. For e.g., Complete Resume, Address, contact address, qualification etc.
[6]
Create a Web Page using tables. Use Images as buttons normal text and text as
link in table.
[7]
Create a following table using HTML Tags:
Weather
Maximum
Minimum
Summer
32-40 C
25-30 C
Winter
18-25 C
08-12 C
[8]
Create a Web Page for your Time Table in table format.
[9]
Create a T.V Schedule on a Web Page in tabular form.
[10] Create a Web Page and apply Meta tag with properties on it.
[11] Create a Web page which displays the map of Punjab and provides information
about Mohali, Jalandhar, Ludhiana, and Patiala cities when a user clicks on a
particular city.
[12] Create a Web Page for an English Dictionary using Frames (only for vowels).
[13] Create a Web Page using frames and divide it in four parts. And display your
university site, your resume, Time Table and home of your institute in each
portion.
[14] Create a Web Page for admission form.
[15] Create a Web page of your own details using tables embedding form tags in table
cells.
[16] Create a web page using Cascading Style Sheet having following characteristics: Create right and left spaces of the text using id and class.
Sets background color of Important Paragraph.
[17]
Create a web page using Cascading Style Sheet having following characteristics: Underline unselected links, turns off underlying during the click and puts a
line through already visited links.
Sets background color Cyan of every paragraph and blue to every
division.
[18] Create and fill an examination form using form and validate them.
[19] Create a T.V. Schedule using XML and embed it in HTML.
MCA 1st Semester
COMMUNICATION SKILLS
MCP-408
L
-
T
-
P
2
Cr
1
Internal Marks: 100

Total Marks: 100

Objectives:
To encourage the all round development of students by focusing on English
Communication.
To make student aware about the importance, the role and the content of
communication through instruction, knowledge acquisition, and practice
To develop and nurture the soft skills that help develop student as a team member,
leader, and all round professional in long run have been identified and listed here for
references.
UNIT-1
Business Communication: Meaning and Definition, its importance, process,
classification, channels, Principles of effective communication; Barriers to effective
communication.
Oral Communication: Developing Listening and Speaking skills through various
activities such as Group Discussion, Presentation Skills, Role Play, Speech, Extempore
Speaking, Interpretation and Description
UNIT-2
Written Communication: Developing writing skills through business letters, Notice,
Memorandums, E-mail, Essay writing, Prcis writing, Comprehension writing.
Curriculum Vitae: Drafting curriculum vitae; writing job application letters.
UNIT-3
Interview Skills: Meaning, types, process and preparation for interview; Holding mock
interviews.
Meeting Skills: Meaning, types, purpose, Agenda of meeting, Minutes of meeting;
Holding mock meetings.
Vocabulary Building and Grammar: One word substitution, Antonyms, Synonyms,
Homonyms; Sentence formation.
Text Books
1.
2.
3.
4.
Communication Skill for Effective Mgmt., Ghanekar,EP

English for Technical communication,Laxminarayanan,Scitech
Simon Sweeney, English for Communication, CUP
Leo Jones and Richard Alexander, New International Business English, CUP
MCA 2nd Semester
SOFTWARE ENGINEERING
MCT-421
L
4
T
1
P
-
Cr
4.5
External Marks: 60
Internal Marks: 40
Total Marks: 100
OBJECTIVES:
To Know the Basics of Software Architecture
To Understand various phases of Software Development Cycle
UNIT-1
Introduction: Programs vs. software products, emergence of software engineering,
software life cycle, models; waterfall, prototype, evolutionary and spiral model, Software
Characteristics, Applications, Software crisis.
Software project management: Project management concepts, software process and
project metrics Project planning, project size estimation metrics, Empirical estimation
techniques, COCOMO, A Heuristic estimation techniques, staffing level estimation, team
structures, staffing, risk analysis and management, project scheduling and tracking.
Requirement Analysis and specification: Requirements engineering, partitioning
Software, prototyping, Prototyping methods and tools, Specification principles,
Representation, the software requirements specification and reviews, Analysis Modeling,
UNIT-2
Data Modeling, Functional Modeling and information flow: Data flow diagrams,
Behavioral Modeling, The mechanics of structured analysis: Creating entity/ relationship
diagram, data flow model, control flow model, the control and process specification, The
data dictionary, Other classical analysis methods.
System Design: Design concepts and principles: the design process: Design and software
quality, design principles, Design concepts: Abstraction, refinement, modularity, software
architecture, control hierarchy, structural partitioning, data structure, information hiding,
and Effective modular design: Functional independence, Cohesion, Coupling, Design
Heuristics for effective modularity; the design model; Design documentation.
UNIT-3
Testing and maintenance: Software Testing Techniques, Software testing fundamentals:
objectives principles, testability; test case design, Unit testing: white box testing, basis
path testing: Control structure testing: Black box testing, testing for specialized
environments, architectures and applications. Software Testing Strategies; Verification
and validation, Integration testing, Validation testing, alpha and beta testing, System
testing: Recovery testing, security testing, stress testing, performance testing; The art of
debugging, process debugging approaches. Software re-engineering: Reverse

engineering, restructuring, forward engineering.
Software Reliability and Quality Assurance: Quality concepts, Software quality assurance
: SQA activities; Software reviews; cost impact of software defects, defect amplification
and removal; formal technical reviews: The review meeting, review reporting record
keeping, review guidelines; Formal approaches to SQA;
Text Book:
Software Engineering - A Practitioners Approach, Roger S. Pressman, MGH,
NEW DELHI., NEW DELHI. Publications, New Delhi.
Software Engineering by Ian Summerville, Pearson Education, 5th Edition, New
Delhi.
Reference Books:
An Integrated Approach to Software Engineering by Pankaj Jalote, Narosa
Publications, New Delhi.
Fundamentals of Software Engineering, Rajib Mall, PHI, New Delhi.
Software Engineering Fundamentals, Ali Bethforooz and Frederick J. Hudson
Oxford University.
MCA 2nd Semester
DATABASE SYSTEMS
MCT-422
L
4
T
-
P
-
Cr
4
External Marks: 60
Internal Marks: 40
Total Marks: 100
OBJECTIVES:
To understand the internal storage structures using file/ indexing techniques which
will help in physical databases.
To learn the fundamentals of data models and to conceptualize and depict a database
system using ER diagrams.
To study SQL and relational database design.
To know the fundamental concepts of transaction processing- concurrency control
techniques and recovery procedure.
UNIT-1
Introduction: Overview of Database Management System: Various views of data
Models, Schemes and Introduction to database Languages & Environments, Advantages
of DBMS over file processing systems, Responsibility of Database Administrator. Three
level architecture of Database Systems: Introduction to client/Server architecture. Data
Models: E-R Diagram (Entity Relationship), mapping Constraints, keys, Reduction of ER diagram into tables.
UNIT-2
Network & Hierarchical Models, File Organization: Sequential File, index sequential
files, direct files, Hashing, B-trees Index files, Inverted Lists., Relational Models,
Relational Algebra & various operations (set operations, select, project, join, division),
Order, Relational calculus: Domain, Tuple, Well Formed Formula, specification,
quantifiers, Introduction to Query Language, QBE.
UNIT-3
Integrity constrains, functional dependencies & Normalization, 1st, 2nd, 3rd and BCNF.
Introduction to Distributed Data processing, Concurrency control: Transactions, Time
stamping, Lock-based Protocols, Serializability and Recovery Techniques.
Text Books:
Fundamentals of Database Systems by R. Elmasri and S.B. Navathe, 5 th Edition,
Pearson Education, New Delhi.
An Introduction to Database Systems by C.J. Date, 7th Edition, Pearson Education,
New Delhi.
Database System Concepts by A. Silberschatz, H.F.Korth and S.Sudarshan, 3rd

Edition, McGraw-Hill, International Edition.
Reference Books:
Database Management and Design by G.W Hansen, 2nd Edition, Prentice-Hall of
India, New Delhi.
Database Management Systems by A,.K.Majumdar and P.Bhattacharyya.5 th
Edition, Tata McGraw-Hill Publishing Company, New Delhi.
A Guide to the SQL Standard, Data,C. and Darwen, H.3rd Edition, Reading,
Addison-Wesley Publications, New Delhi.
Data Management & File Structure by Looms, PHI,New Delhi.
Introduction to Database Management system by Bipin Desai, Galgotia Pub, New
Delhi.
MCA 2nd Semester
OBJECT ORIENTED PROGRAMMING WITH C++

MCT-423
L
4
T
-
P
-
Cr
4
External Marks: 60
Internal Marks: 40
Total Marks: 100
OBJECTIVES:
To understand the object oriented life cycle.
To understand relationships, identify objects, services and attributes.
To understand the Object Oriented Design process.
To understand about software quality and usability.
UNIT-1
Introduction to C++, C++ standard library, Basics of a typical C++ Environment, Object
Oriented Concepts, Introduction to objects and object oriented programming, Abstraction,
Encapsulation, Access Modifiers: controlling access to a class, method or variable
(public, protected, private).
Classes and Data Abstraction: Introduction, structure definition, accessing members of
a structure, class scope and accessing class members, separating interface from
implementation, controlling access function and utility functions, Constructors, Dynamic
memory allocation with new and delete, destructors (Examples form C++), constant
object and const member function (use of const in C++), object as member of classes,
friend function and friend classes, using this pointer, static class member, function
overloading (Implementation in C++).
UNIT-2
Operator Overloading : Introduction, fundamentals of operator overloading, restriction
on operators overloading , operator function as class members vs. as friend functions,
overloading unary operator , overloading binary operators.
Inheritance :Introduction , inheritance: base class, protected members, casting base class
pointer to derived- class pointers, using member functions, Types of Inheritance, public,
protected and private inheritance, using constructors and destructors in derived classes,
implicit derived class object to base class object conversion , composition Vs.
inheritance.
Virtual Functions and Polymorphism: Introduction to virtual function, abstract base
class and concrete class, polymorphism, dynamic binding, virtual destructor,
Implementation in C++ using virtual function.
UNIT-3
Files and I/O Streams: Files and streams, creating a sequential access file, reading data
from A Sequential access file, updating Sequential Access file, Random Access File ,
Creating A Random Access File, Writing data Randomly To a random Access file,
Reading Data Sequentially from A Random Access File.
Templates: Function Template, Overloading Template Function, Class Template, Class
Template and Non- Type Parameters, Templates and Inheritance.
Exception Handling: Introduction, Basic of C++ Exception Handling: Try, Catch,
Throwing, Catching and Rethrowing an Exception, Exception specification, Processing
Unexpected Exception.
Text Books:
Object Oriented Programming in Turbo C+ + by Robert Lafore, Pearson
Education, New Delhi.
Object Oriented Programming Using C++ by Kamthane, Pearson Education, New
Delhi.
Mastering object Oriented Programming with C++, R.S. Salaria, Salaria
Publishing House.
Reference books:
C + + How to Program by H M Deitel and P J Deitel, Prentice Hall, India, New
Delhi.
The Complete Reference in C++ by Herbert Schildt, TMH, New Delhi.
Programming with C++ By D Ravichandran , TMH, New Delhi.
Object Oriented Programming with C++ by E Balagurusamy, Tata McGraw- Hill,
New Delhi.
Computing Concept with C++ Essentials by Horstmann, John wiley, New Delhi.
C++ Programming Fundamentals by Chuck Easttom, Firewall Media.
MCA 2nd Semester

ORGANIZATIONAL STRUCTURE AND PRINCIPLE OF MANAGEMENT
MCT-424
L
4
T
-
P
-
Cr
4
External Marks: 60
Internal Marks: 40
Total Marks: 100
OBJECTIVES:
To understand the behaviour in the organisational environments.
To make student aware about the importance and the role of management in business
organisations
To develop and nurture the soft skills that help develop student as a team member,
leader, and all round professional in long run have been identified and listed here for
references.
UNIT-I
Organizational Behavior: Concept, Role in business management practices, Challenges
to OB, Opportunities for OB in present business environment, Interdisciplinary approach
to OB.
Individual Behavior: Personality concept, determinants and theories; Learning
principles and theories; Perception meaning and importance in Managerial decisions,
Attitude, Values and Beliefs; Motivation: concept, important, Theories (Maslows,
McGregors, Herzbergs, Alderferers, Porter Lawyer and Vroom), Group Behavior:
Group Dynamics, Group Norms; Group Cohesiveness & Development, Team work,
Types of team, characteristics of Effective teams
UNIT-II
Introduction, Evolution, Concept and Objectives of Business, Forms of Business
Organization: Sole Proprietorship, Partnership, Joint Stock Companies, Public Utilities,
Co-operative, Criteria for choice of business organization, Business Combinations:
Concept, types and forms of combination.
Management: Concept, Management as a science and art, Functions of Management,
Levels of Management. Management theories: Scientific Management and principles,
Administrative Management (Henri Fayol), Behavioral Theory (Elton Mayo),
Contingency Theory, Management by objective.
UNIT-III
Planning: Concept, process, Types of Plans, Decision Making: Concept and Process. Role
of decision making in business organizations, Organizing: Nature, process and
significance; Formal and Informal organization; Span of Management, Authority:

Definition and types, Centralization and decentralization, Responsibility, Accountability
and Delegation, Staffing: Manpower Planning, Recruitment and Selection, Factors
affecting staffing, Directing and Leadership Theories and Styles
Recommended Books
1. Ghuman & Ashwathapa, Principles of Management, Tata McGraw Hill
Publishers, New Delhi.
2. Robbins Stephen , Management, Pearson Publishers, India.
3. Koontz & Weirich, Essentials of Management, Tata McGraw Hill Publishers, New
Delhi.
4. Prasad L.M., Principles & Practices of Management, S. Chand Publishers, New
Delhi.
MCA 2nd Semester
COMPUTER ORIENTED STATISTICAL AND NUMERICAL METHODS
MCT-425
L
4
T
1
P
-
Cr
4.5
External Marks: 60
Internal Marks: 40
Total Marks: 100
OBJECTIVES:
To introduce linear programming in technological environments
To introduce the concept of dynamic programming
To solve real life / simulated problems.
UNIT I
Computer Arithmatic : Floating point representation of numbers, arithmatic operations
with normalized floating point numbers and their consequences. Error in number
representation - pitfalls in computing.
Iterative Methods: Bisection, False position, Newton-Raphson methods, Discussion of
convergences, Polynomial evaluation, Solving polynomial equations (Bairstow's
Method).
UNIT II
Solving of Simultaneous Linear Equations and ordinary Differential Equations: Gauss
elimination method, Ill-conditioned equations, Gauss-Seidal iterative method, Taylors
series and Euler methods, Runge-kutta methods, Predictor corrector methods.
Numerical Differentiation and Integration : Differentiation formulae based on
polynomial fit, Pitfalls in differentiation, Trapezoidal, Simpson's rules and Gaussian
Quadrature.
Interpolation and Approximation : Polynomial interpolation, Difference tables,
Inverse interpolation, Polynomial fitting and other curve fitting. Approximation of
functions by Taylor series and Chebyshev polynomials.
UNIT III
Statistical methods: Sample distributions, Test of Significance, n2, t and F test.
Analysis of Variance : Definition, Assumptions, Cochran's Theorem,
One-way
classification, ANOVA Table, Two-way classification (with one observation per cell).
Time Series Analysis : Components and Analysis of Time Series, Measurement of
Trend, Seasonal fluctuations and Cyclic movement.
Text Books:
Rajaraman V., Computer Oriented Numerical Methods, Prentice Hall, India.

Computer Oriented Numerical Methods, R.S. Salaria, Khanna Book Publishing
Company, Delhi.
Gupta S.P. and Kapoor, V.K., Fundamentals of Mathematical statistics, Sultan Chand
and Sons.
Reference Books:
Anderson, Statistical Modelling, McGraw Publishing House.

Gupta S.P. and Kapoor, V.K., Fundamentals of Applied statistics, Sultan Chand &
Sons.
Graybill, Introduction to Statistics, McGraw Publishing House.
MCA 2nd Semester
DATA BASE SYSTEMS LAB PROJECT - 3

MCP-426
L
-
T
-
P
4
Cr
2
External Marks: 40
Internal Marks: 60
Total Marks: 100
Creating Database
Creating a Database
Creating a Table
Specifying Relational Data Types
Specifying Constraints
Creating Indexes
Table and Record Handling
INSERT statement
Using SELECT and INSERT together
DELETE, UPDATE, TRUNCATE statements
DROP, ALTER statements
Retrieving Data from a Database
The SELECT statement
Using the WHERE clause
Using Logical Operators in the WHERE clause
Using IN, BETWEEN, LIKE , ORDER BY, GROUP BY and HAVING
Clause
Using Aggregate Functions
Combining Tables Using JOINS
sub- queries
Database Management
Creating Views
Creating Column Aliases
Creating Database Users
Using GRANT and REVOKE
Cursors in Oracle PL / SQL
Writing Oracle PL / SQL Stored Procedures
MCA 2nd Semester
OBJECT ORIENTED PROGRAMMING LAB PROJECT - 4

MCP-427
L
-
T
-
P
4
Cr
2
External Marks: 40
Internal Marks: 60
Total Marks: 100
1. Write a program to generate prime number series between 1-100.
2. Write a program to find the root of quadratic equation(ax^2+bx+c).
3. Write a program to evaluate the salary of person.
4. Write a program to print the format
1
121
12321
1234321
5. Write a program to swap two numbers by call by reference.
6. Write a program to print Armstrong number up to 1000.
7. Write a program to add two matrices using classes and objects..
8. Write a program to multiply two matrices using classes and objects.
9. Write a program to dynamically and allocate and de allocate memory.
10. Write a program to illustrate the concept of friend function.
11. Write a program that illustrates the concept of constructor and destructor.
12. Write a program to show the concept of function overloading.
13. Write a program to concatenate two strings by overloading logical And operator.
14. Write a program to overload >=operator to compare two strings.
15. Write a program to illustrate the concept of operator overloading using friend
function.
16. Write C++ programs that illustrate how the following forms of inheritance are
supported:
a) Single inheritance, b) Multiple inheritance, c) Multilevel inheritance, d)
Hierarchical inheritance
17. Write a C++ program that illustrates how run time polymorphism is achieved using
virtual functions.
18. Write a C++ program that illustrates the role of abstract class in building class
hierarchy.
19. Write a C++ program to display the contents of a text file.
20. Write a C++ program which copies one file to another.
21. Write a C++ program to change a specific character in a file.
22. Write a program to Bubble sort using function template.
23. Write a program to implements class stack for different data types.
24. Write a program to illustrate how exception is handled using Try Catch block and
Throw statements.
25. Write a program to demonstrate exception specification
MCA 3rd Semester
OPERATING SYSTEM
MCT- 501
L
4
T
-
P
-
Cr
4
External Marks: 60
Internal Marks: 40
Total Marks: 100
OBJECTIVES:
The basic concepts and use of Operating and its working with architecture this
elaborative subject.
UNIT-1
Introductory Concepts: Operating system functions and characteristics, historical
evolution of operating system, Real time system, Distributed system, Methodologies for
implementation of O/S service, system calls, system programs, Interrupt mechanisms.
Processes: Process model, Process states, process hierarchies, implementation of
Processes, data structures used such as Process table, PCB creation of processes, context
switching, exit of Processes.
Inter-process communication: Race conditions, critical sections, problems of mutual
exclusion, Petersons solution, producer-customer problem, Reader Writers Problem,
Dining Philosophers Problem, semaphores, monitors, message passing.
UNIT-2
Process scheduling: objective, preemptive vs. non-preemptive scheduling, comparative
assessment of different algorithms such as round robin, priority bases scheduling. FCFS.
SJF, multiple queues with feedback
Deadlocks: Conditions, modeling, detection and recovery, deadlock avoidance, deadlock
prevention.
Memory Management: Multiprogramming with fixed partition, variable partitions,
virtual memory, paging, demand paging, design and implementation issues in paging
such as page tables, inverted page tables, page replacement algorithms, page fault
handling, working set model, local vs. global allocation, page size, segmentation with
paging.
UNIT-3
File systems: File type, attributes, access and security, file operations, directory
structures, path names, directory operations, implementation of file systems,
implementation of file and file operation calls, implementation of directories, sharing of
files, disk space management, block allocation, free space management, logical file
system, physical file system.
Device management: Techniques for device management, dedicated devices, shared
devices, virtual devices; device characteristics, hardware considerations: input & output
devices, storage devices: independent device operation, buffering, multiple paths, device
allocation considerations.
Text Book:
Operating System Concepts by Peterson, J.L. & Silberschatz, A. Addison Wesley, New
Delhi.
Operating System by Tanenbaum, A.S., PHI, New Delhi.
Reference Books:
Operating System Principles by Brinch, Hansen, PHI, New Delhi.

Operating System by Stalling Willams, PHI, Delhi.
MCA 3rd Semester
DATA STRUCTURES
MCT- 502
L
4
T
1
P
-
Cr
4.5
External Marks: 60
Internal Marks: 40
Total Marks: 100
OBJECTIVES:
To learn the systematic way of solving problems
To understand the different methods of organizing large amounts of data
To efficiently implement the different data structures
To efficiently implement solutions for specific problems
UNIT-1
An introduction to various types of data structures, Basic concepts and notations, various
operations associated with each data structure, algorithmic complexity and time space
trade off.
Data structures arrays: Types of arrays, Insertion, Deletion, Polynomial representation,
Polynomial representation, addition, and multiplication, Pointer Arrays, Sparse Matrices.
Strings: Introduction, Representation of strings in memory, String manipulations.
Recursion: Introduction, Direct and Indirect Recursion, Tail Recursion, Efficiency of
Recursion.
UNIT-2
Link List: Representation of linked list, Link list operations, Circular Linked List, Multi
linked structures, Applications of Linked List
Stack: Memory Representation of Stacks via arrays and Linked List, Operations on
Stack: Push, pop, Application of stack: Infix to postfix and prefix forms for expressions,
Evaluation of postfix expressions, Tower of Hanoi Problem, Code Generation for Stack
Machines.
Queue: Representation using array and linked List, Operations on Queue, Insertion,
deletion, Types of queues, Applications: Simulation etc.
Searching and sorting: Use of various data structures for searching and sorting, Linear
and Binary search, Bubble sort, Selection sort, Insertion sort, Merge sort, Radix sort,
Quick sort, Heap Sort.
UNIT-3
Trees: Definitions and basic concepts, linked tree representation, representations in
contiguous storage, binary trees and its types, Physical Implementation of Binary Tree in
Memory, binary tree traversal, searching, insertion and deletion in binary trees, heap tree
and heap sort algorithm, AVL trees.
Graph: Representation of Graphs, Traversals in Graphs, Applications of Graphs

Shortest Path Problem, Minimum Spanning Trees
Reference Books
Seymour Lipschutz, Schaum's Outlines Series Data structures TMH.
Data Structure Theory Problem and Algorithms, R.S. Salaria, Khanna Book
Publishing Company, Delhi.
Introduction to Data Structures Applications, Trembley & Soreson, Second Edition,
Pearson Education
A. Tannenbaum, Y. Lanhgsam and A.J.Augenstein, Data Structures Using C++,
Prentice Hall of India, 1990
MCA 3rd Semester
DATA COMMUNICATION AND NETWORKS

MCT- 503
L
4
T
-
P
-
Cr
4
External Marks: 60
Internal Marks: 40
Total Marks: 100
OBJECTIVES:
To understand the concepts of data communication and to study the functions of
different layers used in communication the data over network.
To introduce IEEE standards employed
in computer networking.
To make the students to get familiarized with different protocols and network
components.
UNIT 1
Introduction of Computer Networks, description of LAN, WAN, MAN & wireless
networks
Basic terminology of computer networks: - Bandwidth, physical and logical networks,
Bridge, switch, HUB, Modem SCU/DSU
OSI Reference Model: Laying architecture of networks, OSI model, Function of each
layer, Services and Protocols of each Layer.
Physical Layer: Representation of a bit on physical modem that is in wired network,
optical network and wireless network, AM,FM and PM. Different types of media
twisted pair unshielded twisted pair, coaxial cable, optical Fiber cable and wireless.
UNIT-2
Data Link Layer: framing error control and flow control. Error detection & correction
CRC block codes parity and check sum, elementary data link protocol, sliding window
protocol, channel allocation problem-static and dynamic. Multiple Access protocolALOHA, CSMA/CU, Token ring, FDDI.
Network Layer: network layer addressing, network layer datagram, IP addressed
Classes. Sub netting-Sub network, Subnet mask, Routing algorithm-optionally principle,
Shortest path routing, hierarchical routing, Broadcast routing, Multicast routing, DHCP,
Routing protocol.
UNIT-3
Transport layer: Layer-4 protocol TCP & UDP. Three-way hand shakes open
connection. Introduction to Network Management: Remote Monitoring Techniques:
Polling, Traps, Performance Management, Introduction to Network Operating System:

Client- Server Infrastructure, WINDOWS nt/2000.
TCP/IP : Introduction History of TCP/IP, Protocols, Internet Protocol , Transmission
control, User Datagram Protocol , IP Address classes, Subnet addressing ,Internet EmailSMTP, POP, IMAP, FTP NNTP, HTTP, SNMP, TELNET,
Application Layer: Domain name system, E-mail, File transfer protocol, HTTP, HTTPS,
World Wide Web.
Text Book:
1. Computer Networks: Tanebaum, PHI, New Delhi.
2. Computer Networks and Their Protocols, Darlex, DLA Labs.
3. Data Communication & Networking, Frouzen Tata McGraw Hill Publications.
Reference Books:
1.
Computer Communication and Networks, Freer, East-West-Press.
2.
Data Communications, Hallsall Fred, 2000, Addition Wesley, New Delhi.
3.
Business Data Communications, Fitzgerald Jerry Publications.
4.
Computer Networks A System Approach, Larry L. Peterson & Bruce S. Davie, 2nd
Edition.
MCA 3rd Semester
SYSTEM MODELING AND SIMULATION

MCT- 504
L
4
T
1
P
-
Cr
4.5
External Marks: 60
Internal Marks: 40
Total Marks: 100
OBJECTIVES:
To understand the concepts Modelling
To understand the correlation of real world entities with mathematical evaluations
To predict the behaviour of objects mathematically.
UNIT 1
Introduction: A System & its Model, concepts of system modeling, different system
models, Simulation, Basic nature of Simulation, when to Simulate, Simulation vs.
Modeling, Simulation & Modeling using computers, Simulation of Pure Pursuit
Problem, Simulation of an inventory problem. Need for simulation and limitations of
Simulation (Algorithms for simulation of Pure-Pursuit problem and Inventory Problem)
Simulation of continuous system: Simulation of a chemical reactor, Numerical
integration vs. continuous system simulation, selection of an integration formula, RungaKutta integration formula, simulation of a servo system, simulation of water reservoir
system, analog vs. digital simulation.( Algorithms for simulation of chemical reactor,
servo system and water reservoir system)
UNIT 2
Simulation of discrete systems: Fixed time step vs. event to event model, Simulating
Randomness, Generation of random numbers, Generation of non-uniformly distributed
random number, Box Muller transformations, Monte-Carlo Computation, Stochastic
Simulation.
Simulation of Queuing system: Introduction to Queuing theory, Simulation of the
Single, two Server Queues and general queues (Algorithms for single and two server
queuing systems)
UNIT-3
Inventory control and forecasting: Elements of Inventory theory, more complex
inventory models, Generation of Poission and Erlang variates, forecasting and regression
analysis.
Design and Evaluation of the simulation Experiments: - Central Limit Theorem,
Variance Reduction Techniques, Experiments layout, Validation.
Simulation languages:-Continuous and Discrete Simulation language, Block Structured,

Simulation language, Expression based language, SIMSCRIPT, SIMULA, GPSS and
Factors in selection of discrete system simulation language.
TEXT BOOKS
System Simulation with Digital Computers by Narsingh Deo, PHI, New
Delhi.
System Simulation by Gordan, Pearson Education, New Delhi.
Discrete Event System Simulation by Jery Banks, Pearson Education, New
Delhi
REFERENCE BOOKS
System Simulation by D. S. Hira , S Chand and Co. Ltd. , Delhi.
Computer Modeling & Simulation by Don.M. Ingles, Centage Publications,
New Delhi.
MCA 3rd Semester
BUSINESS PROCESS MANAGEMENT AND INTELLIGENCE

MCT- 505
L
4
T
-
P
-
Cr
4
External Marks: 60
Internal Marks: 40
Total Marks: 100
OBJECTIVES:
Discuss the concept of placing business data into context thereby creating information
Explain the basic processes for moving data from the source systems to the Data
Warehouse databases
List some representative technologies for populating a data warehouse
Describe information integration
Discuss the key elements and issues of a typical project plan for implementing a Data
Warehouse and Business Intelligence system
UNIT-1
BPM concepts, life cycle, BPM technology, Concepts of BPA and BPM,
Turning data into information- Business and data, Challenges for Business and data,
Data, Information, Insight, Data decision challenge, Operational versus Informational
data, Data Warehouse architecture, What is a Data Warehouse, Logical tiers in a Data
Warehouse, concept of Data Mart, Data Warehouse process flow, Dynamic Warehousing.
UNIT-2
System Development Approaches, System Analysis & Design-Definition, characteristics
and elements of a system, information gathering tools MIS basic concepts, Importance,
Need , Characteristics, Nature and Scope of MIS, MIS functions, MIS structure, MIS
classification , Management support system, General support system.
.
UNIT-3
Decision Support System: Decision making concept, Simons model of decision making,
Types of decisions, Methods for decision making, Decision support processes, Decision
support users, DW and DSS, Business Intelligence areas, Information as a service,
Explicit and tacit knowledge, Knowledge lifecycle, Value of information, Extending
beyond the Data Warehouse.
Data Modeling and Metadata, Data Warehouse modeling and design, The challenges,
Requirements capturing, Modeling, Modeling process, Modeling techniques - Entity
relationship modeling, Temporal modeling, Multidimensional modeling.
Text Books
Machiaswedge, Business Process Management,

(Concept Language and
Architecture ) Springer
Business Process Management by Farouk Toumani & Karsten Wolf , Springer
Business Intelligence by David Loshin, IBM
Reference Books
Business intelligence for the enterprise by Mike Biere, IBM
Changing Business with Data Insight, IBM
Working with Cognos Report Builder, IBM
MCA 3rd Semester
DATA STRUCTURES LAB PROJECT - 5

MCP-506
L
-
T
-
P
4
Cr
2
External Marks: 40
Internal Marks: 60
Total Marks: 100
1.
2.
3.
4.
5.
Program to multiply two matrices.

Program for adding two Polynomials.
Program to find the transpose of a Sparse matrix.
Program for Graphocal representation of stack operations using arrays.
Program to convert infix expression into postfix expression and evaluate Postfix
expression.
6. Program to implement queue using arrays.
7. Program to insert and delete in a Circular queue.
8. Program to perform different operations on linked list(Inverse ,Insert at different
position in the list and deletion at different positions , concatenation etc)
9. Program to Push and pop operations in a stack using linked list.
10. Program to implement queue using linked list.
11. Program to perform insertion and deletion and search in a Binary search tree.
12. Program for binary search and also to find time complexity of the algorithms.
13. Program for sequential search and also to find time complexity of the algorithms.
14. Program to store a graph in a incident matrix.
15. Program to find shortest path between two points of a graph.
16.
Program to sort an array using Bubble Sort
17.
Program to sort an array using Insertion Sort
18.
Program to sort an array using Shell Sort
19.
Program to sort an array using Merge Sort
20.
Program to sort an array using Quick Sort
MCA 3rd Semester
CASE TOOLS LAB PROJECT - 6

MCP-507
L
-
T
-
P
4
Cr
2
External Marks: 40
Internal Marks: 60
Total Marks: 100
1
2
3
4
5
6
7
8
9
10
11
12
13
14
Generate an Entity Relationship diagram for Banking Management System using

Metaedit Case tool showing all mapping cardanility and existence dependency.
Draw an Entity Relationship diagram for Employee Management System using
Metaedit Case tool and details of all the employees should reflect in the repository.
Generate an Entity Relationship diagram for Library Management System using
Metaedit case tool.
Generate a Data Flow Diagram for Order Processing System using Metaedit Case tool
and all the master details must be their in the Data Dictionary.
Draw a Data Flow Diagram for Library Management System using Metaedit case tool
and all the master details must be their in the data dictionary.
Draw an Object Oriented diagram for Gardening System showing multiple
inheritances using OOD case tool.
Draw an Object Oriented diagram for Automobile system showing multiple
inheritances and mapping using OOD case tool.
Draw CRC diagram Employee Management System using classes, responsibilities
and collaboration using CRC case tool.
Draw CRC diagram Inventory Control system using classes, responsibilities and
collaboration using CRC case tool.
Generate State Transition diagram for Traffic Control System using State Transition
case tool.
Generate State Transition diagram for Environment Control System using State
Transition case tool.
Draw a diagram for Ingot Park System using Clyder case tool showing actions,
objects and events.
Draw a diagram for Traffic Control System using Clyder case tool showing actions,
objects and events.
EXPERIMENTS RELATED TO BUSINESS INTELLIGENCE
06
MCA 4th Semester
UNIX /LINUX OS & SHELL PROGRAMMING

MCT- 521
L
4
T
-
P
-
Cr
4
External Marks: 60
Internal Marks: 40
Total Marks: 100
OBJECTIVES:
The aware the student with the basic concepts of Unix and Linux OS
Use of Operating system with Programming the shell applications
UNIT 1
Overview of Unix/Linux, Unix / Linux Startup, User accounts, Logging in and out,
Shutting out, Dual Booting , Command line, Getting Help using man and info pages,
creating files, Unix / Linux file and directory structure , Browsing the file system , Mail,
Unix / Linux Commands, Using Linux GUI- KDE and Gnome, Processes in Unix /
Linux, Bash Shell introduction, Command line shortcuts, Standard I/O , Redirecting I/O
and errors , using pipes, Using vi-editor.
Linux / Unix file system, Users, groups and the root user, permission types, changing file
ownership and permissions, partitions and file system, i-nodes, directories, symbolic
links, hard links , fundamental file types, checking free space, mounting and un-mounting
file systems and media, mounting other file systems, formatting, archiving and
compression.
UNIT 2
Unix / Linux shell Programming -Shell as command processor, configuring the shell,
shell variables, aliases, environmental variables, shell startup, creating shell scripts,
conditional execution , loops, functions.
Processes in Linux, starting and stopping processes, initialization processes, rc and init
files, job control at, batch, cron, time, network files, security, privileges, authentication,
password administration, Signals and signal handlers, Linux I/O system.
Regular Expressions and Filters: Introducing regular expressions patterns, syntax,
character classes, quantifiers, using grep, egrep, fgrep, sed.
UNIT 3
The C Environment, The C compiler, compiler options, managing projects, Memory
Management Dynamic and Static Memory, Use of Makefiles, Dependency
Calculations, Building and Using Static and Dynamic Libraries, using ldd, soname,
dunamic loader, degugging with gdb.
Kernel tasks, managing kernel modules at run time, kernel configuration and
compilation; boot loader GRUB and LILO, ARP, Telnet, IP address and network mask,
subnets and routing; ipconfig and netstat commands. Network services and tools; telnet,
rsh , ftp, rcp, ssh , rsync, inetd.conf , opening and closing ports.
Text Books:
Introduction to Unix and Shell Programming, M.G. Venkateshmurthy, Pearson
Education.
Your Unix The Ultimate Guide, Sumitabha Das: TMH, New Delhi.
Linux Programming Bible, John Goerzen: IDG Books, New Delhi.
Reference Books:
Linux Network Administration Guide by Tery Dawson, Gregor N. Purdy, Tony
Bautts Oreilly.
The Unix Programming Environment, Kernighan W. Brain, Rob Pike: PHI , New
Delhi .
UNIX Network Programming, W. Richard Stevens, PHI, New Delhi.
Professional Linux Programming, Mathew: Vol.1 & 2, Wrox-Shroff.
Running Linux, Welsh & Kaufmann:, OReiley & Associates, New Delhi.
MCA 4th Semester
COMPUTER GRAPHICS AND MULTIMEDIA

MCT- 522
L
4
T
1
P
-
Cr
4.5
External Marks: 60
Internal Marks: 40
Total Marks: 100
OBJECTIVES:
Students will demonstrate an understanding of contemporary graphics hardware.
Students will create interactive graphics applications in C++ using one or more
graphics application programming interfaces.
Students will write program functions to implement graphics primitives.
Students will write programs that demonstrate geometrical transformations.
Students will demonstrate an understanding of the use of object hierarchy in graphics
applications.
UNIT-1
Introduction: What is Computer Graphics, Computer Graphics Applications, Computer
Graphics hardware and Software , Two dimensional Graphics primitives: Points and
Lines, Point plotting Techniques: Coordinate system , Increment method , Line drawing
algorithm : DDA, Bresenhams circle drawing algorithm: Using polar coordinates, Mid
point circle drawing algorithms, filled area algorithm: Scan line, Polygon filling
algorithms, Boundary filled algorithms.
Point & Positioning devices: light pen, mouse, Tablet, Input technique, positioning
technique, and character recognition.
Two Dimensional Geometric transformations: Translation, Scaling, Rotation, Other
Transformations Reflection, shear, Homogenous Coordinate System
UNIT-2
Clipping: point & line clipping algorithm, 4 bit code algorithm. 4 bit code algorithm
Cohen Sutherland line clipping algorithms, Liang Barsky line clipping algorithms
Polygon clipping: Sutherland Hodge land Polygon clipping algorithm. Curve clipping,
Text clipping.
Two Dimensional Viewing: Viewing pipeline, Window to view port transformation,
Window to view port mapping
Three Dimensional Geometric transformations: Translation, Scaling and Rotation
Three Dimensional Viewing: Viewing pipeline, viewing coordinates, Projection: Parallel,
perspective
UNIT-3
Representation of 3-D curves and surfaces: Curved lines and surfaces, spline
representations, interpolation and approximation splines, parametric continuity
conditions.
Bezier curves and surfaces: Bezier curves, properties of Bezier curves, Bezier surfaces Bspline curves and surfaces.
Hidden Surfaces removal: Hidden surface elimination, depth buffer algorithm, scan line
coherence algorithm, priority algorithm.
Multimedia: An introduction; Framework for multimedia systems; multimedia devices,
professional development tools; Image Compression & Standards: Making still images;
editing and capturing images; scanning images;
TEXT BOOKS
Computer Graphics, 2nd Ed., Hern & Baker PHI, New Delhi.
Principles of Computer Graphics- Rogers- MGH Pub New Delhi.
Computer Graphics, Schaums Outline Series, MGH Publications.
REFERENCE BOOKS
Computer Graphics Principles and Practice, 2nd Edition by Foley, Van Dam,
Feiner and Hughes.-Addison-Wesley Pub Company.
Principles of Computer Graphics Theory & Practice Using Open GL and Maya
University Press,Hyderabad.
Computer Graphics - A Programming Approach, Harrington.
Graphics Programming with C By Yashwant Kanetkar, BPB Publications, New
Delhi.
MCA 4th Semester
ANALYSIS & DESIGN OF ALGORITHMS

MCT- 523
L
4
T
1
P
-
Cr
4.5
External Marks: 60
Internal Marks: 40
Total Marks: 100
OBJECTIVES:
Date Structures are an integral part of algorithm design and Discrete Structures covers
topics like graph theory.
UNIT-1
Introduction: Algorithm, Analyzing algorithm, Designing algorithm, Concept of
algorithmic efficiency, Run time analysis of algorithms, Asymptotic Notations.
Divide and Conquer: Structure of divide and conquer algorithms; examples; binary
search, quick sort, Strassen Multiplication; Analysis of divide and conquer run time,
recurrence relations.
Greedy Method: Overview of the Greedy Paradigm, Examples of Exact Optimization
solution (minimum cost spanning tree), approximate solution (Knapsack problem), Single
source shortest paths.
UNIT-2
Dynamic Programming: Overview, Difference between Dynamic Programming and
Divide and Conquer, Applications: Shortest path in graph, Matrix Multiplication,
Traveling salesman Problem, Longest Common sequence.
Back Tracking: Overview, 8-queen problem, Graph Coloring Problem and Knapsack
problem
UNIT-3
Branch and Bound: LC Searching Bounding, FIFO Branch and Bound, LC Branch and
Bound Application: 0/1 Knapsack Problem, Traveling Salesman Problem
Graph Searching and Traversal: Overview, Traversal methods(depth first and breadth first
search)Trees: Review of Trees, Binary Search Tree, Traversal, Insertion & Deletion in
Binary Search Tree, B-Trees, Basic operations on B-Trees
Computational Complexity:
Complexity measures, Polynomial vs. non-polynomial time complexity; NP-hard and
NP-complete classes, examples.
TEXT BOOK
1. Fundamentals of Computer Algorithms. 2nd Edition, E. Horowitz, S. Sahni, and
S.Rajsekran, University Press, Hyderabad.
2. Introduction of Computer Algorithm, T. H Cormen, Leiserson, Rivest and Stein, PHI,
New Delhi.
3. Design and Analysis of Algorithms, P. Himanshu, H.B. Dave, Pearson Education.

REFERENCE BOOKS
1. Computer Algorithms, Sara Basse, A.V. Gilder, Addison Wesley, New Delhi.
2. Fundamentals of Data Structure, E. Horowitz, S. Sahni, and S.Rajsekran
University Press, Hyderabad
MCA 4th Semester
JAVA PROGRAMMING AND INTERNET APPLICATIONS

MCT- 524
L
4
T
-
P
-
Cr
4
External Marks: 60
Internal Marks: 40
Total Marks: 100
OBJECTIVE:
To Use the Java SDK environment to create, debug and run simple Java programs.
To understand the concept of classes, methods, objects, arrays, exception handling,
Inheritance, Interfaces and Multithreading.
To Write and test Applets for potential inclusion in web pages.
Understanding Graphics, GUIs, Events, Exceptions.
Understanding the Java features for secure communications over the internet.
Understanding Java database connectivity.
UNIT I
Introduction to Java & Principles of Object Oriented Programming:
Basic Concepts of OOP and its Benefits, Application of OOP, The Creation of Java,
Importance of Java for the Internet, Javas Magic: The Byte-code, Features of Java,
Object-Oriented Programming in Java, Java Program Structure
Defining Classes: Definition of a Class, Definition of Methods, Constructors, Creating
Objects of a Class, Assigning Object Reference Variables, The keyword this, Defining
and Using a Class, Automatic Garbage Collection.
Arrays and Strings: Arrays, Arrays of Characters, String Handling Using String Class,
Operations on String Handling Using, String Buffer Class.
Extending Classes and Inheritance: Using Existing Classes, Class Inheritance, Choosing
Base Class, Access Attributes, Polymorphism, Multiple Levels of Inheritance,
Abstraction through Abstract Classes, Using Final Modifier, the Universal Super-class:
Object.
Packages & Interfaces: Understanding Packages, Defining a Package, Packaging up Your
Classes, Adding Classes from a Package to Your Program, Understanding CLASSPATH,
Standard Packages, Access Protection in Packages, Concept of Interface.
UNIT II
Exception Handling: The Idea behind Exceptions, Types of Exceptions, Dealing with
Exceptions, Exception Objects, Defining Your Own Exceptions, Checked and unchecked
Exceptions
Input/Output in Java: I/O Basic, Byte and Character Structures, I/O Classes, Reading
Console Input, Writing to Console Output, Reading and Writing on Files, Random Access
Files, Storing and Retrieving Objects from File, Stream Benefits.
Multithreading Programming: The Java Thread Model, Understanding Threads, The
Main Thread, Creating a Thread: extending Thread and implementing Runnable, Creating
Multiple Threads, Thread Priorities, Synchronization, Inter-thread communication,
Creating Applets in Java: Applet Basics, Applet Architecture, Applet Life Cycle, Simple
Applet Display Methods, Requesting Repainting, Using The Status Window, The HTML
APPLET Tag, Passing parameters to Applets.
UNIT III
Working with Windows: AWT Classes, Window Fundamentals, Working with Frame,
Creating a Frame Window in an Applet, Displaying Information within a Window,
Introduction to Swings
Event Handling: Two Event Handling Mechanisms, The Delegation Event Model, The
Event Handling Process, Event Classes, Sources of Events, Event Listener Interfaces,
Using the Delegation Event Model, Adapter Classes.
Networking: Basics, networking classes and interfaces, Using java.net package, doing
TCP/IP and Datagram Programming by Server Socket and Socket classes. Introduction to
servlets and JSPs.
Java Data Base Connectivity (JDBC): Database Connectivity Relational Databases,
JDBC API, Reusing Database Objects and Transactions.
Text Books:
Java-2, The Complete Reference by Patrick Naughton and Herbert Schlitz, TMH,
New Delhi.
Beginning Java 2 (JDK1.3 Edition), Ivor Horton, WROX Publications, New Delhi.
Reference Books:
Introduction to Java Programming, Y. D. Liang, , Pearson Education.
JAVA 2 Unleashed, Tech Media Publications, New Delhi.
JAVA 2(1.3) API Documentations.
Programming with Java, by E Balaguruswamy, TMH, New Delhi.
MCA 4th Semester

ARTIFICIAL INTELLIGENCE AND EXPERT SYSTEMS
MCT- 525
L
4
T
1
P
-
Cr
4.5
External Marks: 60
Internal Marks: 40
Total Marks: 100
OBJECTIVE:
To display the utilization of reason as well as logic without human interference.
To promote interdisciplinary exchanges between Artificial Intelligence and other
fields of information processing.
UNIT - I
Introduction: Background and history, Overview of AI applications areas.
The predicate calculus: Syntax and semantic for propositional logic and FOPL,
Clausal form, inference rules, resolution and unification.
Knowledge representation: Network representation-Associative network & conceptual
graphs, structured representation- Frames & Scripts.
UNIT - II
Search strategies: Strategies for state space search-data driven and goal driven search;
Search algorithms- uninformed search (depth first, breadth first, depth first with
iterative deepening) and informed search (Hill climbing, best first, A* algorithm,
mini-max etc.), computational complexity, Properties of search algorithmsAdmissibility, Monotonicity, Optimality, Dominance, etc.
Production system: Types of production system, Control of search in production
system.
UNIT - III
Rule based expert systems: Architecture, development, managing uncertainty in
expert systems(Bayesian probability theory, Stanford certainty factor algebra,
Nonmonotonic logic and reasoning with beliefs, Fuzzy logic, Dempter/Shaffer and
other approaches to uncertainty.
Knowledge acquisition: Types of learning, learning automata, genetic algorithms,
intelligent editors, learning by induction.
References :
George F. Luger, William A. Stubblefield, Artificial Intelligence, The Benjamin /

Cummings Publishing Company, Inc.
Dan W. Patterson Introduction to Artificial Intelligence and Expert system PHI.
Eugene Charniak, Drew McDermott Introduction to Artificial Intelligence Addison
Wesley.
Guide to expert systems, Donald A. Waterman, Pearson Education.
Nils J. Nilsson Principles of Artificial Intelligence Narosa publishing house.
Jackson Peter, Introduction to Expert systems, 3rd ed., (Addison Wesley).
MCA 4th Semester
Unix/ Linux Programming Lab PROJECT - 7

MCP-526
L
-
T
-
P
4
Cr
2
Internal Marks: 60
External Marks: 40
List of Experiments for Unix/ Linux Programming not limiting to:

1. Install Linux on the system dual boot with the windows operating System.
2. Do the following tasks:A. Create, remove, and resize various types of partitions through GUI as well as
command line.
B. Configure printers in Linux.
3. Creating ,Removing of Swap space as well as swap file.
4. Write a shell script to perform arithmetic operation (ADD, SUB, MUL, DIV etc)
5. Write a shell script to calculate student result record. Percentage of marks and
division using IF control construct
6. Shell Script to search a pattern a FILE the file name and the pattern should be
given by user.
7. Write a shell script to DELETE all Zero Size File in The Current Directory.
8. Write a Shell script to test a file whether it has read, write and division using IF
control structure
9. Write a shell script to check whether a specified user has logged in or logged out
and display a proper message as soon as he login. If not then check continuously
until he logged in and time delay when he logged in.
10. Write a function dir, copy, rename & corresponding the commands ls, cp, mv &
rm respectively.
11. Write a shell script to take different number of arguments as command line and
display their average to implement positional parameters.
12. Creating a file employee named emp.lst having following fields : empid, name,
design, dep, job, salary
13. Implementing Disk Quotas- enabling, creating, mounting, configuring, assigning,
Disabling.
14. Managing Users and Groups in Linux- Adding, Modifying, Password aging.
15. Write a shell script to find the factorial value of any number entered through the
keyboard.
16. Write a script to create a DMC of a student.
17. To study various file-directories handling commands.
18. To study the various shell commands in Linux.
19. Write a script to Implement Menu driven calculator.
20. Implement Mount,Unmount and Make file systems
21. Write a program in c to display a message welcome using command line
arguments
22. Write a program inc to create a child process using Fork() System Call and
Display Parent & Child Process IDs.
23. Write a program in c to Copy Contents of a File to Another File.
MCA 4th Semester
Java Programming Lab PROJECT - 8

(MCP-527)
L T P Cr
- - 4 2
Internal Marks: 60
External Marks: 40
List of Experiments not limiting to:

1. (a) Make a program to implement an integer stack, which can hold 10 values.
(b) Implement Function overloading concept.
2.(a) Write a program to implement the concept of inheritance having a base class
representing a
person, derived from this class make two classes, one about the
students and other about employees. Input & output this information about students
& employees.
(b) Make a program to implement the concept of Package.
3. Make a program to copy the contents of source file into destination file, properly
handling the exceptions.
4. Make a program to implement the buffering concept in which producer produc es the
data and consumer consumes it using the threading concept.
5. Make a program to implement the matrix multiplication & copying a file using
Multithreading concept.
6. Create an Applet Creating Thread which will move a String Continuously.
7. Make a program using applets which will handle mouse events on client side.
8. Make a program using applets which will handle key events on client side.
9. Make a program which will hold end to end communications between client & server
using connection less service. (Use sockets to make TCP server & clients).
10. Implement UDP server & UDP clients establish connection between them using ports.
11. Make a program using servlets and a web page using HTML so as to print the
dynamic response from the servlets when the web page is submitted.
12. Create a database using MS-Access and access this database in your program using
JDBC.
13. Make a Frame window having fields regarding user information & extract the values
from the database in that field on the click event of button next.
14. Make a program using JSP & a WEB page using HTML so as to print the dynamic
response from the JSP when the web page is submitted. (Using any web server)
15. Make a program which creates a cookie on the server side using servlets & when
server returns a response to the user also send cookies to clients for later retrieve its
data from that client.
List of Experiments Analysis & Design of Algorithms to be implemented in Java and
not limiting to:
1.
2.
Program to implement binary search algorithm.

Program to implement quick sort algorithm.
3.
4.
5.
6.
Program to implement depth first spanning tree.

Program to implement Knapsack problem.
Program to implement Strassen Multiplication.
Program to implement Matrix Multiplication using Divide and Conquer
Approach.
7.
Program to implement Traveling Salesman Problem.
8.
Program to implement Depth First Search using Traversal Method
9.
Program to implement Breadth First Search using Traversal Method

AScheme and Syllabus MCA 2013

Uploaded by

Copyright:

Available Formats

AScheme and Syllabus MCA 2013

Uploaded by

Document Information

Original Description:

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

AScheme and Syllabus MCA 2013

Uploaded by

Copyright:

Available Formats

Scheme of Examination

Master of Computer Applications

Chandigarh University, Gharuan, Punjab

Total Int. Ext. Total Credits

Master of Computer Applications Semester II

Total Int. Ext. Total Credits

Chandigarh University, Gharuan, Punjab

Total Int. Ext. Total

Total Int. Ext. Total

Chandigarh University, Gharuan, Punjab

Int. Ext. Total

Chandigarh University, Gharuan, Punjab

Int. Ext. Total

MCA 1st Semester

COMPUTER ORGANISATION AND ARCHITECTURE

Time Duration: 3 Hrs.

Total Marks: 100

To have a thorough understanding of the basic structure and operation of a digital

Information Representation: Number systems, BCD codes, character codes, error

I/O Organization: I/O interface, interrupt structure, transfer of information between

MCA 1st Semester

PROBLEM SOLVING AND PROGRAMMING WITH C

Time Duration: 3 Hrs.

Total Marks: 100

To facilitate the development and application of problem-solving skills in

An introduction to programming languages-their need and evolution, An introduction to

Gottfried, Programming with C, Tata McGraw Hill.

MCA 1st Semester

COMPUTER AND INTERNET FUNDAMENTALS

Time Duration: 3 Hrs.

MCA 1st Semester

DISCRETE MATHEMATICAL STRUCTURE

Time Duration: 3 Hrs.

Total Marks: 100

Graphs And Trees: Introduction to graphs, Directed and Undirected graphs,

Discrete Mathematical Structures with Applications to Computers by Trembley &

Discrete Mathematics by A. Chtewynd and P. Diggle (Modular Mathematics

Discrete Mathematics, Schaums Outline series: McGraw-Hills Singapore.

MCA 1st Semester

HUMAN VALUES AND PROFESSIONAL ETHICS

Time Duration: 3 Hrs.

Tripathi, A.N., Human Values, New Age International Publishers.

Hartman, Laura P. and Joe DesJardins, Business Ethics: Decision-Making for

MCA 1st Semester

PROGRAMMING LAB USING C PROJECT -1

Time Duration: 3 Hrs.

WAP to create a function to calculate factorial of a number and calculate sum of

MCA 1st Semester

WEB PROGRAMMING LAB PROJECT 2

Time Duration: 3 Hrs.

MCA 1st Semester

Internal Marks: 100

Time Duration: 3 Hrs.

Communication Skill for Effective Mgmt., Ghanekar,EP

MCA 2nd Semester

Time Duration: 3 Hrs.

debugging, process debugging approaches. Software re-engineering: Reverse

MCA 2nd Semester

Time Duration: 3 Hrs.