CSP 146 Data Structures
This course continues the development of a disciplined approach to program design with an emphasis on the design an implementation of data structures. Data abstraction is demonstrated using examples such as linked list, stacks, queues, binary trees, and graphs. Recursion, techniques of program verification, and algorithm analysis are introduced. Classic sorting and searching algorithms are discussed and analyzed.
- Prerequisite: CSP 145 or permission of the Discipline Coordinator
- Hours: 4
- Credits: 4