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 Tuesday, Oct. 31, and will cover

Textbook:  Chapters 6, 7, and 9, including material on resolution in the propositional calculus, more in-depth material on searching (programs, algorithms, the additional lisp we have done),

• Be able to write lisp code using the sort function. Be able to describe and define lambda expressions.
• Be able to write basic algorithms (in lisp) for depth-first, breadth-first, backtracking, and 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 sample programs can be tossed out).
• Be able to write expressions in the propositional calculus, construct truth-tables, distinguish between valid, satisfiable, and unsatisfiable, and do resolution theorem proving in the propositional calculus. Know the basic identities and definitions (contrapositive, necessary condition, etc.)
• Be able to write and translate expressions in the predicate calculus, know the basic identities (not forall, etc.), and be able to state and use the three basic rules (universal elimination, etc.). You will not be asked questions on unification or resolution in the predicate calculus, nor will you be asked any questions on Prolog on this exam. Furthermore, since we will be using the situation calculus in our discussions of planning, I will not ask questions on the situation calculus on this exam. These questions will be reserved for exam #3.

Any questions?  Please ask!

-Bob