Description:
This course emphasizes the understanding of data structures and algorithms from an analytical perspective rather than 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.
Having successfully completed this course, the student will be able to:
Prerequisites: A grade of C or better required in CS3114. Also MATH 3134 or MATH 3034.
Recent Offerings: