Course Detail
Units:
3.0
Course Components:
Lecture
Enrollment Information
Enrollment Requirement:
Prerequisites: CS 4150.
Description
Meets with CS 5150. Design and analysis of algorithms. Topics include Greedy algorithms, dynamic programming, divide and conquer, Asymptomatic analysis and recurrence relations, Graph algorithms and network flows, Computational complexity and intractability, NP-hardness and beyond, and Approximation algorithms.