CST 370
Design and Analysis of Algorithms
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.
Final project
This course is scheduled for Fall 2027, Term A. The final project will be added here once the course is complete.