[WesMaps 98/99 Home Page]
[Course Search]
[Course Search by CID]
COMP312
Algorithms and Complexity
COMP312 SP
| Section | Class Size | *Available | Times | POI | Prereq |
|---|
| 1 | 25 | 3 | Times: M.W.F.. 11:00AM-11:50AM; | No | Yes |
*The number of spaces listed as available is based on class seats open for
the Blue Add phase of registration. Some seats may be taken in previous
phases while others may be held out for subsequent phases of registration.
(Last Updated on Tue Aug 10 05:00:21 EDT 1999
)
The course will cover the design and analysis of efficient
algorithms. Basic topics will include greedy algorithms,
divide-and-conquer algorithms, dynamic programming, and
graph algorithms. Some advanced topics in algorithms may be
selected from other areas of computer science.
MAJOR READINGS
To be announced
EXAMINATIONS AND ASSIGNMENTS
To be announced.
ADDITIONAL REQUIREMENTS and/or COMMENTS
COURSE FORMAT: Lecture
REGISTRATION INFORMATION
Level: UG Credit: 1.00
Prerequisites:
COMP212 and MATH228
- Section 01
- Rice, M
- Times: M.W.F.. 11:00AM-11:50AM;
- Grading Mode: A/F
- Registration Preference (1 high to 6 low, 0=Excluded) Sr: 1, Jr: 1, So: 1, Fr: 1
- No Major Preference Given
Last Updated on MAR-22-1999
Contact wesmaps@wesleyan.edu to
submit comments or suggestions.
Copyright Wesleyan University, Middletown, Connecticut, 06459