Credits:(3) The study and implementation of computer algorithms that utilize data structures are examined in detail. Such structures include linked lists, stacks, queues, trees, heaps and graphs. Searching and sorting algorithms are discussed. Students learn about recursion and running-time analysis. Prerequisite(s): CMSCI 125 or permission of the instructor. Recommended: MATH 228 Discrete Mathematics (3) . (Fall)