(See Syllabus)
| Sl. No | Experiment |
|---|---|
| 1 | Stack using Array |
| 2 | Queue using Array |
| 3 | Circular Queue |
| 4 | DEqueue |
| 5 | Infix to postfix conversion |
| 6 | Postfix evaluation |
| 7 | Linear Search |
| 8 | Binary Search |
| 9 | Singly Linked List |
| 10 | Polynomial Addition using Array |
| 11 | Sparse Matrix Addition |
| 12 | Polynomial Addition and Multiplication using Linked List |
| 13 | Bubble Sort |
| 14 | Selection Sort |
| 15 | Insertion Sort |
| 16 | Heap Sort |
| 17 | Merge Sort |
| 18 | Quick Sort |
| 19 | Depth First Search (DFS) |
| 20 | Breadth First Search (BFS) |
| 21 | Binary Tree |
| 22 | Hashing |