|
|
|
Mar 11, 2025
|
|
2011-2013 Catalog (without addenda) [ARCHIVED CATALOG]
|
CS 6043 Design and Analysis of Algorithms II3 Credits
This course covers techniques in advanced design and analysis. Topics: Amortized analysis of algorithms. Advanced data structures: binomial heaps, Fibonacci heaps, data structures for disjoint sets, analysis of union by rank with path compression. Graph algorithms: elementary graph algorithms, maximum flow, matching algorithms. Randomized algorithms. Theory of NPcompleteness and approach to finding (approximate) solutions to NPcomplete problems. Selected additional topics that may vary.
Prerequisite(s): Graduate status and CS 6033 .
Weekly Lecture Hours: 3 | Weekly Lab Hours: 0 | Weekly Recitation Hours: 0
|
|
|
