Friday 
11 
34302

Friday 
2 
34304

Friday 
3 
34304 
Recitation 
Topic

Handouts, etc.

1 
Rules 
Handout 1 (Zookeeper), Handout 2 (Naive Bagger), Problem 1 (Alarm), Problem 1 Soln, Pseudocode for Forward and Backward Chaining

2 
Search 
Handout (Notes+Problem)

3 
Optimal Search and Search in Games 
Handout (Corrected typo in problem 1.a.iv!), Notes

4 
Progressive Deepening for Search in Games 
Handout (Solution)

5 
Quiz 1 Review 
Review Problems (Solutions)

6 
Constraints 
Notes, Problem: Train Scheduling
(Solution)

7 
More Constraint Problems 
Final 2000 Problem 3 (Revised) (Solution), Quiz 1 Review for 6.034 Spring 2005: Third CSP Problem (Solution), Fourth CSP Problem (Solution)

8 
Nearest Neighbors (NN) and Identification/Decision (ID) Trees 
Handouts: Notes, Notes and Problem on Drawing Decision Boundary in Nearest Neighbors (Solution), ID Tree Problem with Misc. Notes on Average Disorder, ID Tree Problem from Exam 2 Fall 2001 (Solution)
Practice Problems: kNearest Neighbors Problem with Solution (from Prof. Winston's Book), problems from Exam 2 Fall 2000 (Solution) and Final Fall 2002 (Solution) Additional Information: Slides on kNNs and ID Trees, Intoductory Slides on Machine Learning, including NNs and ID Trees [Part I] [Part II] Demonstrations: Nearest Neighbor (See demonstrations page in main course web page), ID Tree Java Applet Demo 
9 
Neural Networks 
Courtesy of Sourabh Niyogi (Follow the link to his recitation page for problems/handouts.)

10 
Support Vector Machines (SVMs) 
Problems/Handouts: Practice Exercises on Demostration Program and SVM Math (Solution), 2002 Final Problem 6 (Solution). More Problems: 2001 Final Problem 5 (Solution)

11 
Boosting 
Courtesy of Sourabh Niyogi (Follow the link to his recitation page for problems/handouts.), Boosting Notes (REVISED) 
12 
SVM's 2 
Courtesy of Sourabh Niyogi (Follow the link to his recitation page for problems/handouts.) 

Review Session 
Boosting Problem Solution, Boosting Notes (REVISED) 