Click Here to Download PDF
Object-Oriented Programming Systems: MCA 201
Marks Scale : 100 marks (End Sem. Exam : 60, Int. : 40) Credits: 4
(3-1-0)
Unit I: 15L
Introduction: Concept, Benefits and Application of OOP, Structures of C++ Programming,
Data types, Operators in C++, Functions in C++: Function Prototyping, Call by value, Call by
reference, Return by reference, Inline Functions, Default arguments, Function overloading,
Friend and Virtual Functions, Built-in Function and Control Structure: Console based I/O and
related built-in I/O function, Static data members and member functions,Concept of header files,
Preprocessor directives, Control Structures: Decision making and Branching, Loop Control
Structures, Other statements : Break, Continue, Goto, Exit, Dynamic memory allocation and
deallocation.
Unit II: 15L
Classes and Objects: Introduction to classes and creating objects, Friend classes, Static class
members, Nested classes, Memory allocation for objects, Array of objects, Objects as function
arguments, Constructor and Destructor.
Manipulating Strings: Introduction, Creating (string) objects, Manipulating String Objects,
String characteristics and uses.
Unit III: 15L
Inheritance, Pointers, Virtual Functions and Polymorphism: Definition, Types of
inheritance, Virtual base classes, Abstract classes, Pointer to objects, pointer to derived class,
Pure virtual functions, Operator overloading, Early vs. late binding.
Unit IV: 15L
I/O System Basics: C++ streams, C++ stream classes, Formatted I/O, Unformatted I/O
operations, Overloading << and >>, Extractor and manipulator functions.
File I/O and Array Based I/O: Classes for file stream operations, Opening and closing of file,
detecting EOF, Random access, I/O status, Array based class, Dynamic arrays
Templates and Exception Handling: Generic Functions, Templates, class templates, function
templates, Basics of exception handling, Exception handling mechanism, Throwing mechanism,
Catching mechanism, Rethrowing an exception
Text Books:
1. E Balaguruswamy: Object Oriented Programming with C++, 5th Edition, TMH (2011).
2. YashavantKanetkar: Let Us C++, 2nd Edition, BPB (2002).
3. Herbert Schildt: C++: The Complete Reference, 4th Edition, TMH (2003).
4. Deitel&Deitel: C++: How to Program, 6th Edition, PHI (2008).
5. K R Venugopal&RajkumarBuyya: Mastering C++, 2nd Edition, TMH (2013).
Operating Systems: MCA 202
Marks Scale : 100 marks (End Sem. Exam : 60, Int. : 40) Credits: 4
(3-1-0)
Unit I: 15L
Introduction: Introduction of Operating System objective and function, Evolution of OS.
Types of O.S.:Mainframe, Desktop, Multiprocessor, distributed, Client-Server, Clustered and
Real-Time Systems. Hardware Protection.Operating System Structure: System components,
Operating system services, System calls, System Programs, System structure.Process
Management: Concept of Process, process scheduling, operations on processes, Interprocess
communication, Sockets, Remote procedure Call,Threads: Overview, Multithreading models,
Pthreads.
Unit II: 15L
Process Synchronization: Critical Section, Semaphore, Classical problem of synchronization,
Monitors.CPU Scheduling: Scheduling concepts, preemptive & non preemptive scheduling,
Scheduling criteria, Scheduling algorithms (FCFS, SJF, RR, Priority, multilevel queue,
multilevel feedback queue, Multiprocessor, Real-time scheduling), Algorithm evaluation.
Deadlocks:System model, Deadlock characterization, Deadlock Prevention, Deadlock avoidance
and Deadlock detection, Recovery from deadlock. Memory Management: Background, logical
vs. physical address space, swapping, contiguous memory allocation, paging, segmentation,
segmentation with paging.
UnitIII: 15L
Virtual Memory: Demand Paging, performance, Page Replacement algorithms (FIFO, Optimal,
LRU, LRU approximation, Counting-based page replacement), Allocation of frames, Thrashing.
File Systems: File concept, access method, directory structure,protection, file-system structure,
implementation, allocation methods, and free-space management.I/O Management:
Overview,I/O hardware (polling, interrupts, DMA), application I/O interface, kernel I/O
subsystem.
UnitIV: 15L
Disk Management: Disk Structure, Disk Scheduling (FCFS, SSTF, SCAN, C-SCAN& LOOK
scheduling), Disk management, RAIDstructure.Distributed system: Definition, advantages,
types of distributed OS.Protection& Security: Goals of protection, domain of protection, the
security problem, program threats, system threads.
Text Books:
1. Silberschatz A., Peter B. Galvin, Greg Gagne: “Operating System Concepts”, 9th Edition,
John Wiley & Sons, Inc. (2013).
2. M. Milenkovic: “Operating System : Concept & Design”, 2nd Edition, McGraw Hill
(2001).
3. H. N. Dietel: “An Introduction to Operating Systems”, 3rd Ed., Addison Wesley (2003).
4. Tanenbaum, A. S. Woodhull: “Operating System Design & Implementation”, 3rd Ed. Pearson,
(2006).
Systems Analysis & Design: MCA 203
Marks Scale : 100 marks (End Sem. Exam : 60, Int. : 40) Credits: 4
(3-1-0)
Unit I: 15L
Introduction of System: System Definition and concepts: General Theory systems,Types if
systems, Basic principles of successful systems, Approaches to system development, Role and
Need of Systems Analyst. Qualifications and responsibilities, System Analysis as a Profession.
System Development Cycle:Introduction to SDLC. Various phases of SDLC,
Documentation:Principles of Systems Documentation, Types of documentation and their
importance.
Unit II: 15L
System Planning: Data and fact gathering techniques: Interviews, Group Communication -
Questionnaires; Assessing Project Feasibility. Modern Methods for determining system
requirements.
System Design &Modelling:Process Modeling, Logical and physical design, Conceptual Data
Modeling: Entity /Relationship Analysis, Entity-Relationship Modeling, ERDs and DFDs,
Concepts of Normalization. Process Description: Structured English, Decision Tree, Table.
Unit III : 15L
Input/Output and Interface Design :
Classification of forms, Input/output forms design. User-interface design, Graphical interfaces.
Standards and guidelines for GUI design, Designing Physical Files and Databases: Designing
Fields, Designing Physical Records, Designing Physical Files,Designing Databases, Introduction
to CASE Tools; Features, Advantages andLimitations of CASE Tools, Awareness about some
commercial CASE Tools.
System Implementation & Maintenance: Input/Output& Interface Design,Planning
considerations, Conversion methods, procedures and controls, System acceptance criteria,
System Evaluation and Performance, Testing and Validation. Preparing, User Manual,
Maintenance Activities and Issues.
Unit IV: 15L
OO Analysis &Design :OO Development Life Cycle and Modeling. Static and dynamic
modeling.Comparison of OO and Module-oriented Approach. Modeling using UML ; The UML
diagrams; the process of Object modeling.
Introduction to MIS : Meaning and role of MIS, Systems approach to MIS. Types of
information systems, Case Studies (Illustrative) : MIS for Accounting and Finance Function,
MIS for Marketing System.
Text Books:
1. J.A.Hoffer, J.F.George, J.S.Valacich, and P.K.Panigrahi: “Modern Systems Analysis and
Design”, Pearson Education, Fourth Edition (2006).
2. Dennis and B. H. Wixom: “Systems Analysis and Design”, John Wiley & Sons, Fifth Edition
(2012).
3. J.L.Whitten, L.D.Bentley: “Systems Analysis and Design Methods”, Tata McGraw-Hill,7th
Edition (2008).
4. Kendall & Kendall: “Systems Analysis and Design”, Pearson Education,Seventh Edition (2007).
Data Structures using C: MCA 204
Marks Scale : 100 marks (End Sem. Exam : 60, Int. : 40) Credits: 4
(3-1-0)
UNIT I: 15L
Analysis of Algorithms:Rate of growth, time complexity and space complexity,O-notation,
Omega notation and theta notation.
Introduction to data structure: Definition,Primitive and composite, Static and Dynamic.
Linked List: List vsArrays,Concept and Structure of linked list,Operations on linked list.
Complex Linked List structures:Circularly-LinkedList,Doubly Linked List, Multilinked Lists
UNIT II: 15L
Stacks: LIFO structure,Operations on stacks,Representation of stacks as arrays and linked list.
Queues: FIFO structure,Operations on queues,Representation of queues as arrays and linked list.
Priority Queues, Circular Queues.
Trees: Implementing Binary Trees,Traversal (breadth-first, depth-first),Expression Trees(Infix,
Prefix, Postfix Traversals),Search Trees,Binary Search Trees.
UNIT III: 15L
Sorting:Bubble Sort, Selection Sort,InsertionSort,Shell Sort ,Quick Sort,Heap sort, Radix
Sort,Merge Sort.
Searching:Sequential Search ,Binary Search,Binary Search Tree.
Hashing Techniques:Address calculation techniques, Common hashing functions,Collision
resolution
UNIT IV: 15L
Graphs: Terminology,Operations (Add vertex, Delete Vertex, Add Edge, Delete Edge, Find
Vertex),Traverse Graph (Depth-First, Breadth-First),Graph Storage Structures (Adjacency
Matrix, Adjacency List)
Graph Algorithms: Shortest Path Algorithm, Networks(Maximum flow),Minimum Spanning
Tree, Dijkstra’s algorithm, Kruskal’s algorithm, Prim’s algorithm, Warshall’salgorithm.
Text Books:
1. AM Tanenbaum, Y Langsam & MJ Augustein: ”Data structure using C”, Prentice Hall
India, 1st Edition (1989).
2. Seymour Lipschutz: “Data Structures with C (Schaum’s Outlines)”, Tata McGraw Hill, 2
Edition (2010).
3. Ashok N Kamthane: “Introduction to Data Structures in C”, Pearson Education India, 1st
Edition (2008).
4. Narasimha Karumanchi: “Data Structures and Algorithms Made Easy”, Career Monk
Publications, 2nd Edition (2011).
Numerical Analysis: MCA 205
Marks Scale : 100 marks (End Sem. Exam : 60, Int. : 40) Credits: 4
(3-1-0)
UNIT I: 15L
Finite Differences: Introduction, Forward, Backward and Central differences, Factorial
Notation, Difference Operators.
Interpolation: Newton’s Forward and Backward Interpolation Formula, Gauss’s Forward and
Backward Interpolation Formula, Lagrange’s Interpolation Formula, Newton’s Divided
Difference Formula, Everett and Bessel Interpolation formulae, Lagrange’s, Hermite and spline
interpolation.
Curve Fitting: Introduction, Linear Law and Laws reducible to Linear Law, Graphical Method,
Least Square Method, Fitting of other curves.
UNIT II: 15L
Solutions of algebraic and transcendental equation: Introduction, Bisection method, Newton-
Raphsan method, Newton’s method for multiple roots, Lin-Barstow’s and Graffe’s method for
complex roots.
Solution of Simultaneous Equations: Introduction, Gauss elimination, Gauss-Jordan method,
Gauss-Siedel Methods.
Matrix Inversion and Eigen Value Problem: Introduction, Matrix inversion:Gauss elimination
method,Gauss Jordan method,Factorization method, Partition method,Eigen value and Eigen
vector, Power method, Jacobi method,Given method
UNIT III: 15L
Numerical Differentiation and Integration: Formulae for derivatives, Trapezoidal, Simpson’s
one-third and three-eighth Rule, Weddle, rule, Gauss-Legendre methods of integration.
Differential Equations: Picard’s method, Euler’s and Modified Euler’s method, Runge-Kutta
methods, Predictor-Corrector methods- Milne’s and Adams-Bashforth methods.Solution of
simultaneous differential equations. Solutions of second order differential equations.
UNIT IV: 15L
Algorithms: Newton’s Interpolation, Gauss elimination and Gauss-Siedel method, Simpson’s
1/3, 3/8 rule and Trapezoidal rule of numerical integration, Euler’s method and Runge-Kutta
methods of differential equation.
Text Books:
1. B. S. Grewal: “Numerical Methods”, Khanna Publications, 8th Edition (2009).
2. S.S. Shastri: “Numerical Methods”,PHI publications,4th Edition (2005).
3. M. K. Jain &Iyengar: “Numerical Methods”, New Age International, 5th Edition (2003).
4. V. Rajaraman: ”Computer Oriented Numerical Methods”, PHI publications, 3rd Edition
(1993).
5. K. SankaraRao: ”Numerical Methods”, PHI publications, 3rd Edition (2007).
Programming in C++: MCA 291
Marks Scale : 100 marks (End Sem. Exam : 60, Int. : 40) Credits: 2
(0-0-3)
List of Experiments: (Using Turbo C++)
1. Write a cpp program to find a perfect number.
2. Write a cpp program, which explain concept of “array of object".
3. Write a cpp program, which explain concept of “object as an arguments".
4. Write a program to evaluate the functions to 0.0001% accuracy.
SUM=1+(1/2)2+(1/3)3+(1/4)4+...
5. Write a cpp program for a friend function.
6. Write a cpp program for a function friendly to two classes.
7. Write a cpp program for class with constructors.
8. Write a cpp program for overloaded constructors.
9. Write a cpp program of parameterized constructors.
10. Write a cpp program of copy constructors.
11. Write a cpp program of implementation of destructors.
12. Write a cpp program for implementation of unary minus operator.
13. Write a cpp program for implementation of binary plus (+) operator.
14. Write a cpp program for implementation of a single inheritance of public data member.
15. Write a cpp program for implementation of a single inheritance of private data member.
16. Write a cpp program of multilevel inheritance.
17. Write a cpp program of multiple inheritances.
18. Write a cpp program of hybrid inheritance.
19. Write a cpp program of virtual base class.
20. Write a cpp program which use constructors in derived class.
21. Write a cpp program for implementation of pointers to objects.
22. Write a cpp program for implementation of this pointer.
23. Write a cpp program for implementation of virtual function.
24. Write a cpp program of working with single file. (Creates a file with constructor function).
25. Write a cpp program of working with multiple files (creates a file with open( ) function).
26. Write a cpp program that demonstrates several exception types being caught with the catch(.....)
exception handler.
27. Write a program to read a list containing item, name, item code, and cost interactively and
produce a three column output as shown below.
NAME CODE COST
-----------------------------------------------------------
Turbo C++ 1001 250.95
C Primer 905 95.70
------- ---- -------
------- ---- -------
------- ---- -------
-----------------------------------------------------------
Note that the name and code are left-justified and the cost is right-justified with a precision of two digits.Trailing zeroes are shown.
Data Structures Laboratory using C: MCA 292
Marks Scale : 100 marks (End Sem. Exam : 60, Int. : 40) Credits: 2
(0-0-3)
List of Experiments:
1. Write a program in C to demonstrate Arrays for the following operations: Create, Display,
Search, Modify.
2. Write a menu driven program that implements singly linked list for the following operations:
Create, Display, Count, Insert, Delete, Search, Copy, Reverse, Sort.
3. Write a menu driven program that implements singly linked list for the following operations:
Create, Display, Merge, Union, Intersection, Difference.
4. Write a menu driven program that implements doubly linked list for the following operations:
Create, Display, Count, Insert, Delete, Search, Copy, Reverse, Sort.
5. Write a program in C to implement simple Stack as an array for the following operations:
Create, Push, Pop, Search, Delete.
6. Write a program in C to implement simple Stack as linked list for the following operations:
Create, Push, Pop, Search, Delete.
7. Write a program in C to implement simple Queue as an array for the following operations:
Create, EnQueue, DeQueue, Search, Delete.
8. Write a program in C to implement simple Queue as linked list for the following operations:
Create ,EnQueue, DeQueue, Search , Delete.
9. Write a menu driven program that implements Singly circular linked list for the following
operations:Create, Display, Count, Insert, Delete, Search, Copy, Reverse, Sort
10. Write a menu driven program in C to
a. Create a binary search tree
b. Traverse the tree in Inorder, Preorder and Post Order
c. Search the tree for a given node and delete the node
11. Write a C program to implement
a. Bubble Sort
b. Selection Sort
c. Insertion Sort
12. Write C program to implement
a. Shell Sort
b. Heap sort
13. Write C program to implement
a. Radix Sort
b. Merge Sort
14. Write a program to implement double hashing technique to map given key to the address
space. Also write code for collision resolution (linear probing)
15. Write a program in C to represent graphs as adjacency matrix, adjacency list.
16. Write a program in to implement graphs operations : Add vertex, Delete Vertex, Add Edge,
Delete Edge, Find Vertex
17. Write a program in C to implement Breadth First search and Depth First Search using linked
representation of graph.
18. Write a program in C to implement Dijkstra’s shortest path algorithm for a given directed graph.
19. Write a program in C to insert and delete nodes in graph using adjacency matrix.
20. Write a program in C to create a minimum spanning tree using Kruskal’s algorithm.
21. Write a program in C to create a minimum spanning tree using Prim’s algorithm.