CPSC 320-500 Sample Final Exam
Problem 1:
Give logical expressions for the following sentences, suitable for use with Generalized Modus Ponens:
a.) Cars and trucks are vehicles. b.) Vehicles that have gas provide transportation unless broke.
Problem 2:
Draw an inheritance graph containing the following information:
Horses, cows, coyotes, and pigs are mammals. Mammals, birds, and insects are animals. Birds have
wings and fly except for penguins, which swim, and road-runners, which run. Wiley is a coyote and
RR is a road-runner. Coyotes eat road-runners but Wiley cannot eat RR.
Problem 3:
Explain the difference between conditional planning and replanning, total-order versus partial-order
planning, refinement vs. debugging planning and their uses.
Problem 4:
Given the prior (independent) probabilities for having a disease (.0001) and having a symptom (.1) and the
conditional probability of having a symptom if one has the disease (.75), compute the probability of a
person having the disease given they have the symptom.
Now we determine the prior probability of the symptom is incorrect but we guess that the probability of
having the having the symptom but not the disease is .2, use normalization to recompute the probability of
having the disease given the symptom.
Problem 5:
Given the following attribute sets and decisions, show a decision tree that would be most efficient (in avg
number of attributes considered, in number of nodes in decision tree, in max. depth of decision tree).
Dept Level Exams HWs Labs Take-class
cpsc 300 2 4 3 yes
cpsc 300 2 2 2 no
cpsc 300 3 5 0 yes
cpsc 400 3 7 1 no
cpsc 400 2 3 2 yes
elec 400 3 7 1 yes
Problem 6:
Given a neural network with inputs, edge weights, and activation functions defined, show the outputs.
Problem 7:
Given a description of a grammar and lexicon, show how a particular sentence would be parsed, or identify
sentences by whether they have more than one, exactly one, or no parses.
Problem 8:
Given a particular line drawing, label the lines using the natural constraints as described in the book.
Problem 9:
Describe the following concepts:
context-free grammar, context-sensitive grammar, perceptrons, Hopfield networks,
constraint propagation, hierarchical decomposition.