Course (expand submenu)
Resources (expand submenu)
LaIR Ed Discussion Forum Paperless Qt Installation Guide C++ Reference Stanford Library Documentation Style Guide Testing Guide Classes Syntax Reference Sheet Python to C++ Guide Submission Checklist Textbook
Lectures (expand submenu)
Lecture 1: Welcome to CS106B Lecture 2: From Python to C++ Lecture 3: C++ Strings and their Properties Lecture 4: Vectors and Grids Lecture 5: Stacks and Queues Lecture 6: Sets and Maps Lecture 7: Big O and Asymptotic Analysis Lecture 8: Introduction to Recursion Lecture 9: Fractals Lecture 10: Procedural Recursion Lecture 11: Backtracking 1 Lecture 12: Backtracking 2 Lecture 13: C++ Classes Lecture 14: Dynamic Memory Lecture 15: Pointers Lecture 16: Implementing StackInt Lecture 17: Heaps Lecture 18: AI in CS Education Lecture 19: Sorting Lecture 20: Linked Lists 1 Lecture 21: Linked Lists 2 Lecture 22: Trees Lecture 23: Binary Search Trees Lecture 24: Huffman Coding Lecture 25: Hashing Lecture 26: Graphs Lecture 27: Dijkstra's Algorithm and the A* Algorithm Lecture 28: Esoteric Data Structures Lecture 29: The Spectre Attack Lecture 30: Course Wrap-up
Assignments (expand submenu)
About Assignments Assignment 0: Welcome to CS106B Assignment 1: Getting your C++ Legs Assignment 2: Fun with Collections Assignment 3: Recursion Etudes Assignment 4: Backtracking Assignment 5: Priority Queue Assignment 6: Linked Lists Assignment 7: Huffman Coding
Sections (expand submenu)
About Sections One-off-section change 1. C++ Fundamentals 2. ADTs, Big-O, and Intro to Recursion 3. Recursion and Intro to Backtracking 4. Recursive Backtracking 5. Classes and Dynamic Memory 6. Memory Management, Pointers, and Linked Lists 7. Linked Lists and Trees 8. Trees
Assessments (expand submenu)
🗓Schedule

AI in CS Education

Presentation link

← Previous Post
Next Post →

Hugo v0.150.0 powered • Theme Beautiful Hugo adapted from Beautiful Jekyll