THEORY OF ALGORITHMS
THEORY OF ALGORITHMS
2026 Spring Term
3 Units
Computer Science 433
This course is a survey of algorithms needed for searching, sorting, pattern matching, analyzing graphs, and a variety of other problems of discrete mathematics. Analysis of algorithm efficiency and space/time tradeoffs are discussed.
Other Requirements: PREREQ: COMPSCI 223 AND (COMPSCI 215 OR MATH 280)
Class Schedule
Disclaimer
- This schedule is informational and does not guarantee availability for registration.
- Sections may be full or not open for registration. Please use WINS if you wish to register for a course.
| Section Details | Meeting Details & Topic | Instructor | Syllabus | ||
|---|---|---|---|---|---|
|
01-DIS 3736
3 Units
|
01/26 - 05/09 (1) | TuTh 12:30 PM - 1:45 PM |
Daniel Szelogowski
|
||
|
|||||
