Syllabus
Algorithmic Design Paradigms, Divide and Conquer, Analysis for Divide and Conquer, Sorting algorithms, Greedy Algorithms, Dynamic Programming, Graph Algorithms (DFS, BFS, Topological sort, Spanning Trees, All pair shortest path, Matching Max flow)
Text Books
- T. H. Cormen, C. E. Leiserson, R. L. Rivest and C. Stein, Introduction to Algorithms, MIT Press, 2009.
- Kleinberg and Tardos, Algorithmic Design, Pearson, 2013.
References
- G. T. Heineman, G. Pollice, S. Selkow, Algorithms in a Nutshell, O'Reilly Media, 2008.
- Narasimha Karumanchi, Data Structure and Algorithmic Thinking with Python - CareerMonk Publications, 2015.
- Art of Computer Programming Volumes 1-4, Addison-Wesley Professional, 2011.