Q&A section for all courses. Add courses and comments anonymously.

University of Waterloo

Waterloo, Ontario

3 votes

CS 341


The study of efficient algorithms and effective algorithm design techniques. Program design with emphasis on pragmatic and mathematical aspects of program efficiency. Topics include divide and conquer algorithms, recurrences, greedy algorithms, dynamic programming, graph search and backtrack, problems without algorithms, NP-completeness and its implications.

Assignments, midterm, final.

Added by Anonymous on 2005-01-21 01:20:00

Log in with Facebook to add a comment
anon_red - 2011-05-02 00:10:46
Depends on the prof. Winter 2011 had assignments worth 50% of your final grade. Midterm and final were fairly simple questions.

Log in with Facebook to participate in the Q&A.