🏠CS106B
Course
Syllabus
Common questions
Course placement
Getting help
Honor Code
Meet the teaching team
Resources
LaIR
Ed Discussion Forum
Paperless
Qt Installation Guide
C++ Reference
Stanford Library Documentation
Style Guide
Testing Guide
Classes Syntax Reference Sheet
Python to C++ Guide
Submission Checklist
Textbook
Lectures
About Lectures
Lecture Quizzes
1. 4/3 Welcome!
2. 4/5 From Python to C++
3. 4/7 Strings
4. 4/10 Vectors and Grids
5. 4/12 Stacks and Queues
6. 4/14 Sets and Maps
7. 4/17 Big O and Asymptotic Analysis
8. 4/19 Introduction to Recursion
9. 4/21 Fractals
10. 4/24 Procedural Recursion
11. 4/26 Backtracking 1
12. 4/28 Backtracking 2
13. 5/1 C++ Classes
14. 5/3 Dynamic Memory
15. 5/5 Memory and Pointers
16. 5/8 Implementing StackInt
17. 5/10 Guest Lecture on Ethics, Benjamin Xie
18. 5/12 Heaps
19. 5/15 Sorting
20. 5/17 Linked Lists 1
21. 5/19 Linked Lists 2
22. 5/22 Trees
23. 5/24 Binary Search Trees
24. 5/26 Huffman Coding
25. 5/31 Hashing
26. 6/2 Graphs
27. 6/5 Graph Shortest Path Algorithms
28. 6/7 Course wrap-up
Assignments
About Assignments
0. Welcome to CS106B!
1. Getting Your C++ Legs
2. Fun with Collections
3. Recursion Etudes
4. Backtracking
5. Priority Queue
6. Linked Lists
7. Huffman Coding
Sections
About Sections
Section Portal
1. C++ fundamentals
2. ADTs, Big-O, and Intro to Recursion
3. Recursion and Intro to Backtracking
4. Recursive Backtracking
5. Classes and Dynamic Memory
6. Memory Management, Pointers, and Linked Lists
7. Linked Lists and Trees
8. Trees
Assessments
About Assessments
1. Midterm Exam
2. Final Exam
🗓Schedule
🔍Search
⚠️ This page is out of date, from a past version of the course Spring Quarter 2023. The current quarter site is at
this link.
Lecture 25. Hashing
Wednesday May 31
We are going to talk about a tremendously useful idea today: hashing!
Reading:
Text
15.3, 15.4
Slides
Video on Canvas