EdusalsaDiscover Your Stanford

CS 166

Data Structures

  • Not Offered

3 - 4 units

Letter or Credit/No Credit

This course is designed as a deep dive into the design, analysis, implementation, and theory of data structures. Over the course of the quarter, we'll explore fundamental techniques in data structure design (isometries, amortization, randomization, word-level parallelism, etc.). In doing so, we'll see a number of classic data structures like Fibonacci heaps and suffix trees as well as more modern data structures like count-min sketches and range minimum queries. By the time we've finished, we'll have seen some truly beautiful strategies for solving problems efficiently. Prerequisites: CS107 and CS161.

Course Prequisites

Sign Up

To save CS 166 to your course bucketlist

Already Have An Account? Log In