[ Wesleyan Home Page ] [ WesMaps Home Page ] [ Course Search ] [ Course Search by CID ]

Algorithms and Complexity
COMP312 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): Dougherty,Daniel J.   

Times: .M.W.F. 11:00AM-11:50AM;     Location: SCIE137

Reserved Seats:    (Total Limit: 20)

SR. major:    Jr. major:

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

Special Attributes:

Curricular Renewal:    Quantitative Reasoning

Last Updated on MAR-24-2000

Copyright Wesleyan University, Middletown, Connecticut, 06459