Fundamentals of Artificial Intelligence Week 3 Answers
Are you looking for Fundamentals of Artificial Intelligence Week 3 Answers? All weeks solutions of this Swayam course are available here.
Table of Contents
Fundamentals of Artificial Intelligence Week 3 Answers (July-Dec 2025)
Course link: Click here to visit course on Nptel Website
Question 1. The AO algorithm can best be seen as the following TWO major operations:
a) 1. Top-down: graph-growing; 2. Bottom-up: cost-revising, SOLVE-labelling.
b) 1. Bottom-up: graph-growing; 2. Top-down: cost-revising, SOLVE-labelling.
c) 1. Top-down: graph-growing, SOLVE-labelling; 2. Bottom-up: cost-revising.
d) 1. Bottom-up: graph-growing, SOLVE-labelling; 2. Top-down: cost-revising.
Question 2. For more complex games, such as chess or checker the AND/OR search to termination is out of question. Which of the following statements are true?
- Our goal in searching such a game tree might be, instead, merely to find a good first move.
- Extract from the search graph an estimate of the ‘best’ first move.**
a) Both 1 and 2.
b) Only 2
c) Only 1
d) Both 1 and 2 are false.
Question 3. Which of the following statements are true for searching an AND-OR graph?
I. To find a solution in an AND-OR graph we need an algorithm similar to best-first search; but with the ability to handle the AND arc appropriately.
II. Algorithm should find a path from the start node to a set of nodes representing the solution states.
a) Both I and II
b) Neither I nor II
c) I Only
d) II Only
Question 4. In the pay-off matrix of a zero-sum game, an outcome is __________ if the outcome is a minimum in its row and maximum in its column.
a) a critical point
b) an inflexion point
c) a saddle point
d) a stable point
Question 5. Assertion A: Search procedure for Minimax that we have discussed is grossly inefficient strategy.
Reason R: The search procedure separates completely the processes of search-tree generation and position evaluation.
Mark the correct choice as
a) Both A and R are true and R is the correct explanation for A
b) Both A and R are true but R is not the correct explanation for A
c) A is True but R is False
d) A is false but R is True
Question 6. Start at C. Descent to full-ply depth. Back-up values as appropriate. The alpha value at node C after traversal of the leftmost branch is ______________.
a) 5
b) 3
c) 0
d) 2
These are Fundamentals of Artificial Intelligence Week 3 Answers
Question 7. Applying alpha-beta pruning as appropriate, cut-off search below node B as shown is _______________.
a) alpha pruning
b) beta pruning
c) incorrectly pruned
d) deep pruning
Question 8. Applying alpha-beta pruning as appropriate, cut-off search below node D as shown is _______________.
a) alpha pruning
b) beta pruning
c) incorrectly pruned
d) deep pruning
Question 9. Start at C. Descend to full-ply depth. Back up the values as appropriate. The beta value at node E is _______.
a) 5
b) 3
c) 0
d) 2
Question 10. Descending to C’s great grandchildren along the middle branch in a depth-first fashion, search below node D is pruned. This is because no matter what happens on its right branch the value of node D cannot be greater than ________.
a) 5
b) 3
c) 0
d) 2
These are Fundamentals of Artificial Intelligence Week 3 Answers