The design, implementation, analysis, and application of a range of computer algorithms are explored. Function order of growth and amortized analysis are used in analyzing algorithms. A review and extension of data structure topics including trees and graphs are covered. Algorithm design strategies such as divide-and- conquer, the greedy method, and dynamic programming are studied.

Prerequisite(s): ENCE 316
Grading Basis: Graded Repeatable: No Typical Periods Offered: Spring

Add to Portfolio (opens a new window)