Previous Month Back to 6.046 Homepage Next Month

March 2001
Sunday Monday Tuesday Wednesday Thursday Friday Saturday

1

L7 Sorting, median, order statistics

Reading: Chapter 10

2

R4 Review of sorting lower bounds. Reading: Sections 9.1-3

3

4

5

6

L8 Data structures: Hashing, dynamic dictionaries.

Reading: Chapter 12.

PS3 due.

PS4 out.

7

8

L9 Data structures: binary search trees, tree walks, relation to quicksort.

Reading: Sections 13.1-3

9

R5 Quiz Review.

10

11

12

13

L10 Data structures: 2-3 trees, insertion, deletion.

Reading: Chapter 19.

PS4 due.

14

15

QUIZ 1: in-class test.

16

No recitation.

17

18

19

20

L11 Augmenting data structures: dynamic order statistics, interval trees.

Reading: Chapter 15.

21

22

L12 Amortized algorithms: table doubling, potential method, self-organizing lists, competitive analysis.

Reading: Chapter 18.

23

R6 Amortized algorithms and dynamic programming.

24

25

26

27

SPRING BREAK

28

29

SPRING BREAK

30

SPRING BREAK

31