Computer Science Program
Course Description

CS 225
Theory of Algorithms
Spring

An introduction to general algorithmic techniques including divide-and-conquer, dynamic programming, and greedy algorithms. Construction and analysis of some important classes of algorithms such as graph algorithms and string algorithms. An introduction to the complexity classes P, NP, and NP-complete (tractable versus intractable problems). If time allows, special topics, such as approximate algorithms, parallel algorithms, computability, and undecidability, may be included.

Course Credit:
4

Instructor(s):
Susan Wang

Prerequisite:
MATH 006 and CS 124

Note(s):
Concurrent workshop required.
Open to graduate students only.

  ICS Program Brochure

About the Program

Requirements

ยป Course List

Course Schedule

Graduate Catalog

Academic Calendar

Library

ICS Thesis Guidelines

Summer Internships

Talks and Workshops

Tours

Contact Information
P: 510.430.3309
E: grad-admission@mills.edu

If you have a specific question for a faculty member, please contact ics@mills.edu or call 510.430.2226.


Last Updated: 8/25/17