CS 411 - Algorithms and Data Structures

4 credits
Presents Non-Linear Data Structures (Trees: 2-3-4 and 2-3 Trees, B, B*, B+), Union-And-Find, Heap and Heap Sort, Hash Tables, Graph and its Algorithms (Structure and Traversal and Searching, Minimum Spanning Tree, Shortest Path, etc.). Prerequisite(s): CS 258 and MTH 252 with a C- or better or appropriate SOU placement level and either CS 250 or MTH 311. Junior standing or above.
Grade mode designated on a CRN basis each term. Students should consult current term schedule.