Description
Implementations of advanced tree structures, priority queues, heaps, directed and undirected graphs. Advanced searching and sorting (radix sort, heapsort, mergesort, and quicksort). Design and analysis of data structures and algorithms. Divide-and-conquer, greedy, and dynamic programming algorithm design techniques.
Prerequisite: MATH 31, MATH 42, CS 49J (or equivalent knowledge of Java), and CS 46B (with a grade of "C-" or better in each); or instructor consent.
Grading
Normal Grade Rules
Units
3
Page last generated: 10/30/2009 15:36:53
print
mail