|
Jan 15, 2025
|
|
|
|
CPSC 310 - Design and Analysis of Algorithms5 credit hours Advanced data structures (e.g. sets, graphs, priority queues) and their application; algorithm analysis and design techniques, such as divide and conquer, greedy methods, branch and bound, etc. Asymptotic analysis of algorithms and introduction to computability theory. Prerequisites: a C (2.00) or better in CPSC 250 and either MATH 310 or a C (2.00) or better in CPSC 210.
Add to Portfolio (opens a new window)
|
|