SRM INSTITUTE OF SCIENCE AND TECHNOLOGY

Department Of Computer Science and Engineering

18CSC305J-ARTIFICIAL INTELLIGENCE: CYCLE TEST – II

Academic Year: 2020-2021 (EVEN Semester) / Staff: Dr.V.Hemamalini

Part A (20*1=20)

Question Level: Easy

1) The main condition which required for alpha-beta pruning is?

a) alpha<=beta
b) alpha>=beta
c) alpha=beta
d) alpha!=beta

2) Wumpus World is a classic problem, best example of _______

a) Single player Game
b) Two player Game
c) Reasoning with Knowledge
d) Knowledge based Game

3) Which is used to compute the truth of any sentence?

a) Semantics of propositional logic
b) Alpha-beta pruning
c) First-order logic
d) Both Semantics of propositional logic & Alpha-beta pruning

4) When the resolution is called as refutation-complete?

a) Sentence is satisfiable
b) Sentence is unsatisfiable
c) Sentence remains the same
d) None of the mentioned

5) In predicate indexing the buckets are stored as

a) Lists
b) Stack
c) Hashes
d) None of the mentioned

6) The Prisoners’ Dilemma is not a constant sum game because

a) some outcomes are better than others for both players.
b)  the prisoners’ sentences are necessarily non-zero.
c) the game does not have a Nash equilibrium.
d) the sum of the prisoners’ sentences in non-zero.
7) The time and space complexity of BFS is (For time and space complexity problems consider b
as branching factor and d as depth of the search tree.)

a) O(bd+1) and O(bd+1)

b) O(b2) and O(d2)
c) O(d2) and O(b2)
d) O(d2) and O(d2)

Question Level: Medium

8)The Blocks World Problem in Artificial Intelligence is normally discussed to explain a

a)Search technique
b)Planning system
c)Constraint satisfaction system
d)Knowledge base system

9) Select the appropriate technique that can be used for Map coloring problem

a)Means-end analysis
b)Constraint satisfaction
c)AO* search
d)Breadth first search

10) The adjective “first-order” distinguishes first-order logic from ___________ in which there
are predicates having predicates or functions as arguments, or in which one or both of predicate
quantifiers or function quantifiers are permitted.

a) Representational Verification
b) Representational Adequacy
c) Higher Order Logic
d) Inferential Efficiency

11) Below is the snapshot of a 2-person game and determine the saddle point.

a)X2Y2
b)X1Y2
c)X1Y1
d)There is no saddle point.
12) Below is the snapshot of a 2-person game. Strategy that Y will play is

a)X1
b)X2
c)Y1
d)Y2

13) Below is the snapshot of a 2-person game. If the game is played many times the value of the
game will be

a)19.00.
b)4.75.
c)11.00.
d)unable to be computed as the was not given.

14) In partial order plan.

A. Relationships between the actions of the behavior are set prior to the actions
B. Relationships between the actions of the behavior are not set until absolutely necessary

Choose the correct option.

a) A is true
b) B is true
c) Either A or B can be true depending upon situation
d) Neither A nor B is true

15) In this planning system, the problem solver makes use of a single stack that contains both
goals and operators that have been proposed to satisfy those goals.
a) Meta Planning
b) Case base Planning
c) Goal Stack Planning
d) None of the mentioned

16) ‘α |= β ‘(to mean that the sentence α entails the sentence β) if and only if, in every model in
which α is _____ β is also _____
a) True, true
b) True, false
c) False, true
d) False, false

Question Level: Difficult

17) A∗ algorithm uses f′=g+h′ to estimate the cost of getting from the initial state to the goal
state, where g is a measure of cost getting from initial state to the current node and the function h
′ is an estimate of the cost of getting from the current node to the goal state. To find a path
involving the fewest number of steps, we should test,

a) g=1
b) g=0
c) h′=0
d) h′=1

18) Consider following sentences regarding A∗, an informed search strategy in Artificial
Intelligence (AI).

a)A∗ expands all nodes with f(n)<C∗

b)A∗ expands no nodes with f(n)≥C∗
c) Pruning is integral to A∗

Here, C∗ is the cost of the optimal solution path. Which of the following is correct with respect
to the above statements?

a)Both statements a and statement b are true

b)Both statements a and statement c are true
c)Both statements b and statement c are true
d)All the statements a, b and c are true

19) What is the correct translation of the following statement into mathematical logic? “Some
real numbers are rational”

