CPTR 454 Design and Analysis of Algorithms

Design and analysis of efficient algorithms for sorting, searching, and other applications.  Students will design algorithms using techniques such as divide-and-conquer, greedy algorithms, and dynamic programming; and give proofs of correctness for their algorithms.  Students will also analyze an algorithm's time and space complexity and give examples of NP-complete and NP-hard problems.  Prerequisites: CPTR 241, MATH 250.

Credits

4

Distribution

Computer Science