CIS-325 Analysis of Algorithms

This course provides an introduction to analyzing the time and space requirements of algorithms. Topics include the design techniques for efficient algorithms; induction, recursion, and divide-and-conquer; greedy algorithms; graph algorithms; network problems; and an introduction to intractable (NP-hard) problems. Prerequisite: CIS-221 or CIS-222 and Co-requisite: CIS-221 and CIS-222. One of these may be taken concurrently as long as the other is already completed.

Credits

3