This Learning Exam covers topics that would normally be taught in an analysis of algorithms course. In mathematics and computer science, an algorithm usually means a small procedure that solves a recurrent problem. To be an algorithm, a set of rules must be unambiguous, receive a bounded input and have a clear stopping point. This learning exam addresses the use of algorithms in computer science.
This Learning Exam is loosely based on the book Algorithm Design, 1st Edition by Jon Kleinberg and Eva Tardos, published in 2005.