CS4122 — Adv Algs & Data Structures
Survey of advanced data structures and algorithms such as heaps and heapsort, quicksort, red-black trees, B-tress, hash tables, graph algorithms, divide and conquer algorithms, dynamic programming, and greedy algorithms. Methods for proving correctness and asymptotic analysis. pre-req: (CS 1632 or 2511), (CS 2531 or MATH 3355) or instructor consent; a grade of C- or better in all prerequisite courses; no grad credit