Semester Hours:3Periodically
Brief overview of algorithm design and analysis; linear algebra; linear programming; the simplex algorithm; dynamic programming; greedy algorithms; amortized analysis; algorithms for matching; network flow; packing and scheduling; and branch and bound algorithms.