MCA II SEM Project Titles
PROJECT TITLES
(MCA-2 SEM 2013)
1. Write a program to generate two different classes 1. Node and 2. Linked_list. A node is a generic node defied using a template. A Linked_list is a class containing arbitrary number of nodes. Adding a node object to a Linked_list object can be done using + and deletion can be done using -Constructors for both node and Linked_list is to be provided. + should also be overloaded for adding two linked lists and – should also be used for subtracting elements of one linked list from the another.( 2 students allow)
2. Write a program to generate a class representing a graph. It must contain two other classes 1.
Nodes and 2. Edges Appropriate constructors should be used for all three classes. Provide BFS,
DFS, Shortest path, spanning tree using algorithm of your choice. Use Matrix and edge list
representation methods to do it. ( 3 students allow)
3. Write a program for a stack class and an element class being contained in it. Implement in such a way that to implement it using arrays and linked list is decided at compile time.
( 2 students allow)
4. Create a class for queue and an element class. Implement in such a way that to implement it using arrays and linked list is decided at compile time. ( 2 students allow)
5. Create a class for dequeue and an element class for it. Implement in such a way that to implement it using arrays and linked list is decided at compile time. ( 2 students allow)
6. Create a class for a priority queue with an object of element class. Implement that to represent scheduling in multiprogramming environment using round robin priority based scheduling.
( 2 students allow)
7. Create a class of linked list. Use that class for creating a multi-list. Ex. Sparse matrix
( 2 students allow)
8. Create a class for matrix. Provide all possible operations including matrix inverse and matrix
multiplication, subtraction, dot product of two vectors. Define a point class. It should have x and
y co-ordinates. Define constructor which work like point p1(5,7);where 5 is x co-ordinate and 7 is y co-ordinate. Overload operator – to find out distance between two different points. The distance is defined as square root of ((square of(x2) – square of (x1)) + ((square of (y2) – square of (y1))). Overload operator () such that if we define point P1 and then write P1(2,3) then 2 and 3 would be x and y co-ordinate respectively for point P1. Provide all possible validations using exception handling. ( 2 students allow)
9. Define a class customer, having customer name, address, list of items purchased and total bill. The item list is an array of items. This array is a dynamic array. Write a dynamic constructor
which accepts values dynamically and work. Ex. If we write customer FirstCutomer (“Bob”,
“Ahmedabad”, List). Here, list is a dynamic array. Total bill will be calculated looking at item
names and finding out from one more array of items and price of each item. Read five customers
and then display total bill for all of them. Provide copy constructor such that if we write customer SecondCustomer(FirstCustomer)then second customer should be properly defined. Overload assignment operator and also define destructor. ( 2 students allow)
10. Define class Employee. Have name, address, job assignments given to him and achievements by him. Define a dynamic memory constructor for employee class for job assignments and
achievements. Provide overloaded assignment operator and also the destructor. Define a static
function for displaying employee object available at any point of time. ( 2 students allow)
11. Define a class Number which contains integer as data type. The class should be defined such that if we write Number i; andint j, then it should be possible to have statements like i=j and j=i to work properly. It should have conversion functions from char data type and string in such a way that if “24” is input, it converts it into integer 24 and if ‘3’ is input, it converts into int 3. Provide default and one argument constructors for the class. ( 2 students allow)
12. Define two classes. One class is named Person. Second class is named Employee. Provide
appropriate constructors for each of the classes. Define any data and function members you like
to accomplish following.
a. If we define person P1; and employee E1 and then if we write employee e2=p1 then it
should be able to extract required information from p1 and create e2.
b. Similarly if we write person p2 = e1; then it should create person p2 with required
information. ( 2 students allow)
13. Define a class Time. It should contain three data members representing hours minutes and
seconds. Provide all possible constructors for that class. Define one more Time class where time
is represented as seconds elapsed till January 01 1800. Both classes should have constructors
which accept string input and convert them to appropriate format. Define constructors and
operators such that the objects of both classes can seamlessly be converted to another type.
( 2 students allow)
14. Define a class Parts. Write a program to represent part as an object. A part can contain other parts as members. Here all the parts of a given part are not of the same type of the parent part. Provide operations to list all required parts for any given part looking at deepest of hierarchy. Provide routines for inserting and removing parts or the information related to parts.
( 2 students allow)
Find roots of Non-Linear Equations using the below methods:
15. Bisection method
Newton Raphson method ( 2 students allow)
16. Regula False Position method
Secant method ( 2 students allow)
17. Successive Approximation method
Birge Vieta method ( 2 students allow)
18. Lagrange Interpolation
Inverse Interpolation ( 2 students allow)
19. Newton’s forward difference interpolation
Newton’s backward difference interpolation ( 2 students allow)
20. Newton’s divided difference interpolation ( 1 Student Allow)
Approximation using the following methods
21.
1. Fitting a straight line
2. Fitting an exponential curve ( 2 students allow)
22. Approximation by Taylor series ( 1 Student Allow)
Solve Numerical Differentiation and Integration Problems using following methods
23.
1. Differentiating a function
2. Trapezoidal Rule
3. Simpson’s 1/3 Rule
4. Simpson’s 3/8 Rule
5. Gauss Quadrature Integration ( 3 Students Allow)
Perform the below mentioned matrix operations/methods
24.
1. Inverse of a matrix
2. Gauss Elimination method
3. Gauss Seidel method (3 Students Allow)
Find the solution of the ordinary differential equations using the below mentioned methods
25.
1. Runge-Kutta 4th order
2. Milne Simpson’s Predictor Corrector method ( 2 students allow)
26.
1. Runge-Kutta 4th order
2. Adam’s Moulton Predictor Corrector method ( 2 students allow)
Find roots of Linear Equations using the below methods:
27. Eigen value & Eigen vector ( 1 student allow)
Note : 1. Last Date of Project title submission is 20 Feb 2013
(After 20 Feb Not Accepted any Topics)
2. Group Members & Project Title suggested by itself.
SUBMISSION DATE : 20 FEB 2013
HOD(MCA) Project - Co-Ordinator
Mr. Pankaj Nanal Mr.Vikas Katariya