SW4596 Algorithm Design and Analysis in Software Engineering

This course covers algorithm design and analysis in software engineering. Specific topics include advanced data structures (such as Binomial heaps and Fibonacci Heaps), graph algorithms (such as minimum spanning trees, maximum flow, all-pairs shortest paths, and single-source shortest paths), and advanced design and analysis techniques (such as dynamic programming, greedy algorithms, linear programming, and amortized analysis).

Prerequisite

SW4500 or consent of instructor

Lecture Hours

3

Lab Hours

1

Quarter Offered

  • As Required