CS106B
Course
Syllabus
Honor Code
Course Staff and Office Hours
The Big Course Resources Page
Lectures
About Lectures
Flat Lecture Index
1. 6/23 Welcome!
2. 6/24 C++ Fundamentals
3. 6/25 C++ Strings
4. 6/26 Testing, Vectors, and Grids
5. 6/30 Stacks and Queues
6. 7/1 Sets and Maps
7. 7/2 Big-O and Algorithmic Analysis
8. 7/7 Introduction to Recursion
9. 7/8 More Recursion
10. 7/9 Recursive Problem Solving
11. 7/10 Recursive Backtracking and Enumeration
12. 7/14 More Recursive Backtracking
13. 7/15 Sorting Algorithms
14. 7/16 Problem Solving Day
15. 7/21 Object-Oriented Programming
16. 7/22 Pointers and Arrays
17. 7/23 Dynamic Memory Management
18. 7/24 Priority Queues and Binary Heaps
19. 7/28 Introduction to Linked Lists
20. 7/29 More Linked Lists
21. 7/30 Binary Trees, Binary Search Trees, and Tree Traversals
22. 7/31 More on Binary Trees
23. 8/4 Huffman Coding
24. 8/5 Hashing
25. 8/6 Graphs
26. 8/7 Dijkstra and A* Shortest Path Algorithms
27. 8/11 Graph Coding
28. 8/12 Wrap
Sections
About Sections
Section Portal
Extra Section Problems (Pre-Midterm)
Extra Section Problems (Post-Midterm)
1. C++ fundamentals
2. ADTs!
3. Big O and Recursion
4. Recursive Backtracking
5. Classes and Dynamic Memory
6. Memory Management, Pointers, and Linked Lists
7. Tree Encoding
Assignments
About Assignments
0. Welcome to CS106B!
1. Getting Your C++ Legs
2. Fun with Collections
3. Recursion Etudes
4. Recursive Backtracking
5. Tone Matrix
6. Linked Lists
7. Huffman Coding
Exams
About Exams
Exam Prep Advice
Midterm Exam
Final Exam
📅 Schedule
🔍Search
⚠️ This page is not current. It is an archive from Summer Quarter 2025.
The current quarter's site is at
this link
.
Search