Week

Dates

Lecture Topics

Assignment

Reading

0

 

Register for Classes

 

 

1

1/8 - 1/12

Class Introduction, Syllabus

 

Ch 12

2

1/15 - 1/19

Depth vs. Breadth Searching (1)

 

 

3

1/22 - 1/26

Proof Techniques

 

 

4

1/29 - 2/2

Red-Black Trees (2)

 HW 1 (1)

Ch 13

5

2/5 - 2/9

B-Trees (3)

 

Ch 18

6

2/12 - 2/16

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

HW 2 

Handouts

7

2/19 - 2/23

TEST 1

 

 

8

2/26 - 3/2

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

 

Ch 22 and 23

 

3/5 - 3/9

SPRING BREAK - NO CLASS

 

 

9

3/12 - 3/16

Single-Source Shortest Paths (8)

HW 3 (4)

Ch 24

10

3/19 - 3/23

All-Pairs Shortest Path

 

Ch 25

11

3/26 - 3/30

A* Path Searching (9)
Simulations (10)

HW 4 (7)

Handouts

12

4/2 - 4/6

PROJECT WORK DAY

 

 

13

4/9 - 4/13

TEST 2

 

 

14

4/16 - 4/20

NP-Complete (11)
Approximation Algorithms (12)

 

Ch 34 & 35

15

4/19 - 4/27

DEMOS

HW 5 (10)

 

Finals

5/1 - 5/7

FINAL EXAM - TBA

HW 6 (12)

 

Note - numbers in parenthesis denote mapping to objectives.