Experiments should include but not limited to :
Implementation of array operations
Stacks and Queues : adding, deleting elements Circular Queue : Adding & deleting elements
Merging Problem : Evaluation of
expressions operations on Multiple stacks & queues :
Implementation of linked lists: inserting, deleting, inverting a linked list. Implementation of stacks & queues using linked lists:
Polynomial addition, Polynomial multiplication
Sparse Matrices: Multiplication, addition.
Recursive and Non-recursive traversal of Trees
Threaded binary tree traversal. AVL tree implementation.
Application of Trees, Application of sorting and searching algorithms
Hash tables implementation: searching, inserting and deleting, searching & sorting techniques.