CSCE 51803 — Advanced Data Structures
This course continues the study of data structures, algorithmic analysis for these data structures, and their efficient implementation to support standard library in programming languages. Topics include: AVL trees, Red-Black trees, Splay trees, Optimal Binary Search trees, 2-3 tree, 2-3-4 tree, B-trees, Segment trees, Leftist Heaps, Binomial Heaps, Fibonacci Heap, Disjoint Set, Hashing, and big integer with hundreds to thousands of digits. Graduate degree credit will not be given for both CSCE 42603 and CSCE 51803 . Prerequisite: CSCE 31903 or Computer Science Computer Engineering(CSCE) graduate standing. (Typically offered: Irregular)
Prerequisites: CSCE 31903