3 credits(Hrs: 3 Lec.) Commonly used structures found in computing and the algorithms which manipulate them are studied. Design and analysis of algorithms are emphasized. Topics include stacks, queues, general lists, trees, hashing, searching, and sorting.
Prerequisite(s):CSCI 136 and M 171 Course generally offered 1st semester.