Design and Analysis of Computer Algorithms

Undergraduate

The intent of this course is to introduce the fundamental techniques in the design and analysis of computer algorithms. Topics include asymptotic bounds, advanced data structures, searching, sorting, order statistics, oracle arguments, divide-and-conquer, greedy algorithms, dynamic programming, graph algorithms, NP completeness, and approximation algorithms. (Prerequisite: COMP-2310 and COMP- 2540) (Restricted to students in any Honours Computer Science program or consent of instructor.) (3 lecture hours a week.) (May be offered as a cross-career course with COMP-8540).