This course is all about implementing different advanced data structures and algorithms.
Please check Readme in each project for detailed problem description.
|
Long Projects |
Title |
|
LP1 |
BigInteger |
|
LP2 |
Euler tours in directed graphs |
|
LP3 |
Optimal branchings (directed MST) in directed graphs |
|
LP4 |
Counting and enumeration problems in graphs |
|
LP5 |
Skip Lists |
|
LP6 |
Multi-dimensional search |
|
LP7 |
Maximum flow problem (Dinitz's algorithm and Relabel-to-front algorithm) |
|
Short Projects |
Title |
|
SP1 |
Merge Sort on Generic arrays and Diameter of Tree |
|
SP2 |
Lists, stacks and queues |
|
SP3 |
DFS and its applications |
|
SP4 |
Recursion problems |
|
SP5 |
Partition, Quick sort, Selection |
|
SP6 |
Priority queues and their applications, HuffmanCoding, Prims algorithms, BinaryHeap, Indexed Heap |
|
SP7 |
Binary search trees, AVL Trees, Splay Trees, RedBlack Tree |
|
SP8 |
Shortest paths,Permutations,Combinations |