This recitation covers the wood-cutting problem (dynamic programming) and Bloom filters (hashing, probability).