Final Exam: Outline

The final exam will be given Thursday, May 7, from 7:00 to 9:00 in Warren Weaver, room 317; and Monday May 11 from 7:00 to 9:00 in room 202. It is closed book and closed notes.

Topics covered

You should know the following algorithms well enough to carry them out: depth-first search; breadth-first search; iterative deepening; hill-climbing; game tree evaluation with alpha-beta pruning; Davis-Putnam algorithm; conversion to clausal form for propositional calculus and predicate calculus; resolution theorem proving for predicate calculus; backward-chaining and forward-chaining over Horn clauses; nearest neighbors learning, Naive Bayes learning; 1R learning; ID3 learning (though I will not give you any problem that involves computing entropies); k-means clustering.

You should understand the following algorithms well, though I would not ask you to carry them out on an exam: hill-climbing with sideways motion and/or random restart; simulating annealing; perceptron learning and back-propagation.