🏠CS106B
Course
Syllabus
Common questions
Course placement
Getting help
Honor Code
Setting up Qt Creator
Meet the teaching team
Lectures
About Lectures
1. 3/29 Welcome!
2. 3/31 C++ Fundamentals
3. 4/2 Strings
4. 4/5 Vectors and Grids
5. 4/7 Stacks and Queues
6. 4/9 Sets and Maps
7. 4/12 Big O and Asymptotic Analysis
8. 4/14 Introduction to Recursion
9. 4/16 Fractals
10. 4/19 Procedural Recursion
11. 4/21 Backtracking 1
12. 4/23 Guest Lecture -- Gerrymandering and Ethics
13. 4/26 C++ Classes
14. 4/28 Dynamic Memory
15. 4/30 Memory and Pointers
16. 5/3 Implementing StackInt
17. 5/5 Heaps
18. 5/7 Sorting
19. 5/10 Linked Lists 1
20. 5/12 Linked Lists 2
21. 5/14 Trees
22. 5/17 Binary Search Trees
23. 5/19 Huffman Coding
24. 5/21 Hashing
25. 5/24 Graphs
26. 5/26 Graph Shortest Path Algorithms
27. 5/28 Esoteric Data Structures
28. 6/2 Lexicon Case Study
29. 6/4 Course wrap-up
Assignments
About Assignments
0. Welcome to CS106B!
1. Getting Your C++ Legs
2. Fun with Collections
3. Recursion
4. Backtracking
5. Priority Queue
6. Linked Lists
7. Huffman Coding
Sections
About Sections
Section Portal
1. C++ fundamentals
2. Big-O and Recursion
3. Recursive Backtracking
4. Classes
5. Pointers
6. Linked lists
7. Trees
8. Review
Assessments
About Assessments
1. Mid-Quarter Diagnostic
2. Personal Project
🗓Schedule
🔍Search
⚠️ This page is out of date, from a past version of the course Spring Quarter 2021. The current quarter site is at
this link.
Lecture 2. C++ Fundamentals
Wednesday March 31
A brief introduction to C++
Readings
Text
Ch. 1, 2.1-2.4
Links
Slides
[Lecture Q&A]
[Video on canvas]
📦 Code
ReferenceExamples.zip
intro-cpp-lecture.zip