- Welcome to ECE 358!
- No tutorial first week (January 10)
- We have a google group -- you should join it here.
- 01/09: The key dates and instructor office hours are now posted to the newsgroup and website
- 01/16: There's a change in the grading policy; the final is now 40% and each HW is 6% (24% total for 3 HWs and 1 Programming Project).
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
the concept of NP-completeness/hardness and
approximation and heuristic algorithms used to solve NP-hard problems. 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.
Grading:
The graded materials for this class will consist of 3 homework problems and 1 programming project, each worth 8% of the grade (32% total), 6 quizzes worth 2% each with the lowest dropped (10% total)
two term tests worth 13% each, and a final worth 32%.