Course
Syllabus Honor Code Course Staff and Office Hours The Big Course Resources Page
Lectures
About Lectures Flat Lecture Index
1. 6/22 Welcome! 2. 6/23 C++ Fundamentals 3. 6/24 C++ Strings 4. 6/25 Testing, Vectors, and Grids 5. 6/29 Stacks and Queues 6. 6/30 Sets and Maps 7. 7/1 Big-O and Algorithmic Analysis 8. 7/6 Introduction to Recursion 9. 7/7 More Recursion 10. 7/8 Recursive Problem Solving 11. 7/9 Recursive Backtracking and Enumeration 12. 7/13 More Recursive Backtracking 13. 7/14 Sorting Algorithms 14. 7/15 Problem Solving Day 15. 7/20 Object-Oriented Programming 16. 7/21 Pointers and Arrays 17. 7/22 Dynamic Memory Management 18. 7/23 Priority Queues and Binary Heaps
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
Assignments
About Assignments Study Group Bonus
0. Welcome to CS106B! 1. Getting Your C++ Legs 2. Fun with Collections 3. Recursion Etudes 4. Recursive Backtracking 5. 🌱 Tone Matrix
Exams
About Exams Exam Prep Advice
Midterm Exam
📅 Omni-Grid
🔍Search

Search

All course materials © Stanford University 2024. This content is protected and may not be shared, uploaded, or distributed.
Website programming by Julie Zelenski with modifications by Sean Szumlanski • Styles adapted from Chris Piech • This page last updated 2020-Sep-03