[ Wesleyan Home Page ] [ WesMaps Home Page ] [ WesMaps Archive ] [ Course Search ] [ Course Search by CID ]
Academic Year 2005/2006

Algorithms and Complexity
COMP 312 SP

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

EXAMINATIONS AND ASSIGNMENTS

COURSE FORMAT: Lecture

REGISTRATION INFORMATION

Level: UGRD    Credit: 1    Gen Ed Area Dept: NONE    Grading Mode: Graded   

Prerequisites: COMP212 AND MATH228

SECTION 01

Instructor(s): Rice,Michael D.   

Times: .M.W... 01:10PM-02:30PM;     Location: SCIE137;

Reserved Seats:    (Total Limit: 25)

SR. major: 0   Jr. major: 0

SR. non-major: 10   Jr. non-major: 10   SO: 5   FR: 0

Special Attributes:

Curricular Renewal:    Quantitative Reasoning

Last Updated on MAR-30-2006

Copyright Wesleyan University, Middletown, Connecticut, 06459