CP307 - Data Structures and Algorithms
Study of fundamental data structure and algorithm concepts, and analysis techniques thereof. Examination of hash function and tree based data structures. Analysis techniques including asymptotic analysis and proof of algorithm correctness and performance. Exploration of reduction and algorithmic categories (e.g., NP- completeness). 1 unit.
Prerequisite: Computer Science 116 and Computer Science 222 and one of (Mathematics 201 or MA251).
1 unit — Scott
Previously Featured Offering
Organizing data efficiently and developing effective algorithms are vital topics in computer science. In CP307, students will implement their own data structures and then use them to write and carefully analyze a variety of algorithms including finding driving directions, navigating labyrinths, and intelligently editing images.
Offerings
| Term | Block | Title | Instructor | Location | Student Limit/Available | Updated |
|---|---|---|---|---|---|---|
| Fall 2024 | Block 2 | Data Structures and Algorithms | Blake Jackson | Olin Hall 172 | 25 / 20 | 05/20/2025 |
| Spring 2025 | Block 8 | Data Structures and Algorithms | Blake Jackson | Tutt Science Building 223 | 25 / 11 | 05/20/2025 |
| Fall 2025 | Block 2 | Data Structures and Algorithms | Cory B Scott | TBA | 25 / 16 | 05/20/2025 |
| Spring 2026 | Block 8 | Data Structures and Algorithms | Cory B Scott | TBA | 25 / 25 | 05/20/2025 |
Report an issue -
Last updated: 05/20/2025