Answer : C
20) P and Q are two propositions. Which of the following logical expressions are equivalent?
a)Only I and II

b)Only I, II and III

c)Only I, II and IV

d)All of I, II, III and IV

21)The CORRECT formula for the sentence, “not all rainy days are cold” is

Answer : D

22) Select the appropriate code for the recursive Tower of Hanoi problem.(n is the number of

disks)

a)public void solve(int n, String start, String auxiliary, String end)

{
if (n == 1)
{
System.out.println(start + &quot; -&gt; &quot; + end);
}
else
{
solve(n - 1, start, end, auxiliary);
System.out.println(start + &quot; -&gt; &quot; + end);
solve(n - 1, auxiliary, start, end);
}
}
b)public void solve(int n, String start, String auxiliary, String end)
{
if (n == 1)
{
System.out.println(start + &quot; -&gt; &quot; + end);
}
else
{
solve(n - 1, auxiliary, start, end);
System.out.println(start + &quot; -&gt; &quot; + end);
}
}

c)public void solve(int n, String start, String auxiliary, String end)

{
if (n == 1)
{
System.out.println(start + &quot; -&gt; &quot; + end);
}
else
{
System.out.println(start + &quot; -&gt; &quot; + end);
solve(n - 1, auxiliary, start, end);
}
}
d)public void solve(int n, String start, String auxiliary, String end)
{
if (n == 1)

{
System.out.println(start + &quot; -&gt; &quot; + end);
}
else
{
solve(n - 1, start, end, auxiliary);
System.out.println(start + &quot; -&gt; &quot; + end);
}
}

Answer : A

Part B (10*3=30)
 Question Level: Easy

1) Differentiate BFS & DFS.

2) Compare blind search and heuristic search with an example.
3) List some drawbacks of hill climbing process.
4) Short notes on frames with an example
5) What is simulated annealing?
6) Briefly explain Propositional Logic.
7) Define Semantics.
8) What is saddle point?

Question Level: Medium

9) With an example, show objects, properties functions and relations.

10) Briefly explain Genetic Algorithms.
11) Brief on Nash equilibrium with an example.
12) Write the syntax of Predicate Logic with an example.
13) Explain Conjunctive Normal form in detail
14) Explain SEMANTIC NETWORKS in detail. List down the advantages and
disadvantages of SEMANTIC NETWORKS.
15) Explain about Unification in detail.

B. Question Level: Difficult

16) Consider the following two-person game: Assume that both players know the value of x,

a)For what values of x (if any) is there a Nash equilibrium in which Player 2 chooses R
with probability one? Explain, and describe the equilibrium or equilibria in different
cases.
b) For what values of x (if any) does decision R for Player 2 survive iterated deletion of
strictly dominated strategies. Explain.

17) Two players, Row and Column, are driving toward each other on a one-lane road. Each
player chooses simultaneously between going straight (S), swerving left (L), and
swerving right (R). If one player goes straight while the other swerves, either right or left,
 the one who goes straight gets payoff 3 while the other gets –1. If each player swerves to
his left, or each swerves to his right, then each gets 0 (remember, they are going in
opposite directions). If both go straight, or if one swerves to his left while the other
swerves to his right, then the cars crash and each gets payoff –4.
i. Write the payoff matrix for this game.
ii. Find all the game's rationalizable strategies for each player
iii. Find all the game's Nash equilibria in pure strategies

18) The figure below is the game tree of a two-player game; the first player is the maximizer
and the second player is the minimizer. Use the tree to answer the following questions:

(a) What is the final value of this game?

Consider running the alpha-beta pruning algorithm on this game tree.

(b) Is the final value of beta at the root node (after all children have been visited) +1? (T/F)
(c) What is the final value of beta at the node labeled P (after all of P’s children have been
visited)? Suppose we are in the middle of running the algorithm. The algorithm has just reached
the node labeled Q. The value of alpha is 5 and the value of beta is +1.
(d) Will any nodes be pruned?
(e) What value will Q return to its parent?

19) Consider the game tree picture below where A-F r epresents some real values. Assume the
R

nodes are explored from left to right and standard alpha beta pruning is used.
a)Give a value of A such that B is pruned
b)Give a value of A such that B is not pruned
c)There are some values of A and B such that the subtree containing C and D is pruned. Is this
statement True or False
d)Assuming that B=5 and A=5, give a value of C and D such that the subtree containing E and F
is pruned