Scribd
Upload
13 views

AI_END_TERM

The document outlines an end-term examination for an Artificial Intelligence course, consisting of various questions related to search algorithms, game trees, logical propositions, and first-order logic. Students are instructed to provide handwritten answers, with specific requirements for each question regarding node expansion, tree evaluation, and logical analysis. The exam is closed book, with a maximum duration of 3 hours and a total of 40 marks available.

Uploaded by

johndoeatexl010101
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
13 views

AI_END_TERM

The document outlines an end-term examination for an Artificial Intelligence course, consisting of various questions related to search algorithms, game trees, logical propositions, and first-order logic. Students are instructed to provide handwritten answers, with specific requirements for each question regarding node expansion, tree evaluation, and logical analysis. The exam is closed book, with a maximum duration of 3 hours and a total of 40 marks available.

Uploaded by

johndoeatexl010101
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

END-TERM EXAMINATION

ARTIFICIAL INTELLIGENCE

Max Duration: 3 hours Max Marks: 40

Instructions:
 This is a closed book exam.
 Ensure neatness, crispness, and relevance.
 Answers must be handwritten.
 In case you need to make any assumption(s), clearly write.

Q1. The map below indicates paths (along with the efforts/costs) to a hidden treasure. There
is treasure on two different islands (so, we have to reach any one of them).

A is the island where we are currently, and the shaded red states are the locations of the treasure.
Arrows encode possible actions from each island, and numbers by the arrows represent action
costs. Note that arrows are directed; for example, A → C is a valid action, but C → A is not.
Numbers shown in diamonds are heuristic values giving an estimate cost from the given island
to a treasure.

Run each of the following search algorithms and write the following for each of the search
methods (ties (if any) should be resolved alphabetically):
 The nodes that are expanded during the course of the search
 The final path returned and the corresponding cost of the final path, wherever
applicable.
a) Depth-First Search (1+2)
b) Breadth-First Search (1+2)
c) Uniform-Cost Search (1+2)
d) Best first search (1+2)
(4*3 = 12)

1 of 3
Q2. Consider the following game tree, where the blue triangle node is a maximizer, and each
green circle node is a chance node. The numbers at the bottom represents the return
(reward/loss value) and those (decimal nos) on the edges indicate the weight of the return
(example: if return is 100 but its weight is 0.2, then effective value is 20).

(a) In this light, visit nodes from left to right, and evaluate the value of each of the triangle
and circle nodes. Indicate this value inside respective node, redrawing the tree in your
answer-script. (3)

(b) Considering possibility of unlimited rewards/losses, redraw the tree after pruning those
nodes that were not necessary to explore. (3)

(c) Consider that the rewards are bounded in the interval [-20, 20]. With this information, if
there is any change in pruned nodes. If no, give reasons. If yes, show the pruned tree in
this scenario. (3)

Q3. For each of the following questions, answer true or false; along with a justification for
the answer. You need to also include illustration / example / counterexample, whatever
applicable.
(a)Depth-first search always expands at least as many nodes as A∗ search with an
admissible heuristic. (1+2)

(b) Assume that for a single move, a rook can move any number of squares on a chessboard
in a straight line, either vertically or horizontally, but cannot jump over other pieces.
Manhattan distance is an admissible heuristic for the smallest number of moves to move
the rook from square A to square B. (1 + 2)

2 of 3
Q4. Examine each of the following propositions and determine if it is a
contradiction/tautology/neither contradiction nor tautology. It is mandatory to write the
detailed steps to reach your answer.

a) (𝐴 ∨ ~𝐵)⋀(~𝐴 ∨ 𝐵)⋀(~𝐴 ∨ ~𝐵) (3)


b) (𝐴 → 𝐵)⋀(𝐴 → ~𝐵)⋀(~𝐴 → 𝐵)⋀(~𝐴 → ~𝐵) (3)
c) ((𝐴 → 𝐵) ⋀(𝐶 → 𝐵) ∧ 𝐶) → 𝐵 (3)

Q5. Write the first order logic for the following:

(a) Some individuals are happy at any of the times. (2)


(b) At some of the times, all individuals are happy. (2)

3 of 3

You might also like