CS 5600 Data Structures and Algorithms

This course covers the fundamentals of algorithms and data structures. Starting with the role of algorithms in computing, the content covers insertion sort, algorithm analysis, and design principles. Explore running time characterization and divide-and-conquer strategies. The course progresses to sorting, including heapsort, quicksort, and linear time sorting, and covers medians and order statistics. The second part focuses on crucial data structures like arrays, linked lists, hash tables, binary search trees, and red-black trees. Acquire a solid understanding of algorithmic techniques and data organization for effective problem-solving in computer science.

Credits: 3.0