This page is from a previous offering of the course. It has been left up for archival purposes.
1 List of Summaries
We provide a summary write-up for many of the topics covered in lecture. These are intended as a slightly different presentation of the same materials, and an opportunity to provide additional discussion or examples that we would not otherwise have time for in class.
Be advised that these have not existed in prior quarters, and we are creating them as we go along during this quarter. As such these summaries can be delayed or may not happen at all since we can only guarantee a best effort at drafting them. If there is a topic that you wish there was a write up for, but it is not present, we have alternative readings in the optional course text listed for each lecture in the course calendar.
1.1 Midterm Content
- ADTs, Stacks, and Queues summary: This summary covers material discussed in the 1/5 and 1/7 lectures and will be most relevant for exercise 0.
- Running time: This summary covers the material discussed in the 1/7 lecture and will be most relevant for exercise 1.
- Asymptotics: This summary covers material discussed in the 1/9 lecture and the 1/12 lecture. It will be most relevant for exercise 1.
- Heaps: This summary covers material discussed in the 1/12 lecture, the 1/14 lecture, and the 1/16 lecture. It will be most relevant for exercise 2.
- Recurrences: This summary covers material discussed in the 1/16 lecture, the 1/21 lecture, and the 1/22 section. It will be most relevant for exercise 3.
- AVL Trees: This summary covers material discussed in the 1/23 lecture, 1/26 lecture, and 1/29 section. It will be most relevant for exercise 4.