CS 260 — Data and Algorithms
Surveys the representation of data such as lists, sets, queues, stacks, directed and undirected graphs, and dictionaries. Surveys algorithms for manipulating that data, and strategies such as brute force, greedy algorithms, divide-and-conquer, decrease-and-conquer, transform-and-conquer, and dynamic programming. Examines the analysis of algorithm complexity, and how to navigate the trade-offs between different data structures and algorithms.
Prerequisites: CS 161