CS 146 - Data Structures and Algorithms

3 units
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(s): MATH 30, MATH 42, CS 49J (or equivalent knowledge of Java), and CS 46B (with a grade of “C-” or better in each); Computer Science, Applied and Computational Math, Forensic Science: Digital Evidence, or Software Engineering Majors only; or instructor consent.
Grading: Graded

Class Schedule | Syllabus Information | University Bookstore