1. Graph Traversal Technique

a) BFS b) DFS

2. Linear Queue

a) Array b) Linked List

3. Minimum Spanning Trees

a) Kruskal's Algorithm b) Prim's Algorithm

4. Polynomial

a) Addition b) Merging

5. Queue

a) Circular Queue b) Doubly Ended Queue c) Priority Queue

6. Searching

a) Binary Searching b) Linear Searching

7. Shortest Path

a) Dijkstra Algorithm b) Floyd-Warshall's Algorithm

8. Sorting

a) Bubble Sort b) Counting Sort c) Heap Sort d) Insertion Sort e) Merge Sort f) Quick Sort g) Selection Sort

9. Stack

a) Array b) Linked List

10. Tower of Hanoi

View Experiment