List of Experiments / Activities
- 1To implement addition and multiplication of two 2D arrays.
- 2To transpose a 2D array.
- 3To implement stack using array.
- 4To implement queue using array.
- 5To implement circular queue using array.
- 6To implement stack using linked list.
- 7To implement queue using linked list.
- 8To implement BFS using linked list.
- 9To implement DFS using linked list.
- 10To implement Linear Search.
- 11To implement Binary Search.
- 12To implement Bubble Sorting.
- 13To implement Selection Sorting.
- 14To implement Insertion Sorting.
- 15To implement Merge Sorting.
- 16To implement Heap Sorting.
- 17To implement Matrix Multiplication by Strassen’s algorithm.
- 18Find Minimum Spanning Tree using Kruskal’s Algorithm.
- Note: The instructor may add/delete/modify experiments, wherever he/she feels in a justified manner.
Course Outcomes (COs)
After completion of the course student will be able to:
- CO1Write and execute programs to implement various searching and sorting algorithms.K3
- CO2Write and execute programs to implement various operations on two-dimensional arrays.K3
- CO3Implement various operations of Stacks and Queues using both arrays and linked lists data structures.K3
- CO4Implement graph algorithm to solve the problem of minimum spanning tree Program in C or C++ for following:K3
Official AKTU syllabus
This subject is on page 31 of the original AKTU PDF.