CS5150

Design and analysis of algorithms. Greedy algorithms, dynamic programming, divide and conquer. Asymptotic analysis and recurrence relations. Graph algorithms and network flows. Computational complexity and intractability. NP-hardness and beyond. Approximation algorithms.

Prerequisites: 'C-' or better in CS 4150 AND Foundational Courses complete ((‘C-‘ or better in (CS 1400 AND CS 1410) OR CS 1420) AND (‘B-‘ or better in CS 2420) AND (‘C’ or better in MATH 1210)) AND Major or Minor in Kahlert School of Computing or ECE

Fall