Data Structures and Algorithms II

CS 362 (3)

A continuation of 361L with an emphasis on design of algorithms. Topics include: amortized analysis and self-adjusting data structures for trees and priority queues; union-find; minimum spanning tree, shortest path and other graph algorithms; elementary computational geometry; greedy and divide-and-conquer paradigms.

Prerequisite: 361L with a grade of "C" or better.