Computer & Information Science Department   Polytechnic University

ATTENTION: THIS WEB SITE HAS MOVED. The pages you are looking at are no longer being maintained. Please go to http://www.poly.edu/cis/ to visit the new site of the Department of Computer and Information Science at Polytechnic University.

CS604 Dsign Analy & Algorthm 2

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 NP-completeness and approach to finding (approximate) solutions to NP-complete problems. Selected additional topics that may vary.

Prerequisite: CS603