Toggle navigation
🏠CS106B
Course
Syllabus
Spring 2020 FAQ
Meet the staff
Course placement
Honor code
Setting up Qt Creator
Lectures
About lectures
Lecture 4/6: Welcome!
Lecture 4/8: C++
Lecture 4/10: Strings
Lecture 4/13: Vectors and Grids
Lecture 4/15: Stacks and Queues
Lecture 4/17: Sets and Maps
Lecture 4/20: Big O and Asymptotic Analysis
Lecture 4/22: Introduction to Recursion
Lecture 4/24: Fractals
Lecture 4/27: Procedural Recursion
Lecture 4/29: Backtracking 1
Lecture 5/1: Backtracking 2
Lecture 5/4: C++ Classes
Lecture 5/6: Dynamic Memory
Lecture 5/8: Memory and Pointers
Lecture 5/11: Implementing VectorInt
Lecture 5/13: Heaps
Lecture 5/15: Sorting
Lecture 5/18: Linked Lists 1
Lecture 5/20: Linked Lists 2
Lecture 5/22: Trees
Lecture 5/27: Binary Search Trees
Lecture 5/29: Huffman Coding
Lecture 6/1: Hashing
Lecture 6/3: Graphs
Lecture 6/5: Graph Shortest Path Algorithms
Lecture 6/8: Esoteric Data Structures
Lecture 6/10: Wrap-up with CS 107 Preview
Assignments
About assignments
Assign0: Welcome to CS106B!
Assign1: Getting Your C++ Legs
Assign2: Fun with Collections
Assign3: Recursion
Assign4: Backtracking
Assign5: Priority Queue
Assign6: Linked Lists
Assign7: Huffman (optional)
Section
About section
Section1: ADTs
Section2: Big-O and Recursion
Section3: Recursive Backtracking
Section4: Classes and Objects
Section5: Pointers, Heaps, and Sorting
Section6: Linked Lists
Section7: Trees
Section8: Review
Assessments
About assessments
Mid-quarter assessment
End-quarter Assessment
🗓Schedule
🔍Search
Search