Final Exam: Outline

The final exam will be given Wednesday, May 3, from 7:00 to 9:00 in Warren Weaver, room 101. It is closed book and closed notes. You will not need a calculator.

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 and resolution theorem proving for both propositional calculus and predicate calculus; backward-chaining and forward-chaining over Horn clauses; Naive Bayes learning, 1R learning, ID3 learning (though I will not give you any problem that involves computing entropies).

You should understand the following algorithms well, though I would not ask you to carry them out on an exam: GSAT; simulating annealing; perceptron learning and back-propagation.