Combined Presentations
This page includes both the pre-recorded lecture series and the interactive Zoom presentations. Click on a link to see the video if it is available. All videos are restricted to a valid Cornell netid login. However, slides and demo code may be downloaded without a Cornell netid.
Note: These versions of the videos are not closed-captioned. If you need closed captioning support for these videos, please visit the official VOD channel for CS 1110.
Lesson 17. Recursion
|
In this lesson we introduce recursion, a powerful programming tool and one of the fundamental principles of computer science. It is used in many advanced algorithms. Watch › |
| 11 videos totalling 1:37 hours | slides | demos |
Oct. 15. For-Loops
|
This presentation references Videos 16.1-16.7. In this session, we review the for-loop, which is the next control structure. This is the last control structure we will need for a while. Attend › |
| October 15, 2020 | slides | no demos |
Lesson 16. For-Loops
|
Lists (and sequences) come with their own special control structure: the for-loop. This is the last traditional control structure we will see for a while. Watch › |
| 8 videos totalling 1:02 hours | slides | demos |
Oct. 13. Lists (and Sequences)
|
This presentation references Videos 15.1-15.7. In this session we review the two new sequence data types: tuples, and lists. This is the last material on the first prelim. Attend › |
| October 13, 2020 | slides | demos |
Lesson 15. Sequences
|
In this lesson we introduce two more sliceable data types: tuples and lists. They are similar to strings, except that they can contain data other than text. Watch › |
| 8 videos totalling 41:34 minutes. | slides | demos |