CS 561 - Data Structures and Algorithms - (3)
The study of data structures and algorithms and the mathematics needed to analyze their time and space complexity. Topics will include: amortized analysis and self-adjusting data structures for trees and priority queues, graphing algorithms, and greedy and divide-and-conquer paradigms.
Note: The course number CS 561 has not yet been officially assigned, so the course is being offered as a special topics class (CS 591, Section 001).
