Schedule for weeks 11 through 12

Wk	Day	Date	Topic	Resources	Events

11	Mon	Nov 06	Transform-and-Conquer Presorting Balanced Trees	IDAA 6.1 IDAA 6.3 AVL Tree Demo B-Tree Demo	HW 12 due IDAA 6.1, 6.3 RQs due

	Wed	Nov 08	Transform-and-Conquer Heaps and Heapsort	IDAA 6.4 Heapsort Notes	IDAA 6.4 RQs due

	Fri	Nov 10	Transform-and-Conquer Horner's Rule Binary Exponentiation	IDAA 6.5	IDAA 6.5 RQs due

12	Mon	Nov 13	Space-Time Trade-offs Counting Sort Radix Sort	IDAA 7.1	HW 13 due IDAA 7.1 RQs due

	Wed	Nov 15	Space-Time Trade-offs String Matching	IDAA 7.2 (through page 262)	IDAA 7.2 RQs due

	Fri	Nov 17	Dynamic Programming Coin Problems Fibonacci Numbers Matrix Chain Multiplication	IDAA 8.1 Dynamic Programming Notes Fibonacci Demo Recursive Functions (Fibonacci)	IDAA 8.1 RQs due