Computer Science 431
Exam #2 review:
Disclaimer: I have attempted to be comprehensive in the following,
but important items may have been omitted by mistake. If you see such
an omission, please let me know, but you are responsible for all of
the lecture material to date.
The second hour exam will be on Friday, Nov. 5, and will
cover
Textbook: Chapters 4 and 6, and the material in 20.5 on perceptrons.
- Be able to describe the role of heuristics in search, and to describe in
some detail the workings of A* search..
- Be able to describe hill climbing and search in continuous spaces.
- Be able to write basic algorithms (in lisp) for A* search. I will not give you a
problem that involves printing out a path - only the very basic
search algorithms will be explored (so most of the machinery in
the homework programs can be tossed out).
- Be able to use property lists
- Be able to describe the general method of genetic algorithms.
Although I will not give you a programming problem involving genetic
algorithms, I may describe a representation scheme for such a problem and ask
you how a genetic algorithm may proceed with it.
- Be able to describe game trees and the basics of alpha-beta pruning.
- Be able to describe how a perceptron works, and give weights for a simple
perceptron problem. Be able to give a geometric explanation for single
perceptrons.
Any questions? Please ask!
-Bob