Algorithm Analysis

3.00 credits · Undergraduate

Prereq: COMP 2711; COMP/MATH 2211; or permission of the Department This course applies analysis and design techniques to non-numeric algorithms that act on data structures. The design of efficient algorithms leads to in-depth investigations of computational complexity such as NP-hard problems. (Format: Lecture 3 Hours)