---

[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

ADDITIONAL REQUIREMENTS and/or COMMENTS

COURSE FORMAT: Lecture

REGISTRATION INFORMATION

Level: UG Credit: 1.00

Prerequisites: COMP212 and MATH228

Last Updated on MAR-03-1998