EdusalsaDiscover Your Stanford

CS 166

Data Structures

  • Not Offered

3 - 4 units

Letter or Credit/No Credit

Techniques in the design, analysis, and implementation of data structures. Isometries between data structures (including red/black trees and 2-3-4 trees), amortized analysis (including Fibonacci heaps and splay trees), and randomization (including count-min sketches and dynamic perfect hash tables). Data structures for integers and strings (including van Emde Boas trees and suffix trees). Possible additional topics include functional data structures, concurrent data structures, and spatial data structures. Prerequisites: CS107 and CS161.

Course Prequisites

Sign Up

To save CS 166 to your course bucketlist

Already Have An Account? Log In