This is a preview of the schedule planned for the quarter. We will update this schedule as we go. That means this page should describe the past quite well, but it won't always accurately predict the future…

All assignment due dates are expressed as 11:59pm PT.

Lectures will be delivered via Zoom MTWTh 2:00-3:00pm PST. You're encouraged to join us live if possible. We will also post the recording for later asynchronous viewing. You can access the lecture zoom room and recordings from our course Canvas page.

  Monday Tuesday Wednesday Thursday Section/Assign
1

Jun 21

📓Welcome!

Reading: 1.1, 1.3
A0 Released

Jun 22

📓Programming Fundamentals in C++

Reading: 1.2, 1.4-1.7, 2.1-2.4
A1 Released

Jun 23

📓Strings and Testing

Reading: 3.1-3.7
A0 Due

Jun 24

📓Console Programs and Vectors

Reading: 2.5-2.9, 5.1
2

Jun 28

📓Ordered Data Structures


Reading: 5.1-5.3

Jun 29

📓Unordered Data Structures


Reading: 5.4, 5.5
A1 Due

Jun 30

📓Using Abstractions (Breadth-First Search)

Reading: 5.6
A2 Released

Jul 1

📓Big-O Notation and Algorithmic Analysis

Reading: 10.2
3

Jul 5

No Class: Holiday


Jul 6

📓Introduction to Recursion


Reading: 7.1-7.3

Jul 7

📓Recursive Fractals


Reading: 7.4, 8.4
A2 Due

Jul 8

📓Why We Use Recursion


Reading: 8.1-8.3
A3 Released
4

Jul 12

📓Recursive Backtracking and Enumeration

Reading: 9.1-9.3

Jul 13

📓Recursive Optimization and Review


Reading: 6.1-6.5, 9.3

Jul 14

📓Social Impact and Algorithmic Analysis


Jul 15

📓Object-Oriented Programming


Reading: 11.1, 11.3, 12.1
A3 Due, Diagnostic Friday-Sunday (7/16-7/18)
5

Jul 19

📓Dynamic Memory and Arrays


Reading: 8.2, 9.1-9.2
A4 Released

Jul 20

📓Implementing an ADT


Reading: 12.1, 12.3, 12.4, 13.3, 14.4

Jul 21

📓Priority Queues and Heaps


Reading: 14.3, 16.5

Jul 22

📓Memory and Pointers


Reading: 11.1, 11.2, 11.4
6

Jul 26

📓Introduction to Linked Lists


Reading: 12.2. 13.5

Jul 27

📓Linked List Operations


Reading: 14.2 - 14.4
A4 Due

Jul 28

📓Linked List Wrapup and Intro to Sorting

Reading: 14.2 - 14.4, 10.1, 10.2
A5 Released

Jul 29

📓Advanced Sorting (Divide-and-Conquer)

Reading: 10.3, 10.4, 10.5
7

Aug 2

📓Trees

Reading: 16.1

Aug 3

📓Binary Search Trees


Reading: 16.2-16.4
A5 Due

Aug 4

📓Huffman Coding

Reading: Supplemental Info in Assignment Handout
A6 Released

Aug 5

📓Hashing


Reading: 15.3
8

Aug 9

📓Graphs and Graph Algorithms


Aug 10

📓Multithreading and Parallel Computing


Aug 11

📓Life after CS106B


A6 Due (Hard Deadline)

Aug 12

No Class


End of Quarter Assessment Friday-Sunday (8/13-8/15)