CS 174 - Analysis of Algorithms

Upper Division

Prerequisites
MA/CS 102

This course delves deeper into the design and analysis of algorithms. Graph algorithms, key algorithmic techniques (such as dynamic programming, greedy approaches, dividing to sub-problems, randomization) and advanced data structures are studied. Advanced topics in this course may include approximation algorithms, P vs NP, and String searching.

Term Offered
Consult the department website for the schedule of offerings.

Course credits: 1