Fall 2022 Course Descriptions
CS 160-01S Algorithms
M. Allen, K. Edwards
MW 4:30-5:45p, Pearson 104
Introduction to the study of algorithms. Strategies such as divide-and-conquer, greedy methods, and dynamic programming. Graph algorithms, sorting, searching, integer arithmetic, hashing, and NP-complete problems.
Prerequisite: COMP 15 and COMP/MATH 22 or 61.