lOMoARcPSD|16125549

CT 2 Batch 2 set A(313)-Ans key

Artificial Intelligence (SRM Institute of Science and Technology)

Scan to open on Studocu

Studocu is not sponsored or endorsed by any college or university

Downloaded by KRRISH BHALODIYA (RA2111027010111) ([email protected])
 lOMoARcPSD|16125549

BATCH 2 SET-A
SRM Institute of Science and Technology
Mode of Exam
Faculty of Engineering and Technology
OFFLINE
School of Computing
SRM Nagar, Kattankulathur – 603203, Chengalpattu District, Tamilnadu
Academic Year: 2021-2022 EVEN

REG.N
O
Test: CLAT- 2 Date: 31-03-2022
Course Code & Title: 18CSC305J & Artificial Intelligence Duration: 2 Periods
Year & Sem: III &VI Max. Marks: 50

Course Articulation Matrix: (to be placed)

S.No. Course PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
Outcome

1 CO1 M M M M H M L H

2 CO2 M H H H H M L H

3 CO3 M H H M H M L H

4 CO4 M H M H H M L H

5 CO5 M H H H H M L H

6 CO6. L H M M H H L H

ANSWER ALL QUESTIONS Part – A (20 x 1 = 20 Marks)

Q. Question Marks BL CO PO PI
No Code
1 Select the functionality which is used for avoiding the local optimum 1 1 2 1 1.3.1

a) Cross over
b) Mutation
c) Recombination
d) Reproduction
2 The type of search the result depends on the players which will decide 1 2 2 1 1.3.1
the final result

a) Normal Search
b) Adversarial Search
c) Linear Search
d) Sequential Search

3 Time complexity of Min Max Algorithm is 1 2 2 1 1.3.1

a) O(bd )
b) O(an)
c) O(Abc)
d) O(ab)

Downloaded by KRRISH BHALODIYA (RA2111027010111) ([email protected])

 lOMoARcPSD|16125549

4 Select the Algorithm where less exploring nodes of search tree are 1 1 2 1 1.3.1
performed

a) MIN MAX Algorithm

b) Alpha beta Pruning
c) Depth First Search
d) Breadth First Search
5 Choose the correct example for a Simultaneous and Sequential game 1 1 2 2 1.3.1
a) Chess game
b) Board game
c) Cards game
d) Carom game
6 Queue structure is used in ___ 1 1 2 1 1.3.1
a) Breadth First Search
b) Depth First Search
c) Polynomial addition
Recursion
7 Which search algorithm imposes a fixed depth limit on nodes? 1 2 2 1 1.3.1

a) Breadth First Search

b) Depth First Search
c) Depth limited search
d) Bidirectional search
8 The data structure used to implement DFS is_________ . 1 2 2 1 1.3.1
a) Stack
b) Queue
c) Priority Queue
d) Circular Queue
9 DFS always expands the ___ node in the current fringe of the search 1 2 2 2 2.2.3
tree

a) Shallowest
b) Child node
c) Deepest
d) Minimum cost
10 ______________ combines the small memory footprint of DFS and 1 2 2 2 2.2.3
has the completeness guarantee of BFS

a) Iterative Deepening search

b) Depth Limited Search
c) Uniform cost search
d) None of the above
11 Fuzzy Logic is represented ____ 1 2 3 2 2.2.3
a. as IF-THEN-ELSE rules
b. as IF-THEN rules
c. Both as IF-THEN-ELSE rules and as IF-THEN rules
d. Nested if
12 Fuzzy Set theory de昀椀nes which of the following fuzzy operators? 1 1 3 2 2.2.3
a. AND operator
b. OR operator
c. NOT operator
d. All of these
13 When Bel(A) denotes Belief of event A, then according to Dempster 1 2 3 2 2.2.3
Sha昀昀er Theory ( DST) :
a. Bel(A) + Bel (~A) <= 1

Downloaded by KRRISH BHALODIYA (RA2111027010111) ([email protected])

 lOMoARcPSD|16125549

b. Bel(A) + Bel (~A) = 1

