4Credit HoursDesign, analysis, and implementation of fundamental data structures and algorithms including lists, stacks, queues, hash tables, binary search trees and heaps.
Contact Hour Distribution:3 hours lecture and 1 lab. (RE) Prerequisite(s):COSC 102 with a grade of C or better.