Log in with Facebook to participate in the Q&A.
Design and analysis of data structures and algorithms. Comparison of algorithms on data structures, including operations on sets (balanced search trees, hashing), sorting and priority queues, and graphs. Algorithmic paradigms including greedy algorithms, divide and conquer, dynamic programming, graph exploration, backtracking, and branch and bound. Mathematical analysis of space and time complexity. Overview of NP-completeness.
Prof: Ladan Tahvildari. BRUTAL exams! Too much material. Take CS 240 + 341 separately instead.
Added by Anonymous on 2005-01-21 01:20:00