CS-382 Data Structures & Algprithms II
This course covers advanced data structures, design and analysis of algorithms, mathematical analysis of recursive and nonrecursive algorithms, growth of functions, brute-force algorithms, divide-and-conquer algorithms, greedy algorithm, and dynamic programming. Topics include but not limited to: Red-Black trees, B-trees, data structures for disjoint sets, elementary and advanced graph algorithms, hashing, backtracking, NP and NP complete problems, approximation for NP algorithms. Prerequisites: CS 381 Data structures and Algorithms
Prerequisite
Take CS-381;