15-122 Principles of Imperative Computation (Fall 2012)

Midterm 1: Review Session

Data Basics

• Data Basics Notes
• Data Basics Solutions

Data Structures

• Data Structures Notes
• Hoop (Circularly Linked List)
• Implementing a Queue from 2 Stacks
• Shallow vs Deep Copying

Algorithms

• Formal definition of Big O: Set of functions. Putting Big O sets in order. Josh Zimmerman's Notes
• Merge sort analysis. Full Code, Code with No Annotations
• Pentary sort analysis. Homework 2 Theory
• Can Big O depend on more than one variable? (Homework 2 Programming: count_oovs)
• Tangent: When do contracts get checked?

Proofs

• Ternary Search (Notes, Solutions)
• Fibonacci Example (Notes)