Catalog description: Design and correctness of algorithms, including divide-and-conquer, greedy and dynamic programming methods. Complexity analyses using recurrence relations, probabilistic methods, and NP-completeness. Applications to order statistics, disjoint sets, B-trees and balanced trees, graphs, network flows, and string matching. Pre: 211 and 241, or consent.
Instructor(s): This review site is based upon materials developed by Kazuo Sugihara and Dan Suthers.
About this site: Go to the Modules page for a list of topics; click on any topic to see details.
Additional pages collect together all of the learning outcomes, readings (i.e. “passive” learning involving review of textbook sections, web pages, screencasts, etc.), and experiences (i.e. “active” learning, where you must actually demonstrate a capability).
To contribute feedback about this site, please use the Suggestion Box.