Search Results

C S 331H C S 331H. Algorithms and Complexity: Honors. 3 Hours.

An investigation of algorithmic paradigms: divide and conquer, dynamic programming, greedy algorithms, graph algorithms, randomized algorithms, undecidability; NP-completeness, approximation algorithm, sorting lower bound, selected topics from amortized analysis, network flow, and linear programming. Three lecture hours and one hour of discussion a week for one semester. Only one of the following may be counted: Computer Science 331, 331H, 378 (Topic: Algorithms and Complexity). Prerequisite: The following coursework with a grade of at least C-: Computer Science 429 or 429H; Mathematics 362K or Statistics and Data Sciences 321; and credit with a grade of at least C- or registration for: Mathematics 340L, 341, or Statistics and Data Sciences 329C.

Computer Science

Undergraduate

https://catalog.utexas.edu/undergraduate/natural-sciences/degrees-and-programs/bachelor-of-science-and-arts/computer-science/

Mathematics: Mathematics 408C or 408N and 408S Mathematics 340L or SDS 329C . Mathematics 341 may substitute for 340L . Statistics and Data Sciences 321 . Mathematics 362K may substitute for this requirement. Primary science: Theory: Computer Science 311 or 311H , and 331 or 331H Programming: Computer Science 312 and 314 or 314H Systems: Computer Science 429 or 429H , and 439 or 439H Twelve additional semester hours of approved upper-division computer science Secondary science: Six semester hours of majors-level coursework chosen from a single field of study: biology, chemistry, or physics. It is recommended that students select courses that will also fulfill the Natural Science and Technology Part I core curriculum requirement. At least 17 hours of computer science upper-division coursework must be completed in residence.