c. Bel(A) + Bel (~A) >= 1
d. Bel(A) + Bel (~A) = 0
14 Uncertainty is a gap between 1 1 3 1 1.3.1
a. Belief and disbelief
b. Belief and Plausibility
c. Belief and Available evidences
d. Belief and assump琀椀ons
15 The values of the set membership is represented ____________ 1 3 3 2 2.2.3
a. by Discrete Set
b. by Probabili琀椀es
c. by Degree of truth
d. Both by Degree of truth and Probabili琀椀es
16 Which of the following logic is the form of Fuzzy logic? 1 2 3 1 1.3.1
a. Two-valued logic
b. Crisp set logic
c. Binary set logic
d. Many-valued logic
17 Default logic is an extension of ______________ 1 1 3 2 2.2.3
a. Proposi琀椀onal logic
b. First order logic
c. classical logic
d. Fuzzy logic

18 Non-Monotonic logic is an extension of ______________ 1 2 3 2 2.2.3

a. Proposi琀椀onal logic
b. First order logic
c. Boolean logic
d. Fuzzy logic
19 Given A � D, (C,D) � F, (F,B) � Z, What is the 1 1 3 1 1.3.1
model of reasoning system followed in this
昀椀gure?
a. Induc琀椀ve reasoning
b. Deduc琀椀ve reasoning
c. Forward reasoning
d. Backward reasoning

20 Bayes Theorem is 1 2 3 1 1.3.1

a. way of calcula琀椀ng a condi琀椀onal probability without the joint
probability.
b. way of calcula琀椀ng a condi琀椀onal probability with the joint
probability.
c. way of calcula琀椀ng a condi琀椀onal probability without the
marginal probability.
d. way of calcula琀椀ng a condi琀椀onal probability with the marginal
probability.

Part – B
( 4 x 5 = 20 Marks) Answer ALL the Questions
21 Derive a solution for the following graph using iterative 5 1 2 2 2.4.1
deepening DFS algorithm.

Downloaded by KRRISH BHALODIYA (RA2111027010111) ([email protected])

 lOMoARcPSD|16125549

Ans:

22 Discuss the basic concepts and heuristics involved in A* search 5 1 2 2 2.4.1

algorithm.

Ans:

Definition—---1 Mark
Concepts—----1 Mark
Heuristics—---1 Mark
Example—-----2 Marks

23 Define Fuzzy logic, Fuzzy sets and basic operations in Fuzzy 5 2 3 2 2.4.1
logic

Definition—---1 Mark
Fuzzy sets —----2 Mark
Basic Operations — 2 Marks

24 Use the following facts and prove the goal: You are not 5 3 3 2 2.4.1
swimming

(1) If you go swimming you will get wet.

(2) If it is raining and you are outside then you will get wet.
(3) If it is warm and there is no rain then it is a pleasant day.
(4) You are not wet.
(5) You are outside.
(6) It is a warm day.

Ans:

Step 1: Propositional Logic [1]

Downloaded by KRRISH BHALODIYA (RA2111027010111) ([email protected])

 lOMoARcPSD|16125549

● (1) swimming ⇒ wet

● (2) ( rain ∧ outside ) ⇒ wet
● (3) ( warm ∧ ~ rain ) ⇒ pleasant
● (4) ~ wet
● (5) outside
● (6) warm

Step 2: CNF [2]

● (1) ( ~ swimming ∨ wet ) ∧

● (2) ( ~ rain ∨ ~ outside ∨ wet ) ∧
● (3) ( ~ warm ∨ rain ∨ pleasant ) ∧
● (4) ( ~ wet ) ∧
● (5) ( outside ) ∧
● (6) ( warm )

Step 3: Resolution [2]

Part – C
( 1 x 10 = 10 Marks) Answer any ONE question
25. a) Discuss about Alpha beta pruning with 10 3 2 1 1.3.1
appropriate example and specify the importance of the
same.
b) Illustrate the condition under which this Alpha
Beta pruning could be done.

Ans:

(a) Concept and importance—---3 Marks

Example with explanation—-5 Marks
(b) Condition—-----------------------2 Marks

Downloaded by KRRISH BHALODIYA (RA2111027010111) ([email protected])

 lOMoARcPSD|16125549

α>=β
Alpha beta pruning works on 2 threshold values α and β
–α: It is the best highest value, a MAX player can have.
It is the lower bound, which represents negative infinity
value.
–β: It is the best lowest value, a MIN player can have. It
is the upper bound which represents positive infinity.

26. a) State Dempster Shafer theory with an Example. 10 3 3 1 1.3.1

Ans:

Concept : 4
Example : 4

b) Justify how this theory can be used in uncertain

knowledge reasoning process.

Justification : 2

Downloaded by KRRISH BHALODIYA (RA2111027010111) ([email protected])