CPSC 320-500 SAMPLE MIDTERM EXAM

Problem 1: 

Answer the following questions for an automated travel agent:
	Give the percepts, actions, goals, and environment for your agent.
	Characterize the environment as being accessible, deterministic,
	episodic, static, and continuous or not, explaining your
	characterization.

Problem 2:

Evaluate the following LISP function calls:
	a.) (first '(a b c d))
	b.) (let ((x 12)) (* x x))

Problem 3:

Write a LISP function, nth-derivative, which takes three arguments,
coefficient, power and n, and returns the nth derivative of the
original term as a list containing the new coefficient and power in
the form (new-coefficient new-power).

Problem 4:

Describe how to solve the following problem using search.
Given the edges of a weighted directed graph, find the longest cycle
in the graph.

Problem 5:

Show how the minimax algorithm would progress through the given search tree.

	

Problem 6:

Show the truth tables for the following propositional logic
expressions (correct intermediate states may be worth partial credit):

a.)	 (A ^ B) -> C

Problem 7:

Provide one set of truth assignments for the variables (e.g. x = true,
y = false) that make the sentence true and one set of truth
assignments for the variables that make the sentence false.

a.) (x -> y) v (not x)

Problem 8:

Write first-order logic sentences for the following English sentences:

a.) All of the students showed up for the exam.