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


Algorithms and Complexity
COMP 312 SP

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.

MAJOR READINGS

To be announced.

EXAMINATIONS AND ASSIGNMENTS

To be announced.

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,Daniel   
Times: .M.W... 02:40PM-04:00PM;     Location: SCIE141
Reserved Seats:    (Total Limit: UNL)
SR. major:    Jr. major:
SR. non-major:    Jr. non-major:    SO:    FR:

Special Attributes:
Curricular Renewal:    Quantitative Reasoning
Links to Web Resources For This Course.

Last Updated on MAR-19-2002


Contact wesmaps@wesleyan.edu to submit comments or suggestions. Please include a url, course title, faculty name or other page reference in your email

Copyright Wesleyan University, Middletown, Connecticut, 06459