CS 527 - Design and Analysis of Algorit

Description
Techniques of disigning and analyzing algorithms. Divide-and -conquer methods, greedy algorithms, dynamic programming, backtracking, branch-and-bound techniques, Cook's Theorem, NP-hard and NP-complete problems, and heuristics. Pre-requisite: CS 321, MA 304
Credits
3
Recent Professors
Open Seat Checker
Schedule Planner
Recent Semesters
Spring 2019, Spring 2018
Offered
M
Avg. Class Size
30
Avg. Sections
1