Toggle navigation
🏠CS106B
Course
Syllabus
Summer 2020 FAQ
Course placement
Course communication
Honor code
Setting up Qt Creator
Meet the staff
Lectures
About lectures
Lecture 6/22: Welcome!
Lecture 6/23: Programming Fundamentals in C++
Lecture 6/24: Strings and Testing
Lecture 6/25: Console Programs and Vectors
Lecture 6/29: Ordered Data Structures
Lecture 6/30: Unordered Data Structures
Lecture 7/1: Using Abstractions (Breadth-First Search)
Lecture 7/2: Big-O Notation and Algorithmic Analysis
Lecture 7/6: Introduction to Recursion
Lecture 7/7: Recursive Fractals
Lecture 7/8: Why We Use Recursion
Lecture 7/9: Recursive Backtracking and Enumeration
Lecture 7/13: Recursive Backtracking Revisited
Lecture 7/14: Recursive Optimization and Review
Lecture 7/15: Object-Oriented Programming
Lecture 7/16: Dynamic Memory and Arrays
Lecture 7/20: Implementing an ADT
Lecture 7/21: Priority Queues and Heaps
Lecture 7/22: Memory and Pointers
Lecture 7/23: Introduction to Linked Lists
Lecture 7/27: Linked List Operations
Lecture 7/28: Linked List Wrapup and Intro to Sorting
Lecture 7/29: Advanced Sorting (Divide-and-Conquer)
Lecture 8/3: Trees
Lecture 8/4: Binary Search Trees
Lecture 8/5: Huffman Coding
Lecture 8/6: Hashing
Lecture 8/10: Graphs and Graph Algorithms
Lecture 8/11: Multithreading and Parallel Computing
Lecture 8/12: Life after CS106B
Assignments
About assignments
Assign0: Welcome to CS106B!
Assign1: Getting Your C++ Legs
Assign2: Fun with Collections
Assign3: Recursive Problem Solving
Assign4: Priority Queue
Assign5: Linked Lists
Assign6: Huffman Coding
Section
About section
Section1: C++ Fundamentals
Section2: ADTs and Big-O
Section3: Recursion!
Section4: Mid-Quarter Review and Object-Oriented Programming
Section5: OOP, Pointers, and Heaps, Oh My!
Section6: Linked Structures
Section7: Trees
Assessments
About assessments
Mid-Quarter Diagnostic
Final Project
🗓Schedule
🔍Search
Search