Course InformationTitle: CS 137: Algorithm Analysis
Term: Fall 2021
Room: 301 Collier-Scripps Hall
Time: MW 9:30–10:45am
This course focuses on analyzing the correctness and efficiency of algorithms using methods that are mathematically rigorous. Various approaches to the development of algorithms will be examined such as divide-and-conquer, dynamic programming, greedy techniques, and backtracking. Complexity classes such as P and NP will also be introduced.