THEORY OF ALGORITHMS
2017 Fall 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: COMPSCI 223 AND (COMPSCI 215 OR MATH 280)
- 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|
|09/06 - 12/22 (1)||MW 11:00 AM - 12:15 PM||