Course description
Students learn important data structures in computer science and acquire fundamental algorithm design techniques to get the efficient solutions to several computing problems from various disciplines. Topics include the analysis of algorithm efficiency, hash, heap, graph, tree, sorting and searching, brute force, divide-and-conquer, decrease-and-conquer, transform-and-conquer, dynamic programming, and greedy programming.
- Prerequisite(s)/Corequisite(s): CST 238 and MATH 170 with a C- or better
- Typically Offered: Fall, Spring
- Units: 4
Final project
Project work will be added here as the course progresses.
Project overview
Add the project purpose, your contribution, and the tools used.
Project artifacts
Add screenshots, a repository link, a demo, or a report here.
What I learned
Add a short reflection on the skills and ideas developed in this course.