1> Doubly Linked List
sorting, merge, etc.
2> Sparse Matrix
Addition & Multiplication
3> Implementing a Polynomial
using Generalised Linked List
4> Implementing a Polynomial
using Circular Linked List
5> Conversion of infix
expression to postfix, and it's evaluation
6> Implementing a Circular
Queue, with add, remove, peek (into head & tail) functions.
7> Implement a Binary
Tree, and perform Recursive & Non-Recursive Traversals on it
8> Swap the right &
left nodes of the given binary tree
9> Make a Binary Tree
with data elements being Strings
10>Thread a Binary Tree,
and perform Inorder, Preorder & Postorder Traversals on it
11>Create a Graph using
Adjacency Lists, perform DFS and BFS
12>Create Adj. List. Graph,
apply Dijkstra's Algorithm to determine Shortest path
13>Create Adj. List. Graph,
apply Kruskal's & Prims' algo. to find the minimum spanning tree
14>To Create a Hash table
(linear Probing) with & without Replacement
15>To implement a Direct
Access File (use lib. functions fread() fwrite() fseek() )
16>To Implement a indexed
Sequential file (use 2 files - record file & index file, use f... func.)
17>To implement AVL algorithm
for height balancing of Trees
18>To implement QuickSort
procedure (recursive method)