COMP 2503

(3 credits ) 3 hours lecture, 1 hour tutorial Data structures important to computing such as basic linear structures, trees, heaps and hash tables will be studied. Additionally searching and sorting methods will be cover. The representation, uses and algorithms for manipulating these data structures will be examined. The emphasis is on using these structures to solve problems.