Techniques for analyzing the time and space requirements of algorithms. Application of these techniques to sorting, searching, pattern-matching, graph problems, and other selected problems. Brief introduction to the intractable (NP-hard) problems.

Usually Offered:	Fall and Spring
Credit:	3 hours (class)
Prerequisite:	MA 261 and CS 251
University Catalog:	CS 381
Schedule:	Spring 2004 Instructor: Vernon Rego
Syllabi:	Canonical