Search Results

CSĀ 383 Algorithm Design and Analysis

Faculty: Mathematical Sciences Faculty
Content: Introduction to the design and analysis of algorithms. Balanced binary search trees; bit vectors; hash tables; heaps; dynamic programming; algorithms including incremental, divide and conquer, greedy, graph.
Prerequisites: CS 172. MATH 132 or CS 230.
Usually offered: Annually, fall semester.
Semester credits: 4.

Mathematical Sciences

...the following: CS 171 Computer Science I CS 172 Computer Science II CS 383 Algorithm...