[Tue Mar 14 14:20 2017]
If you missed the midterm review chat we had earlier today, you can
still read it on Hangouts:
chat link. Alternatively, you can download the 28-page
PDF Transcript.
Also, here are the "fair game" topics for the midterm:
- Big-Oh notation, Big-Omega notation
- Running times of stack and queue operations
implemented as linked-lists and arrays.
- Estimate the running time of code snippets
using Big-Oh and Big-Omega notation.
- Writing functions (member and/or non-member)
for linked lists.
Here are topics that will not be on the exam
- Theta notation
- graphs
- Binary-search trees, AVL trees
- Proof by induction
- Other proofs
- Writing functions that use recursion
- Coding with doubly-linked lists