🏠CS106B
Course
Syllabus
COVID Information
Course placement
Course Communication Guide
Common questions
Honor Code
Meet the teaching team
Resources
LaIR
Instructor Office Hours
Ed Discussion Forum
Paperless
Qt Installation Guide
C++ Reference
A Guide to C++ Strings
Stanford Library Documentation
Style Guide
Testing Guide
Python to C++ Guide
Submission Checklist
Textbook
Lectures
About Lectures
1. 6/21 Welcome!
2. 6/22 Functions, Parameters, Types, Control Flow
3. 6/23 C++ Review, Strings, Simple Test + Testing
4. 6/27 Console Programs and Vectors
5. 6/28 Grids, Stacks and Queues
6. 6/29 Sets and Maps
7. 6/30 Big O and Asymptotic Analysis
9. 7/5 Fractals
10. 7/6 Why We Use Recursion
11. 7/12 Backtracking Recursion
12. 7/13 Backtracking 2
13. 7/14 C++ Classes
14. 7/18 Dynamic Memory
15. 7/19 Implementing an ADT
16. 7/20 Priority Queues and Heaps
17. 7/21 Memory and Pointers
18. 7/25 Linked Lists Part 1
19. 7/26 Linked Lists 2
20. 7/27 Sorting
21. 8/1 Trees
22. 8/2 Binary Search Trees
23. 8/3 Huffman Coding
24. 8/4 Hashing
25. 8/8 Multithreading
26. 8/9 Programming Languages, Graphs, and more!
27. 8/10 Life After CS106B
Assignments
About Assignments
0. Welcome to CS106B!
1. Getting Your C++ Legs
2. Fun with Collections
3. Recursive Problem Solving
4. Priority Queue
5. Linked Lists
6. Huffman Coding
Sections
About Sections
Section Portal
1. C++ fundamentals
2. ADTs and Big-O
3. Recursion
4. Recursive Backtracking + OOP
5. Classes and Dynamic Memory
6. Memory Management, Pointers, and Linked Lists
7. Trees
8. Class Review (Optional)
Assessments
About Assessments
1. Midterm Exam
2. Personal Project
🗓Schedule
🔍Search
⚠️ This page is out of date, from a past version of the course Summer Quarter 2022. Go instead to
Fall Quarter 2022.
Lecture 12. Backtracking 2
Wednesday July 13
Backtracking, continued.
Links
Video on canvas
📦 Code and Slides
Lecture12.pdf
Lecture12Final.zip
Lecture12Starter.zip