|
Class number:
2746
|
|
Title: Analysis of Algorithms |
|
Department: Computer Science |
|
Career: Undergraduate |
|
Component: Lecture |
|
Session: Regular |
|
Instructor's Permission Required: No |
|
Grading Basis: Regular |
|
Units: 1.00 |
| Enrollment limited to 24 |
|
Current enrollment: 25 |
|
Available seats: 0 |
|
Start date: Tuesday, January 20, 2026 |
|
End date: Friday, May 8, 2026 |
|
Mode of Instruction: In Person |
|
Schedule: MW: 8:30AM-9:45AM, LSC - 137 |
|
|
Instructor(s): Miyazaki, Takunari |
|
Prerequisite(s): Prerequisite: C- or better in Computer Science 215L and Computer Science 203 (or concurrent enrollment in 203). |
|
Distribution Requirement: Meets Numerical & Symbolic Reasoning Requirement |
Course Description:
A continuation of the study begun in Computer Science 215 of the complexity of algorithms used in computing. The notions of P, NP, and NP-complete problems and of non-computability will be covered. The algorithms studied will include examples involving sorting, graphs, geometry, and combinatorics. Theoretical aspects of algorithms will be studied as well as practical aspects useful in writing programs. |
|
Course Syllabus:
view syllabus
|