THEORY OF ALGORITHMS
THEORY OF ALGORITHMS
2013 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: (MCS 231 OR COMPSCI 223) OR (MATH 280 AND EITHER COMPSCI 172 OR COMPSCI 174)
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 1248
3 Units
|
09/03 - 12/23 (1) | TuTh 2:15 PM - 3:30 PM |
Athula Gunawardena
|
||
|
|||||
