COURSE OUTCOMES:
On successful completion of the course, students will be able to
CO1 : Experiment with the simulation of Arrays, Stack, Queues and Lists.
CO2 : Interpret the implementation of Binary Trees and Hashing.
CO3 : Simulate Graph representations and its traversals.
LIST OF EXPERIMENTS:
1. Implementation of Sorting and Searching using Array ADT
Insertion Sort
Quick Sort
Merge Sort
Linear and Binary Search
2. Implementation of the following ADTs
List
Stack
Queue
Tree
3. Implementation of hashing techniques
Separate Chaining
Open Addressing
Extensible Hashing
4. Implementation of Graph Traversals
Breadth First Search
Depth First Search