- Welcome to CSC 373!
- This class will have no tutorials, lectures are three times per week
- We have a google group -- you should join it here.
Overview:
This course will cover some topics in the design and analysis
of algorithms. The topics covered will include Divide & Conquer algorithms,
Greedy algorithms, Dynamic Programming, Network Flow, Linear Programming, as well as
approximation and heuristic algorithms. While the material covered will be of a
rather mathematical nature, we will stress the practical constraints that go into
designing algorithms and try to make the course as applied as possible.
Prerequisites:
CSC 263/265
Grading:
The graded materials for this class will consist of 3 homework problems and 1 programming project, each worth 9% of the grade (36% total),
two term tests worth 15% each, and a final worth 34%.