Description:

CS4104: This course emphasizes the understanding of data structures and algorithms from an analytical perspective rather than from an implementation standpoint. The concepts developed allow discussion of the efficiency of an algorithm and the comparison of two or more algorithms with respect to space and run-time requirements. Analytical methods are used to describe theoretical bounds as well as practical ones. In general, this course addresses the constraints that affect problem solvability.

Prerequisites: A grade of C or better required in CS2604 or CS2606. Also MATH 3134 or MATH 3034. (3H,3C)

See: course web pages.

Taught By: Adrian Sandu
Eunice Santos
Lenwood Heath
Clifford Shaffer
Vicky Choi
Anil Vullikanti