Lectures
Click on a lecture to see the video if it is available. Videos are restricted to a valid Cornell netid login. However, slides and demo code may be downloaded without a Cornell netid.
Course Wrap-Up
There is no supplementary reading for this lecture. Hopefully you have enjoyed this course. Assuming that you have, today we discuss your options about what to do next in computer science. Watch › |
December 10, 2019 | slides | no handout | no demos |
Searching and Sorting
The reading for this lecture is Appendix B.1-B.3. Today we complete our discussion of loop invariants and show how to use them to implement sorting. Watch › |
December 5, 2019 | slides | handout | demos |
Sequence Algorithms (cont)
There is no supplementary reading for this lecture. Today we continue with the invariants and algorithms from the last lecture. We show how changing invariants can change your algorithm. Watch › |
December 3, 2019 | slides | handout | demos |
Sequence Algorithms
The online reading is Loop Invariants. Today we start on the last major topic in the course: sorting. We start off with some sorting-like algorithms to demonstrate the challenges. Watch › |
November 26, 2019 | slides | handout | demos |
GUI Applications
There is no supplementary reading for this lecture. This lecture combines while-loops and classes to show how to make complex graphical applications. This lecture will provide you all that you need to know to get started on the last assignment. Watch › |
November 21, 2019 | slides | handout | demos |