Lectures
Click on a lecture to see the summary of that day, together with optional reading or viewing. You can also download the slides and any demo code.
It is Cornell policy that we do not record lectures. You are expected to attend in order to learn the material. You may review the lesson videos recorded during COVID for supplemental instruction, though that material is different from what is covered this semester.
Dictionaries
|
This lecture references Videos 19.1-19.7. This presentation explores the last built-in (as opposed to user-defined) type in this course. We also show how to store this data in files. More › |
| October 22, 2026 | handout | no slides | demos |
More Recursion
|
This lecture references Videos 17.6-17.11. The divide-and-conquer examples we saw in the previous session were on the easy side. In this session we look at some much more challenging examples. More › |
| October 20, 2026 | handout | slides | demos |
Recursion
|
This lecture references Videos 17.1-17.5. Recursion is a powerful programming tool and one of the fundamental principles of computer science. It is used in many advanced algorithms. More › |
| October 15, 2026 | handout | slides | demos |
Nested Lists
|
This lecture references Lesson 18. This lecture explores lists in greater depth, both literally and metaphorically, As lists can contain any object, they can also contain other lsits. More › |
| October 8, 2026 | handout | slides | demos |
