C S 357H - Algorithms: Honors

Institution:

The University of Texas at Austin

Subject:

Description:

Algorithmic paradigms: divide and conquer, greedy algorithms, dynamic programming, branch and bound. NP-completeness and topics selected from the following: cryptography algorithms, approximation algorithms, randomized algorithms, parallel algorithms, lower bounds. Three lecture hours a week for one semester. Computer Science 357 and 357H may not both be counted. Prerequisite: The following coursework with a grade of at least C- in each course: Computer Science 310, 310H, 429, or 429H; 336 or 336H; 337 or 337H; Mathematics 408D, 408M, or 427L; and consent of the honors director.

Credits:

3.00

Credit Hours:

Prerequisites:

Corequisites:

Exclusions:

Level:

Instructional Type:

Lecture

Notes:

Additional Information:

Historical Version(s):

Institution Website:

www.utexas.edu

Phone Number:

(512) 471-3434

Regional Accreditation:

Southern Association of Colleges and Schools

Calendar System:

Semester

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.