CS 5040:Data Structures & Algorithms

3 Class Hours 0 Laboratory Hours 3 Credit Hours
An intense coverage of data structures and algorithmic techniques is provided 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, recurrence equations, advanced sorting techniques, elementary graph algorithms, minimum spanning trees, greedy algorithms. Programming projects are included.