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 both CS 202 and CS 303, or consent of instructor.
Note Open to graduate students. Graduate students are required to do additional work of a research nature.