Description:
Algorithm analysis: recursion, complexity; combinatorics: recurrence relations, dynamic systems, counting techniques; graph theory: Eulerian and Hamiltonian graphs, algorithms and heuristics, planar graphs, trees, applications.

Prerequisites:
MATH 300 or con reg.

3 cr.

Facebook this Page (opens a new window)

Tweet this Page (opens a new window)

Add to Portfolio (opens a new window)