Design and analysis of algorithms. Turing machines, NP-Complete theory, best, average, and worst case analysis, divide-and-conquer, greedy method, dynamic programming, graph traversal, backtracking, and branch-and bound techniques. Sorting, searching, graph algorithms, and optimization.