[ Wesleyan Home Page ] [ WesMaps Home Page ] [ WesMaps Archive ] [ Course Search ] [ Course Search by CID ]
Academic Year 2000/2001

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

Unless preregistered students attend the first class meeting or communicate directly with the instructor prior to the first class, they will be dropped from the class list. NOTE: Students must still submit a completed Drop/Add form to the Registrar's Office.

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): Krizanc,David D.   

Instructor's Course Page

Times: ..T.T.. 01:10PM-02:30PM;     Location: SCIE618

Reserved Seats:    (Total Limit: UNL)

SR. major:    Jr. major:

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

Special Attributes:

Curricular Renewal:    Quantitative Reasoning

Last Updated on MAR-26-2001

Copyright Wesleyan University, Middletown, Connecticut, 06459