Algorithm Design Course
- Assignment 1 - Sorting
- Assignment 2 - Fibonacci series using recursion and repeated squaring
- Assignment 3 - Working on numbers in arbitrary base
- Assignment 4 - Arithmetic on base b numbers
- Assignment 5 - Modular arithmetic
- Assignment 6 - Modular division
- Assignment 7.1 - Implementing printAdjMatrix(), countEdge(), loadAdjList() and printAdjList()
- Assignment 7.2 - Implementing runFW(), runDijkstra(), printDijkstraPathTo() and printFWPathBetween()
- Assignment 8 - Longest Common Subsequence and Shortest Common Supersequence