Course Description

CP312 Algorithm Design and Analysis I 0.5

Analysis of the best, average, and worse case behaviors of algorithms. Algorithmic strategies: brute force algorithms, greedy algorithms, divide-and-conquer, branch and bound, backtracking. Fundamental computing algorithms: O(n log n) sorting, hash table, binary trees, depth- and breadth-first search of graphs.

Prerequisite: CP264.

Official electronic version updated on February 4, 2002

M. Watson, Editor Course Timetable