Sample Midterm 1
Closed book, notes, laptop, cell phone
The following are questions i considered asking on Midterm 1. i eventually chose 16 other
problems and so am publishing these as practice questions. The material here and on the exam
are roughly the same - minimax, local search and lots of A*.
1. The distance from a node to the goal is 10. A heuristic has returned the following estimated
distances. For each one, mark whether they are from a possibly admissible heuristic (T/F).
2. State whether the following admissible heuristics are Useful, Not Useful or Dominant.
h1(n) = straight line distance
h2(n) = 0
h3(n) = max(h1, h2)
h4(n) = min(h1, h2)
3. In A*, if h(n)
c(n,a,goal) then f(n) < C*. This is independent of g(n) even though ,
g is the past cost which we already know and thus isn't an estimate but a perfect number. It is
never too low or too high, so whether f(n) is accurate depends entirely on h(n) - we know g(n)'s
contribution is perfectly accurate.
4. In what sense is A* preferable to IDA*?
A* searches fewer nodes than IDA* and thus has better run time performance.
5. Which algorithm we use depends on the specific needs (i.e., fast run-time performance) and
properties (i.e., non-determinism) of the problem and algorithm. Name two (not counting run-
time performance and non-deterministic environments).
These are listed in lecture 2. They include resources memory, run time performance,
development time, tuning time and power and factors deterministic, dynamic, perfect
information, information accuracy, importance of optimality, discrete state, discrete actions, state
space size, presence of loops, solution density, dead ends, solution type (path or goal), degree of
sensitivity to starting location, whether the solution depth is known, variable action costs, test
cost, relative error cost, interruptibility, context-sensitive action costs and a whole bunch of other
6. Name three differences between breadth-first and depth-first search (other than that one
searches breadth first and the other searches depth first).