Computer Science 161 - Design and Analysis of Algorithms

Institution:

University of California-Irvine

Subject:

Description:

Time and space complexity of algorithms. Models of computation, techniques for efficient algorithm design, effect of data structure choice on efficiency of an algorithm. Fast algorithms for problems such as sorting, set manipulation, graph problems, matrix multiplication, Fourier transforms, and pattern matching. NP-complete problems. Prerequisites: ICS 23/CSE23 and ICS 51 or CSE31/EECS31 with grades of C or better; ICS 6D/Mathematics 6D; ICS 6B/Mathematics 6B; Mathematics 6G or 3A; Mathematics 2B; satisfactory completion of the lower division writing requirement. Same as CSE161.

Credits:

4.00

Credit Hours:

Prerequisites:

Corequisites:

Exclusions:

Level:

Instructional Type:

Lecture

Notes:

Additional Information:

Historical Version(s):

Institution Website:

www.uci.edu/

Phone Number:

(949) 824-5011

Regional Accreditation:

Western Association of Schools and Colleges

Calendar System:

Quarter

The Course Profile information is provided and updated by third parties including the respective institutions. While the institutions are able to update their information at any time, the information is not independently validated, and no party associated with this website can accept responsibility for its accuracy.