MIDTERM EXAMINATION
Spring 2009
CS607- Artificial Intelligence (Session - 1)
Solved By: Imran Ahmad QureshiQuestion No: 1 ( Marks: 1 ) - Please choose one
Most of the solution spaces for problems can be represented in a ________
Graph Table
Demo
Question No: 2 ( Marks: 1 ) - Please choose one
By getting grips on ___________ that deal with searching techniques in graphs and trees, problem solving can be performed in an efficient manner.
Pseudocode
Algorithms Charts
Graphs
Question No: 3 ( Marks: 1 ) - Please choose one
Every graph can be converted into a tree.
True False
Question No: 4 ( Marks: 1 ) - Please choose one
In Breadth First Search the node with the largest value of height will be at the _________ priority to be picked.
Maximum Minimum
None of the given
Question No: 5 ( Marks: 1 ) - Please choose one
Breadth-First Search checks all paths of a given length before moving on to any longer paths.
True False
Question No: 6 ( Marks: 1 ) - Please choose one
Breadth-first search is a good idea when you are confident that the branching factor is _________
Extremely small
Small Medium
Large
Question No: 7 ( Marks: 1 ) - Please choose one
The foothill problem occurs whenever there are___________ peaks.
High
Secondary Primary
Deep
Question No: 8 ( Marks: 1 ) - Please choose one
The Plateau problem comes up when there is a mostly flat area ___________ the peaks.
Separating
Joining
Over
None of the given
Question No: 9 ( Marks: 1 ) - Please choose one
Which one of the problem is more subtle, and consequently, is more frustrating:
Foothill problem
Plateau
Ridge Box
Question No: 10 ( Marks: 1 ) - Please choose one
The paths found by best-first search are likely to be __________ than those found with other methods.
None of the given
Shorter
Longer
Question No: 11 ( Marks: 1 ) - Please choose one
In Basic Genetic Algorithm the term mutation refers to a small random ________.
Number
Change Operator
Operand
Question No: 12 ( Marks: 1 ) - Please choose one
Which of the following two components are closely coupled and each is intrinsically tied to the other.
i. Knowledge representation
ii. Reasoning
iii. Execution
iv. Planning
i & iii
ii & iii
iii & iv
i & iiQuestion No: 13 ( Marks: 1 ) - Please choose one
Semantic networks are graphs, with nodes representing ____________ and arcs representing ____________ between objects.
objects, relationships relationships, distance
objects, distance
distance, relationships
Question No: 14 ( Marks: 1 ) - Please choose one
A proposition is the statement of a ________.
Fact Equation
Action
Theorem
Question No: 15 ( Marks: 1 ) - Please choose one
___________ reasoning is based on forming, or inducing a ‘generalization’ from a limited set of observations.
Deductive
Abductive
Inductive Analogical
Question No: 16 ( Marks: 1 ) - Please choose one
An ___________ is “A computer program designed to model the problem solving ability of a human expert."
Expert system Intelligent System
Echo System
Energy System
Question No: 17 ( Marks: 1 ) - Please choose one
Another expert system named __________ was developed by Digital Equipment Corporation, as a computer configuration assistant.
R1/XCON MYCIN
Dendral
R3/XCON
Question No: 18 ( Marks: 1 ) - Please choose one
An expert system may replace the expert or assist the expert.
True False
Question No: 19 ( Marks: 1 ) - Please choose one
Conventional programming focuses on _______, while ES programming focuses on ________
Solution, Problem Problem, Solution
Problem, Expert
Solution, Expert
Question No: 20 ( Marks: 1 ) - Please choose one
In backward chaining terminology, the hypothesis to prove is called the ________.
Proof
Goal Plan
None of the given
----------------------------------------------------------------------------------------------------
-----------------------------------------------------------------------------------------------------
Question No: 21 ( Marks: 2 )
Give definition of Expert System? An expert system is “A computer program designed to model the problem solving ability of a human expert”.
Question No: 22 ( Marks: 3 )
What is depth first search? give priority function for it. Depth First Search dives into a tree deeper and deeper to fine the goal state.
P (n) = 1/height (n)
In this we will give priority to the element with minimum P(n) hence the node with the largest value of height will be at the maximum priority to be picked from Q.
Question No: 23 ( Marks: 5 )
Write down at least 5 names for the application fields of Genetic Algorithm?Question No: 24 ( Marks: 10 )
Discuss backward chaining with the help of doctor and patient example? Backward chaining is an inference strategy that works backward from a hypothesis to a proof. You begin with a hypothesis about what the situation might be. Then you prove it using given facts, e.g. a doctor may suspect some disease and proceed by inspection of symptoms. In backward chaining terminology, the hypothesis to prove is called the goal.
Backward chaining example
Consider the same example of doctor and patient that we looked at previously
Rules
Rule 1
IF The patient has deep cough
AND We suspect an infection
THEN The patient has Pneumonia
Rule 2
IF The patient’s temperature is above 100
THEN Patient has fever
Rule 3
IF The patient has been sick for over a fortnight
AND The patient has fever
THEN We suspect an infection