Log in with Facebook to participate in the Q&A.
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