Fee: $2. [Prerequisite: MATH 130 or equivalent. Recommended Preparation: RDG 158 or equivalent or through the Southwestern College multiple measures placement processes.] Introduces the fundamental concepts of computational data structures and algorithms. Includes recursion, builds on object-oriented programming ideas, introduces fundamental data structures (including stacks, queues, linked-lists, heaps, priority queues, hash tables, trees, and an introduction to graphs), and the basics of algorithm analysis. Examines implementation and analysis of sorting and searching algorithms. [D; CSU; UC; C-ID COMP 132]
Class Central is learner-supported. When you buy through links on our site, we may earn an affiliate commission.
