Methods for the systematic construction and mathematical analysis of algorithms. Order notation, the RAM model of computation, lower bounds, and recurrence relations are covered. The algorithm design techniques include divide-and-conquer, branch and bound, and dynamic programming. Applications to combinatorial, graph, string, and geometric algorithms.
5 Credits
Year | Fall | Winter | Spring | Summer |
---|---|---|---|---|
2020-21 |
|
|
| |
2019-20 |
|
|
|
While the information on this web site is usually the most up to date, in the event of a discrepancy please contact your adviser to confirm which information is correct.