CS 155 - Introduction to the Design and Analysis of Algorithms

3 unit(s)
Algorithm design techniques: dynamic programming, greedy algorithms, Euclidean and extended Euclidean algorithms, Discrete and Fast Fourier transforms. Analysis of algorithms, intractable problems and NP-completeness. Additional topics selected from: selection algorithms and adversary arguments, approximation algorithms, parallel algorithms, and randomized algorithms.

Prerequisite(s): CS 146 (with a grade of “C-” or better) or instructor consent.
Grading: Letter Graded

Class Schedule | Syllabus Information | University Bookstore