CSE 415 Second Examination |
CSE 415: Introduction to Artificial Intelligence The University of Washington, Seattle, Winter 2008 |
The second exam will be similar in format and length to the midterm exam. The topics covered will be drawn from the midterm topic list (especially topics commonly answered incorrectly on the midterm) and the following additional topics. |
![]() |
Probabilistic reasoning Bayes' rule Odds and conversion between odds and probability Bayes nets Minimax search for 2-player, zero-sum games Static evaluation functions Backed up values Alpha-beta pruning Zobrist hashing Natural language understanding Levels of processing (acoustic through pragmatic) Context-free grammars Sentential forms and derivations The language generated by a grammar G Semantic representation using case frames Semantic grammars and controlled languages Perceptrons How to compute AND, OR, and NOT. Simple pattern recognition (e.g., 5 x 5 binary image inputs for optical character recognition) Training sets, training sequences, and the perceptron training algorithm. Linear separability and the perceptron training theorem. |