Computer Science 431
Exam #1 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 first hour exam will be on Friday, Sept. 29, and will
cover
Textbook: Chapters 1 - 5 (through the material on A*
search) together with notes on Lisp.
- Be able to describe what our authors mean by an intelligent or
rational agent.
- Be able to write Lisp code (including an understanding of
dotted pairs and property lists) and to the extent that it appears
- In homework
- In match.cl
- In the backtracking and generic search code examples
- Be able to describe states and operators (including
preconditions and postconditions)
- Be able to describe uninformed search: depth-first,
breadth-first, uniform cost and to explain the behavior of those
search techniques.
- Be able to describe the A* search algorithm and to explain its
behavior.