Instructor
Wiedenbeck

Algorithm design strategies, including greedy, divide-and-conquer, and dynamic programming methods.  Advanced data structures, including balanced search trees, graphs, heaps, and priority queues.  Advanced methods of searching and sorting.  Computational complexity and analysis of algorithms.  NP-complete problems.

Counts towards the Mathematics major and minor.
Counts towards the Computer Science major and minor.

Prerequisites
CSC 221 and CSC/MAT 220, or permission of instructor. 

Class Details
Course CSC 321
Section 0
CRN 20134
Time T R
Time 0950 - 1105am
Building 109 WATSON
Instructor Catherine Nemitz
Notes
Max 24
Current 0
Remaining 24
Semester Spring 2022