Week

Dates

Lecture Topics

Assignment

Reading

0

Register for Classes

1

1/7 - 1/11

Class Introduction, Syllabus

Ch 12

2

1/14 - 1/18

Depth vs. Breadth Searching (1)

3

1/21 - 1/25

Proof Techniques

4

1/28 - 2/1

Red-Black Trees (2)

 HW 1 (1)

Ch 13

5

2/4 - 2/8

B-Trees (3)

Ch 18

6

2/11 - 2/15

Min-Max (Game) Trees (4)
Static State Evaluation
Alpha-beta Pruning (5)
Game Tree Theory

HW 2 

Handouts

7

2/18 - 2/22

TEST 1

8

2/25 - 2/29

Graphs (6) & Minimum Spanning Trees (7)
Fri, 2/29 - WITHDRAW DAY

Ch 22 and 23

3/3 - 3/7

SPRING BREAK - NO CLASS

9

3/10 - 3/14

PROJECT WORK DAY

10

3/17 - 3/21

Single-source & All-Pairs Shortest Path (8)

HW 3 (4) 

Ch 24 & 25

11

3/24 - 3/28

A* Path Searching (9)
Simulations (10)

Handouts

12

3/31 - 4/4

PROJECT WORK DAY

13

4/7 - 4/11

TEST 2

14

4/14 - 4/18

NP-Complete (11)
Approximation Algorithms (12)

HW 4 (7) 

Ch 34 & 35

15

4/21 - 4/25

DEMOS

HW 5 (10)

Finals

4/28 - 5/2

FINAL EXAM - TBA

HW 6 (12)