Searching, sorting, hashing, Asymptotic Worst case time and space complexity. Algorithm design techniques: greedy, dynamic programming and divide-and-conquer. Graph traversals, minimum spanning trees, shortest paths.

Detailed Syllabus covered in Notes

Time and Space Analysis, Sorting Techniques, Greedy Algorithm, Dijkstra Algorithm, Bellman-ford Algorithm, DAG (Directed acyclic Graph), Dynamic Programming, 0-1 Knapsack, subset sum problem, TSP (Travelling Salesman Problem), Floyd Warshal algorithm

Related Links