Algorithm Design and Analysis I
Analysis of the best, average and worst-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.
May 30, 2007: CP312 Prerequisite change per Senate; effective Sept 1, 2007.