Find a university to explore its courses and reviews.
Data abstraction and algorithm complexity including Big O notation, NP problems, and design strategies such as divide-and-conquer and dynamic programming.
No one has reviewed this course yet. Share your experience and help future students know what to expect.
Takes about 2 minutes. Every review is anonymous — no account needed.