Course Detail
Units:
3.0
Course Components:
Lecture
Enrollment Information
Enrollment Requirement:
Prerequisite: CS 4150.
Description
Meets with CS 6150. 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.