[
Wesleyan Home Page
] [
WesMaps Home Page
] [
WesMaps Archive
]
[
Course Search
] [
Course Search by CID
]
| |
Crosslistings: COMP 510 |
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.
COURSE FORMAT: Lecture
Level: UGRD Credit: 1 Gen Ed Area Dept: NONE Grading Mode: Graded
Prerequisites: COMP212 AND MATH228 Links to Web Resources For This Course.
Last Updated on MAR-30-2006
Copyright Wesleyan University, Middletown, Connecticut, 06459