0

Python and programming diagnostic

(PDF)

1

Forward chaining, rule systems, backward chaining and goal trees

(PDF)

2

Basic search (breadth-first search, depth-first search, hill climbing, beam search), optimal search (branch and bound, A*), graph heuristics

(PDF)

3

Connect Four game search (alpha-beta search, a better evaluation function)

(PDF)

4

Constraint satisfaction problems, learning algorithms (k-nearest neighbors, decision trees)

(PDF)

5

Neural nets, boosting

(PDF)

Rule-based systems, search

(PDF)

Games, constraint satisfaction problems

(PDF)

K nearest neighbors, decision trees, neural nets

(PDF)

Assignment 5 neural nets hint

(PDF)

Support vector machines, boosting

(PDF)

Probability, Bayes nets, naïve Bayes, model selection

(PDF)

Quiz 1

(PDF)

(PDF)

(PDF)

(PDF)

Quiz 2

(PDF)

(PDF)

(PDF)

(PDF)

Quiz 3

(PDF)

(PDF)

(PDF)

(PDF)

Quiz 4

(PDF)

(PDF)

(PDF)

(PDF)

Final exam

(PDF)

(PDF)

(PDF)

(PDF)