|
Sep 12, 2024
|
|
|
|
CS 4440 - Theory of Algorithms3 unit(s) A systematic study of the design and efficiency analysis of algorithms. Coverage of fundamental techniques of algorithms such as greedy, divide-and-conquer, dynamic programming, graph techniques, probabilistic, and parallel. An introduction to computational complexity theory: problem reduction, NP-complete problems, and other complexity classes.
Prerequisites: CS 3100 and MATH 2300.
Schedule of Classes | University Bookstore
Add to Favorites (opens a new window)
|
|