THEORY OF ALGORITHMS
THEORY OF ALGORITHMS
2007 Fall 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: MATH 280 AND COMPSCI 372 OR MCS 231
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 | ||
|---|---|---|---|---|---|
|
02-DIS 5089
3 Units
|
09/04 - 12/21 (1) | TuTh 8:00 AM - 9:15 AM |
Jonathan Kane
|
||
|
|||||
