CS 5040: Data Structures and Algorithms

3 Credit Hours
Prerequisite: CS 5000
The course covers data structures and algorithms including runtime analysis and big-oh notation. A modern language will be used. Topics include dynamically allocating memory, pointer declaration and use, and the implementation of data structures such as lists, stacks, queues, binary search trees, and graphs. Analysis techniques are provided, such as the growth of functions, advanced sorting techniques, elementary graph algorithms, and minimum spanning trees. Programming projects are included.