CMSY 265 Data Structures and Algorithm Analysis
This course is a study of user-defined data structures and object-oriented design and algorithms related to sorting, graphs and trees, and combinatorics. Topics include: complexity analysis of elementary algorithms, data structures for multidimensional data such as K-D trees; heaps and priority queues, including binary heaps, binomial heaps, leftist heaps; B-trees for external storage; other commonly used data structures, such as hash tables and disjoint sets, sorting algorithms, basic graph algorithms including graph traversal, topological sorting, shortest path, minimum spanning trees, and paradigms in the design of algorithms. Programming projects are included.
Hours Weekly
4 hours 40 min