3.00 Credits
This course covers the implementation and use of data structures and algorithms. Topics will include binary trees, priority queues, balanced trees, hash tables, graphs, recursion, binary tree searching, sorting, hashing, and graph searching. This is a programming intensive course.
Prerequisite:
CMSC130 OR CPSC130 AND CMSC131 OR CPSC131 AND CMSC230 OR CPSC230