CS 146

Data Structures and Algorithms

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 030, MATH 042, CS 049J (or equivalent knowledge of Java), and CS 046B (with a grade of "C-" or better in each); or instructor consent.

Grading
Normal Grade Rules

Units
3