| Fall Term 2020 Data Structures and Algorithm Analysis - 5051 - CMSC 510 |
||||||||||||||||||||||||||||||||||||||||||||||||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
|
Prerequisites/Notes: CMSC 270, and MATH 220 or MATH 230 Catalog Description : Advanced data structures and the time and space efficiency of the algorithms that manipulate such structures. Topics include proof of correctness for algorithms, recursion, dynamic programming, optimized tree structures, union-find problems, graphs, path-finding algorithms, and string search algorithms. PREREQUISITES: C- or better in CMSC 270, and MATH 220 or MATH 230 Attributes: GER Quantitative Analysis, 400-599 Advanced Course
|
||||||||||||||||||||||||||||||||||||||||||||||||||||||||
