COMP312

[Wesleyan Home Page] [Wesmaps Home Page] [Availability Statistics Search] [Course Description Search] [Dept. Search]

COMP312

Algorithms and Complexity COMP312 SP

Spring 97 Availability (Last Updated on Thu Apr 17 05:00:17 EDT 1997 )

Section  Limit  Enrollment  Available
  01       999      0         Open

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.

ADDITIONAL REQUIREMENTS and/or COMMENTS

COURSE FORMAT: Lecture

REGISTRATION INFORMATION

Level: UG Credit: 1.00

Prerequisites: COMP212 and MATH228

Section 01: Subrahmanyam, R; Times: .T.T... 10:00AM;; Grading Mode: A/F; Registration Preference (1 high to 6 low, 0=Excluded) Sr: 1, Jr: 1, So: 1, Fr: 1; No Major Preference Given

Last Updated on MAR-10-1997

Contact wesmaps@wesleyan.edu to submit comments or suggestions.