THEORY OF ALGORITHMS
2014 Spring Term
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)
- 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/21 - 05/20 (1)||W 6:15 PM - 8:45 PM||