CSC 325 - Algorithms and Advanced Data Structures

Credit Hours: 3
A study of algorithms and advanced data structures including graphs, heaps, hashing, self-adjusting data structures, set representations, greedy algorithms, dynamic programming and introduction to NP-complete problems. The course emphasizes on the study of efficiency and algorithm analysis. May be taught concurrently with CSC 611. Cannot receive credit for both CSC 325 and CSC 611.

Prerequisite: C grade or better in CSC 232; and MTH 314 or MTH 315.
Lecture contact hours: 3

Typically offered: Fall, Spring