All DS Projects

Maximum flow in directed graph, Compare the performance of MST’s that
are crazy and eager
version of prim’s and kruskal’s algorithms, Maximum matching in a
bipartite graph G=(X,Y,E), Compare the performance of
different Hashing algorithms, Implement the ADT using Skip lists, Splay
and AVL tree. Arbitrary precision arithmetic package etc.