Course Detail
Units:
3.0
Course Components:
Lecture
Enrollment Information
Enrollment Requirement:
Prerequisites: 'C-' or better in CS 4150 AND (Full Major status in Computer Science OR Computer Engineering)
Description
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.