• Introduction
• Algorithmic Complexity
• Algorithm design techniques: Greedy algorithms, Divide and conquer, Dynamic programming
• Sorting
• Numeric problems
• Graph algorithms: DFS and BFS, Minimum spanning trees, Shortest path problems, Transitive closure, etc.
• Linear Programming
• NP-completeness, Reductions
• Approximation algorithms

Chapters from book: Goodrich Tamassia:

• Chapter 1, 7, 8, 9, 10, 11, 12, 13, 14, 15, 17, 18, 24, 25