Description:
Advanced design and analysis techniques: 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 NP-complete problems. Selected additional topics that may vary.
Credits: 3:0:0:3
Pre-Requisite: CS 6033
Co-Requisite: none
Notes: none
Recent Comments