CS4104: Data and Algorithm Analysis

Data structures and algorithms from an analytical perspective. Theoretical analysis of algorithm efficiency. Comparing algorithms with respect to space and run-time requirements. Analytical methods for describing theoretical and practical bounds on performance. Constraints affecting problem solvability. (3H,3C)

Prerequisites: A grade of C or better required in CS 3114. Also MATH 3134 or MATH 3034.

See: course web pages.

Taught By: Adrian Sandu
Lenwood Heath
Cliff Shaffer
Sharath Raghvendra
T. M. Murali
Anil Vullikanti