Unit I: Data Structures and Algorithm Basics
1. Experiment to demonstrate array storage techniques: Row-major and Column-major.
2. Analysis of algorithm performance using asymptotic notations.
3. Implementation of basic operations (insertion, deletion, traversal) on an Array.
Unit II: Sorting, Searching, and Hashing
4. Practical on implementing and comparing Insertion Sort and Quick Sort.
5. Experiment on Binary Search and Linear Search in sorted and unsorted arrays.
6. Implementation of Hash Table with Collision Resolution Techniques.
Unit III: Stacks and Queues
7. Experiment to implement a Stack for expression evaluation (infix to postfix
conversion).
8. Implementation of operations on Circular and Double-Ended Queues.
9. Application of Stacks to solve real-life problems like undo-redo functionality.
Unit IV: Linked Lists
10. Practical to implement operations on a Singly Linked List: Traversal, Insertion, and
Deletion.
11. Experiment to demonstrate the structure and usage of Doubly Linked Lists.
12. Implementation of a Circular Linked List for a round-robin scheduler.
Unit V: Trees and Graphs
13. Practical on creating and traversing a Binary Search Tree.
14. Implementation of Graph Traversal Algorithms: DFS and BFS.
15. Experiment to implement Dijkstra’s Algorithm for shortest path finding.
16. Constructing a Spanning Tree using Prim's and Kruskal's Algorithms.
