CS 332 - Design & Analysis of Algorithm

Description
(3-0-3), fall. Design and scientific and mathematical study of algorithms. Analytic and experimental performance determination. Includes searching and sorting, trees, graphs, asymptotic (e.g., big-O) performance bounds, and the halting problem. Prerequisites: CS 130 and MATH 227 with a grade of C or better.
Recent Professors
Open Seat Checker
Schedule Planner
Recent Semesters
Fall 2018, Fall 2017
Offered
TuTh, MWF
Avg. Class Size
27
Avg. Sections
1