Course
Syllabus Honor Code Course Staff and Office Hours The Big Course Resources Page
Lectures
About Lectures Flat Lecture Index
1. 3/30 Welcome! 2. 4/1 C++ Fundamentals 3. 4/3 C++ Strings 4. 4/6 Testing, Vectors, and Grids 5. 4/8 Stacks and Queues 6. 4/10 Sets and Maps 7. 4/13 Big-O and Algorithmic Analysis 8. 4/15 Introduction to Recursion 9. 4/17 More Recursion 10. 4/20 Recursive Problem Solving 11. 4/22 Recursive Backtracking and Enumeration 12. 4/24 More Recursive Backtracking 13. 4/29 Object-Oriented Programming 14. 5/1 Pointers and Arrays 15. 5/4 Dynamic Memory Management 16. 5/6 Priority Queues and Binary Heaps 17. 5/8 Sorting Algorithms 18. 5/11 Introduction to Linked Lists 19. 5/13 More Linked Lists 20. 5/15 Binary Trees, Binary Search Trees, and Tree Traversals 21. 5/18 More on Binary Trees 22. 5/20 Huffman Coding
Sections
About Sections Section Portal Extra Section Problems (Pre-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. Trees
Assignments
About Assignments Study Group Bonus Regret Clause Form
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
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