Program No. Objective of Experiment
1 To implement addition and multiplication of two 2D arrays.
2 To transpose a 2D array.
3 To Implement Single Linked list with different insertion and deletion operations
4 To implement Doubly Linked list with different insertion and deletion operations
5 To implement stack using array
6 To implement queue using array.
7 To implement circular queue using array.
8 To implement stack using linked list.
9 To implement queue using linked list.
10 To implement BFS using linked list.
11 To implement DFS using linked list.
12 To implement Linear Search.
13 To implement Binary Search.
14 To implement Bubble Sorting.
15 To implement Selection Sorting.
16 To implement Insertion Sorting.
17 To implement Merge Sorting & quick Sorting.
18 To implement Heap Sorting.
19 To implement Matrix Multiplication by strassen’s algorithm
20 Find Minimum Spanning Tree using Kruskal’s Algorithm
- Teacher: MR ANKIT VERMA [MCA]