| A | B | C | D | E | F | G | H | I | J | K | L | M | N | O | P | Q | R | S | T | U | ||
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1 | ||||||||||||||||||||||
2 | Lectures | Section | Deadlines | |||||||||||||||||||
3 | ||||||||||||||||||||||
4 | Monday | Wednesday | Friday | Our SLs are awesome! | * All deadlines are tentative. | |||||||||||||||||
5 | ||||||||||||||||||||||
6 | Week 1 Mar. 31 - Apr. 4 | Course Overview | C++ Fundamentals Reading: Ch. 1, 2.1 - 2.4 | Pass-by-Reference, ASCII, and Strings in C++ Reading: 2.5, Ch. 3 | (No Section) | Section Sign-up Deadline through Paperless Sunday, Apr 6, 5:00 PM | Assignment #0 and Quiz #0 Due Friday, Apr. 4 11:59 PM | |||||||||||||||
7 | ||||||||||||||||||||||
8 | Week 2 Apr. 7 - 11 | Testing, Vectors, and Grids Reading: 5.1 | Stacks and Queues Reading: 5.2-5.3 | Sets and Maps Reading: 5.4 - 5.6 | C++ fundamentals ADTs | Quiz #1 Series Due Wednesday, Apr. 9 1:00 PM | Assignment #1 Due Friday, Apr. 11 11:59 PM | |||||||||||||||
9 | ||||||||||||||||||||||
10 | Week 3 Apr. 14 - 18 | Big-O and Algorithm Analysis Reading: 10.1 - 10.2 | Introduction to Recursion Reading: Ch. 7 | More Recursion Reading: 8.1 - 8.3 | ADTs Recursion | Quiz #2 Series Due Wednesday, Apr. 16 1:00 PM | Add/Drop Deadline Friday, Apr. 18, 5:00 PM | Assignment #2 Due Friday, Apr. 18 11:59 PM | ||||||||||||||
11 | ||||||||||||||||||||||
12 | Week 4 Apr. 21 - 25 | Fractals and Recursive Problem Solving Reading: 8.4 | Recursive Backtracking and Enumeration Reading: 9.1 | More Recursive Backtracking (and Structs) Reading: 9.1 | Backtracking | Quiz #3 Series Due Wednesday, Apr. 23 1:00 PM | Assignment #3 Due Friday, Apr. 25 11:59 PM | |||||||||||||||
13 | ||||||||||||||||||||||
14 | Week 5 Apr. 28 - May 2 | Midterm Exam (No Lecture) 7:00 - 9:00 PM | Object-Oriented Programming Reading: 6.1 - 6.3 | Pointers and Arrays Reading: Ch. 11 | Classes and More Backtracking | Quiz #4 Series Due Friday, May 2 1:00 PM | ||||||||||||||||
15 | ||||||||||||||||||||||
16 | Week 6 May 5 - 9 | Dynamic Memory Management Reading: 12.1, 12.3, 14.2 | Priority Queues and Binary Heaps Reading: 14.3, 16.5 | Sorting Algorithms Reading: 10.1, 10.3, 10.5 | Pointer Mayhem and Dynamic Memory Management New Content | Quiz #5 Series Due Wednesday, May 7 1:00 PM | Assignment #4 Due Wednesday, May 7 11:59 PM | |||||||||||||||
17 | ||||||||||||||||||||||
18 | Week 7 May 12 - 16 | Introduction to Linked Lists Reading: 12.2, 13.5 | More Linked Lists Reading: 14.2 - 14.4 | Trees Reading: 16.1 | Memory Management, Pointers, and Linked Lists | Quiz #6 Series Due Wednesday, May 14 1:00 PM | Assignment #5 Due Friday, May 16 11:59 PM | |||||||||||||||
19 | ||||||||||||||||||||||
20 | Week 8 May 19 - 23 | Binary Search Trees Reading: 16.2 - 16.4 | Huffman Coding | Hashing Reading: 15.3 | Linked Lists and Trees | Quiz #7 Series Due Wednesday, May 21 1:00 PM | Course W/D and Change of Grading Basis Deadline Friday, May 23, 5:00 PM | Assignment #6 Due Friday, May 23 11:59 PM | ||||||||||||||
21 | ||||||||||||||||||||||
22 | Week 9 May 26 - 30 | Memorial Day (No Class) | Introduction to Graph Algorithms | Dijkstra, A*, and Topological Sort | Trees | Quiz #8 Series Due Wednesday, May 28 1:00 PM | ||||||||||||||||
23 | ||||||||||||||||||||||
24 | Week 10 Jun. 2 - 6 | Ethics | Course Wrap Campus-Wide Last Day of Classes; No Classes Thursday; Finals Begin Friday | Final Exam (No Lecture) Friday, 8:30 - 11:30 AM | (No Section) | Assignment #7 Due Monday, June 2 11:59 PM | ◀ No late days for A7 ⚠️ | Quiz #9 Series Due Wednesday, Jun. 4 1:00 PM Final Day of Classes! | ||||||||||||||
25 | ||||||||||||||||||||||
28 | ||||||||||||||||||||||
29 | * Note: Stanford's final exam period runs from Friday, Jun. 6, through Wednesday, Jun. 11. Final exam dates and times are set by the registrar and will not change. | |||||||||||||||||||||
30 | * Note: Grades for graduating students are due to the registrar by 11:59 PM on Friday, June 13. For non-graduating students, 11:59 PM on Tuesday, June 17. See Stanford's academic calendar for more. | |||||||||||||||||||||