3 Credits 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 C or better in CS 202, CS 303, and MATH 132; or A- or better in CS 500.