CS5150
Download as PDF
Advanced Algorithms
Computing
EN - J & M Price College of Eng.
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.
Minimum Credits
3
Maximum Credits
3
Repeat for Credit
No
Required Requisite(s):
004357
Semesters Typically Offered
Fall