CIS 405: Algorithm Analysis & Design

CIS Department University of Michigan-Dearborn

Course Description

This course investigates how to design efficient algorithms. Topics include asymptotic analysis, amortized analysis, divide-and-conquer, dynamic programming, greedy algorithms, branch and bound, backtracking, lower bounds, NP-completeness and approximation algorithms.

Reviews

Sign in to Review Login to Review

No reviews yet. Be the first to share your experience!

Sign in with Google Login to Review