#Week

Slides

Further Readings

1-2

Lecture 1: Balanced Search Trees (I)

Weiss Sec. 4.4-4.5, 11.5
CLRS Chap. 11
Splay Tree Paper

3

Lecture 2: Balanced Search Trees (II)

S&W Sec. 3.3
CLRS Chap. 13, 18

4

Lecture 3: Priority Queues

Weiss Sec. 6.5-6.7, 11.3

5

Lecture 4: Search and Backtracking

Weiss Sec. 10.5
AIMA Chap. 3, Sec. 5.1-5.4
UC Berkeley CS188 Lec. 2, 3, 6

6

Lecture 5: Divide and Conquer

DPV Ch.2
K&T Ch.5
CLRS Ch.4

7

Lecture 6: Dynamic Programming

Weiss Sec 10.3
CLRS Chap. 14
K&T Chap. 6
DPV Chap. 6
David Silver's RL course Lec 1-5

8

Lecture 7: Greedy Algorithms

DPV Chap. 5
CLRS Chap. 15
Yitong Yin's course notes
Information theory book