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.

• 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.