Course Description

Computer Science 340a/b Analysis of Algorithms I

Upper and lower time and space bounds; levels of intractability; graph algorithms; greedy algorithms; dynamic algorithms; exhaustive search techniques; parallel algorithms.

Prerequisites: Either (Computer Science 210a/b and 211a/b, or the former Computer Science 201) or (Computer Science 210a/b, SE 203a/b, and 250a/b); Mathematics 223b, or SE 251a/b, or registration in the third or fourth year of an honors program that combines Computer Science and another mathematical science, or registration in the fourth year of the BESc program in Computer Engineering.

3 lecture hours, half course.

Academic Calendar