Description Among the topics covered are: review of basic data structures and their implementations; graphs, both directed and undirected; analysis of algorithms; sorting, searching, and merging, both internal and external methods; memory management algorithms; mathematical algorithms; and, as time allows, advanced topics such as NP-complete problems.
Prerequisites A grade of C or better in CS 203 or 303, CS 202 or 302, and MATH 132.
Co-requisites Concurrent enrollment in CS 458L is required.
Note Open to graduate students. Graduate students are required to do additional work of a research nature.