Progressive Education Society's

Modern College of Engineering

MCA Department
A.Y.2023-24
Practical Lab Assignments
Class: FY Subject: DATA STRUCTURE LABORATORY Course Code: 310906
[2020 Pattern]
Hrs/Week: 4 Software Used : Turbo C++ for windows Max. Marks:
TW:25 PR:50
Course Outcomes:
CO1 Implement elementary data structures such as Arrays
CO2 Implement representation & application of Linked List
CO3 Demonstrate practical knowledge on the applications of stacks, queues
CO4 Implement nonlinear data structure trees to solve mathematical problems.
CO5 Implement representations & the applications of graphs.
CO6 Implement different searching and sorting algorithms
Assignment List: Total marks 30
Sr. Assignment No./ Title CO Marks
No. Mapped
Assignment No.1 Based on Applications of Array Concepts
1. Write a program to find mean of n numbers using arrays. CO1 1
2. Write a program to interchange the smallest & largest no of n numbers using CO1 1
arrays.
3. Write a program to delete a no from an array which is already sorted in ascending CO1 1
order.
4. Write a program to read and display a 3*3 matrix. CO1 1
5. Write a program to find transpose of a given matrix. CO1 1
6. Write a program to perform transpose of a sparse matrix. CO1 1
7. Write a program to perform addition of two sparse matrices. CO1 2
8. Write a program to perform addition of a two polynomial expressions using arrays. CO1 2
Last Date of Submission: 5/9/23
Assignment No.2 : Based on Linked List
9. Write a menu driven program to perform following operations on singly linked list: CO2 2
Create, Insert, Delete, and Display
10. Write a menu driven program to perform following operations on singly linked list: CO2 2
Create, reverse, search, count and Display
11. Write a menu driven program to perform operations on doubly linked list: CO2 2
Create, Insert, Delete, and Display
12. Implement circular linked list and perform operations on it: CO2 2
Create, Insert, Delete, and Display
13. Represent polynomial as a singly linked list and write a menu driven program to CO2 2
perform addition and evaluation.
Last Date of Submission: 20/9/23
Assignment No.3 Based on Stacks & Queues CO3 2
14. Implement Stack using Array ADT. CO3 2
15. Implement Stack using Linked List. CO3 2
16. Implement stack as an ADT. Use this ADT to perform expression conversion. CO3 2
(Infix – Postfix)
17. Write a program for Expression Evaluation using Stack. CO3 2
18. Implement stack as an ADT. Use this ADT to perform expression conversion CO3 2
(Infix – Prefix)
 Progressive Education Society's
Modern College of Engineering
MCA Department
A.Y.2023-24
Practical Lab Assignments
19. Implement circular queue using arrays CO3 2
20. Implement job scheduling algorithm using queue CO3 2
Last Date of Submission:10/10/2023

Assignment No.4 Based on Trees

21. Create binary tree and perform recursive traversals CO4 5
22. Create binary tree. Find height of the tree and print leaf nodes. Find mirror CO4 5
image, print original and mirror image using level-wise printing.
Last Date of Submission:25/10/2023
Assignment No.5 : Based on Graph
23. Represent graph using adjacency list/adjacency matrix and perform Depth First CO5 2
Search.
24. Represent graph using adjacency list/adjacency matrix and perform Breadth First CO5 2
Search.
25. Implement minimum cost spanning tree algorithm. CO5 2

26. Implement shortest path algorithm CO5 4

Last Date of Submission:10/11/2023
Assignment No.6 Based on Searching & Sorting CO6
27. Write a program to implement Merge sort method. CO6 2
28. Write a program to implement Bubble sort method. CO6 2
29. Write a program to implement Fibonacci Search. CO6 2
30. Write a program to implement Merge sort method. CO6 2
31. Write a program to implement Heap sort method CO6 2
Last Date of Submission:15/11/2023

Ms. Ashwini Garkhedkar

Dr. Pradnya Muley Dr. Pradnya Muley Dr. Pradnya Muley
Course Coordinator Module Coordinator HOD