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 222 and either Mathematics 201 or Mathematics 251.
1 unit — Jackson
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 2023 | Block 2 | Data Structures and Algorithms | Cory B Scott | Tutt Science Building 229 | 25 / 13 | 04/25/2024 |
| Spring 2024 | Block 7 | Data Structures and Algorithms | Cory B Scott | Tutt Science Building 223 | 25 / -2 | 04/25/2024 |
| Fall 2024 | Block 2 | Data Structures and Algorithms | Blake Jackson | TBA | 25 / 25 | 04/25/2024 |
| Spring 2025 | Block 8 | Data Structures and Algorithms | Blake Jackson | TBA | 25 / 25 | 04/25/2024 |
Report an issue -
Last updated: 04/25/2024