This course includes programming topics such as sorting and searching, sets, recursion, and dynamic data types. Additional concepts involve data type abstraction and implementation developed through studying structures such as lists, stacks, queues, hash tables, and binary search trees. The course emphasizes the object-oriented implementation of these structures. Students learn tools for algorithm analysis and explore the use of standard libraries. The concept of tradeoffs (i.e., time vs. space, iteration vs. recursion, static vs. dynamic) recurs as a theme throughout the course. Prerequisite: CSC125. Pre- or corequisite: MATH123. Offered each semester. Not offered pass/fail.
| Distribution Area | Prerequisites | Credits |
|---|---|---|
| CSC 125; pre- or corequisite MATH123 | 1 course |