LAB ASSIGNMENT REPORT

On

(ECS 355)
(Data Structures Using C++ LAB)

COLLEGE OF COMPUTING SCIENCES AND INFORMATION TECHNOLOGY

Teerthanker Mahaveer University, MORADABAD
Session: July-Dec 2023

Submitted To: Submitted By:

Dr. ANIL SHARMA Student Name :
Assistant Professor, CCSIT Enrollment No.
Program :
Assignment-1 (Section 1 & 2)
1. General
S. Program Page No Date Signature Remarks
No.
1. WAP to find factorial of a given number.

2. WAP to find a given number is prime or not.

3. WAP to find a given number is armstrong or not.

4. WAP to find the prime numbers and Armstrong

numbers within the range.
5. Write a C++ Program to display Names, Roll No., and
grades of 3 students who have
appeared in the examination. Declare the class of
name, Roll No. and grade. Create an
array of class objects. Read and display the contents of
the array.
6. Write a C++ program to declare Struct. Initialize and
display contents of member
variables.

7. Write a C++ program to declare a class. Declare

pointer to class. Initialize and display the contents of
the class
member.
8. WAP to demonstrate the default arguments.
9. Write a C++ program to implement inheritance.
10. WAP for factorial and Fibonacci series using recursion.
11. WAP to solve TOWER of Hanoi Problem.
12. Write a C++ program to implement polymorphism using
function overloading.
13. Write a C++ program to implement polymorphism using
function overriding.
14. Write a C++ program to implement inline function.
15. Write a C++ program to implement and show the use of
friend function.
16. Write a C++ program to implement and show the use of
constructor and destructor.
17. Write a program to demonstrate constructor
overloading.
18. Write a program to demonstrate call by value, call by
address and call by reference.
19. WAP to demonstrate the memory allocation operators.

20. WAP to demonstrate the static data members for the

class..
21. WAP to demonstrate the friend function, friend
member function and friend class.
Assignment-1 (Section 1 & 2)
2. Array
S. Program Page Date Signature Remarks
No. No
1. WAP to insert a specific element in an array of size n.
2. WAP to delete the specific element in an array.
3. WAP to to print the sum of the diagonal element of the M*N
square matrix
4. WAP to find the maximum element in a array & find how
many times it is coming in a array of size n
5. WAP to calculate sum of the element of two square matrix
pointer
6. WAP to calculate product of the element of two square
matrix using pointer
7. WAP to find the maximum element in an array A of size n
(using all loop & recursion)
8. WAP to search an element in integer array ,if found then
return the position of element of array else return -1.
9. WAP to merge two sorted array and make a combined sorted
array. If the input array is not sorted that (firstly sort both the
array using insertion sort method).
10. WAP to implement operations upon sparse matrix
Assignment-2 (Section 3)
3. Searching & Sorting
S. Program Page Date Signature Remarks
No. No
1. WAP to search an element using Binary Search Method.
2. WAP to sort a array of given numbers in ascending order
using selection sort method.
3. WAP to sort a array of given numbers in ascending order
using bubble sort method.
4. WAP to sort a array of given numbers in ascending order
using Insertion sort method.(note :- input numbers in an
array should be random .)
5. WAP to sort a array of given numbers in ascending order
using Quick sort method.
6. WAP to sort a array of given numbers in ascending order
using Heap sort method.
7. WAP to sort a array of given numbers in ascending order
using Two-way Merge Sort method.
Note:- Try to demonstrate the complexity of different sorting algorithm with graph.
Assignment-3 (Section 4,5)
4. String
S. Program Page Date Signature Remarks
No. No
1. WAP a program to check a given string is palindrome or not
(the user should give the string
2. WAP for comparison of two string without using strcmp()
function. The user should gives the string
3. Find the substring in a string. The string & the length & the
starting position of the substring are given by user
4. WAP to calculate the length of string without using library
functions
5. WAP to reverse the string without using library function
6. WAP to concatenate the two string without using library
function
7. WAP to copy one string to another string without using
library function
8. WAP which will read a text & count all occurrences of a
particular word in given string .

5. Stack & Queue

S. Program Page Date Signature Remarks
No. No
1. WAP to perform push & pop operation on the stack. Check
the underflow & overflow condition using array.
2. WAP to implement multi Stack with array.
3. WAP to implement the Queue using Array.
4. WAP to implement Circular Queue with array.
5. WAP to implement linear Queue with shifting in an array.
Assignment-4 (Section 7,8)
7. Linked List
S. Program Page Date Signature Remarks
No. No
1. WAP for making a linear linked list with following operation
:-
(1) Insertion (at beginning , at end ,at particular
position , after particular position , before
particular position )
(2) Deletion (at beginning , at end , particular
position , particular element )
(3) Traverse in Reverse order .
(4) search an element
(5) Sort the elements.
2. WAP with above operations for the doubly linked list .

8. Tree
S. Program Page Date Signature Remarks
No. No
1. WAP to search the element in a Binary search tree.
2. WAP for Tree Traversal in Pre-order.
3. WAP for Tree Traversal in In-order.
4. WAP for Tree Traversal in Post-order.
5. WAP to insert and delete a node from the BST.
6. WAP for Graph Traversal (BFS , DFS )
(NOTE:- Make a single program for all operations of a BST )

Prepared by :-
Dr. Anil Sharma
Assistant Professor
CCSIT, TMU