CS-5114: Theory of Algorithms
Description: Methods for constructing and analyzing algorithms. Measures of computational complexity, determination of efficient algorithms for a variety of problems such as searching, sorting and pattern matching. Geometric algorithms, mathematical algorithms, and theory of NP-completeness. Pre: Graduate standing in the CSA program.
Pathways: N/A
Course Hours: 3 credits
Corequisites: N/A
Crosslist: N/A
Repeatability: N/A
Sections Taught: 11
Average GPA: 3.53 (rounds to A-)
Strict A Rate (No A-) : 34.51%
Average Withdrawal Rate: 0.50%
| Bo Ji | 2024 | 50.1% | 48.4% | 0.8% | 0.0% | 0.0% | 0.8% | 3.47 | 3 |
| Jin Hee Cho | 2024 | 49.3% | 35.5% | 15.3% | 0.0% | 0.0% | 0.0% | 3.36 | 3 |
| Sharath Raghvendra | 2023 | 65.3% | 32.5% | 1.1% | 0.0% | 0.0% | 1.1% | 3.62 | 3 |
| Lenwood S Heath | 2022 | 84.4% | 13.3% | 2.4% | 0.0% | 0.0% | 0.0% | 3.73 | 2 |