Home / Nptel Assignment Answers 2025 / An Introduction to Artificial Intelligence / An Introduction to Artificial Intelligence | Week 5 How can we help

lp you? 

Related
An Introduction to
NPTEL ASSIGNMENT ANSWERS 2025
Artificial Intelligence |
An Introduction to Artificial Intelligence
 13
Week 5
 An Introduction to Artificial Intelligence | Week 12

 An Introduction to Artificial Intelligence | Week 11

Session: JAN-APR 2024
 An Introduction to Artificial Intelligence | Week 10 Course name: An Introduction to Artificial Intelligence
 An Introduction to Artificial Intelligence | Week 9 Course Link: Click Here
 An Introduction to Artificial Intelligence | Week 8
For answers or latest updates join our telegram channel:
 An Introduction to Artificial Intelligence | Week 7 Click here to join

 An Introduction to Artificial Intelligence | Week 6 These are An Introduction to Artificial Intelligence

Answers Week 5
 An Introduction to Artificial Intelligence | Week 5

 An Introduction to Artificial Intelligence | Week 4

Q1. Select the CORRECT statements –
 An Introduction to Artificial Intelligence | Week 3
With perfect ordering, alpha-beta pruning reduces
the time complexity from O(b^m) to O(bm/2)
 An Introduction to Programming Through C++ 7
With perfect ordering, alpha-beta pruning
Artificial Intelligence Search Methods For 2 increases the depth that can be searched in same

Problem Solving time T from d to d^2.
Without alpha-beta pruning, the time complexity of
 Blockchain and its Applications 13 search for depth m follows T(m) = b.T(m-1) + c
With perfect ordering in alpha-beta pruning, the
 C Programming And Assembly Language 1
time complexity of search for depth m follows T(m)
Cloud Computing 22 = T(m-1) + (b-2)T(m-2) + c


Computer Architecture Nptel 9

Answer: A, C


 Computer Graphics 7
Q2. Consider the following game tree. A is the maximizer
 Cyber Security and Privacy 22
node and D is the minimizer node. Chance node B
Data Base Management System 16 chooses left action with probability p = 0.4 and right

action with p = 0.6. Chance node C chooses left action
 Data Science for Engineers 11 with p = 0.7 and right action with p = 0.3. What will be the
value at node A if we use expectiminimax to make
 Data Structure And Algorithms Using Java 7
decisions?
 Deep Learning 21
Answer: 4.2
 Deep Learning for Computer Vision 8

 Developing Soft Skills and Personality 9 For answers or latest updates join our telegram channel:
Click here to join
 Digital Circuits 8
 Discrete Mathematics 14 These are An Introduction to Artificial Intelligence

× Answers Week 5
 Electric Vehicles 5

 Ethical Hacking 22
Q3. Consider the same game tree. Now we have the prior
 Introduction To Industry 4.0 And Industrial 22 information that all internal nodes have utility values in
Internet Of Things the range 1-10. Is it possible to perform any pruning?
Answer the number of nodes of type D that can be
 Introduction To Internet Of Things 21
pruned. (Answer 0 if you think no pruning can be done)
 Introduction To Machine Learning 36
Answer: 1
 Introduction to Operating Systems 17

 Introduction To Programming In C 9 Q4. Consider the given adversarial search tree. Assume
that the search always chooses children from left to
 Leadership and Team Effectiveness 12
right. The search tree uses alpha-beta pruning.
 Machine Learning and Deep Learning - 4 Which of the following nodes are pruned during the
Fundamentals and Applications search?
J
 Multi-Core Computer Architecture 13
K
 Principles of Managements 13 L
M
 Probability And Statistics 13 N
O
 Problem Solving Through Programming In C 19
Answer: K, N, O
 Programming Data Structure And Algorithms 12
Using Python

 Programming In Java 21 For answers or latest updates join our telegram channel:
Programming in Modern C++ 20
Click here to join


Python for Data Science 9

These are An Introduction to Artificial Intelligence

Answers Week 5
 Quantum Mechanics 1 12

 Social Networks 13
Q5. What is the final value at node A?(from the above
Soft Skills 9 figure)


Soft Skills Development 19 Answer: 23



 Software Engineering 7
Q6. Define score of white as s(p, “white”) = 1 * n(white
 Software Testing 13
pawn) + 2 * n(white knight) + 3 * n(white bishop) + 4 *
 The Joy of Computing Using Python 23 n(white rook) + 5 * n(white queen), where n(x) is number of
pieces of type x on the board. Similarly, define the score
 Theory of Computation 8 of black. The utility of white f(p) is defined as score(p,
“white”) – score(p, “black”). Calculate f(p) for white.

Answer: -9
Popular
Time Management and ways of Thinking
For answers or latest updates join our telegram channel:
Time Management Fundamentals Final Exam
Click here to join

These are An Introduction to Artificial Intelligence

Answers Week 5
Entrepreneurship
Q7. Which of the following is/are true regarding the
Entrenerprenaurship Foundations Linkedin basic mini-max adversarial search algorithm?
Learning It is complete if the search tree is finite
It is optimal for all kinds of adversaries
Academic Paper Writing and IPR, Design Thinking and Creativity for Innovation, The worst-case time complexity and space complexity is
Team Skills
similar to that of Depth First Search
Thinking Creatively Quiz
By itself, it cannot play games like Chess and Go due to
huge search depths.
Team Skills
Teamwork Foundations See also An Introduction to Artificial Intelligence |
Week 3
Team Skills
Effective Listening Answer: A, C, D

Design Thinking and Creativity for Innovation

Design Thinking Data Intelligence Q8. Which of the following is/are false regarding the
alpha-beta pruning for the mini-max search algorithm?
It can potentially lead to suboptimal solutions compared to
Cloud Computing
mini-max search without any pruning
Cloud Computing | Week 1 It is guaranteed to improve the running time in-comparison
to the mini-max search without any pruning
Design Thinking and Creativity for Innovation The order in which nodes are visited affects the amount of
Agile Foundations pruning
If the successors of a node are chosen randomly, the time
complexity (on average) is O(b3m/4)
Academic Paper Writing and IPR
Business Writing Principles Answer: A, B

Time Management and ways of Thinking

Time Management Fundamentals For answers or latest updates join our telegram channel:
Click here to join

These are An Introduction to Artificial Intelligence

Answers Week 5

Q9. Which of the following techniques were used by

Deep Blue for beating Garry Kasparov in the game of
chess ?
Opening and Endgame stage databases
A version of mini-max search algorithm
Neural Networks for computing Heuristic Functions
Monte Carlo Tree Search algorithm

Answer: A, B

Q10. Which of the following is/are true for heuristic

functions in the context of adversarial search ?
They can be learnt from data/experience for eg. by playing
games with another agent
They help deal with the problem of extremely large search
depths in practice
They help reduce the worst-case time complexity of
minimax search without comprising optimality against
optimal adversaries
They can be hand-engineered by humans/experts

Answer: A, B, D

Q11. What will be the value of the node labelled ‘a’ after
the run of the min-max search algorithm on the following
search tree. Here upwards facing triangles are max
nodes, downward facing triangles are min nodes and
circles denote game-ends.

Answer: 32

For answers or latest updates join our telegram channel:

Click here to join

These are An Introduction to Artificial Intelligence

Answers Week 5

More Weeks of An Introduction to Artificial Intelligence:

Click here

More Nptel Courses: https://progiez.com/nptel-

assignment-answers

Course Name: An Introduction to Artificial Intelligence

Course Link: Click Here

These are An Introduction to Artificial Intelligence

Answers Week 5

Q1. Which of the following statements are true in

the context of alpha-beta pruning?
a. The effectiveness of alpha-beta pruning depends
on the order of moves encountered during the
search
b. A node is pruned if beta >= alpha at one of it’s
parents
c. A node is pruned if alpha >= beta at one of it’s
parents
d. Alpha-beta pruning can result in a different root
value from full minimax search
Answer: a, c

See also An Introduction to Artificial Intelligence |

Week 4

These are An Introduction to Artificial Intelligence

Answers Week 5
Q2. The next three questions will involve the following
search tree. The value of the leaf nodes are annotated
below the node in the diagram.

What is the backed-up value at the root node after

minimax search?

Answer: 20

These are An Introduction to Artificial Intelligence

Answers Week 5

Q3. Assume that the successors are expanded from left

to right. What is the number of nodes (including leaf
nodes) pruned by alpha-beta pruning?

Answer: 12

These are An Introduction to Artificial Intelligence

Answers Week 5

Q4. Assume that the successors are expanded from right

to left. What is the number of nodes (including leaf
nodes) pruned by alpha-beta pruning?

Answer: 3

These are An Introduction to Artificial Intelligence

Answers Week 5

Q5. Which of the following is true regarding fixed depth

search and the horizon effect?
a. Continuing the search at non-quiescent positions can
mitigate the horizon effect
b. Stopping the search at non-quiescent positions can
mitigate the horizon effect
c. It can lead to choosing moves with short-term benefits,
but catastrophe in the long term
d. It can result in ignoring moves that do not have
immediate benefits, but can lead to victory in the long term
Answer: a, c, d

These are An Introduction to Artificial Intelligence

Answers Week 5

Q6. Which of the following games are deterministic?

a. Backgammon
b. Go
c. Bridge
d. Othello

Answer: b, d

These are An Introduction to Artificial Intelligence

Answers Week 5

For Questions 7 to 10 –

Aman and Bharat are two friends. Aman is planning an

ice-cream treat. They are not able to decide the location,
brand and the flavour to be purchased. Therefore, they
come up with the following idea: First, Aman gets to
choose the location between Hauz Khas and Connaught
Place, then Bharat chooses the brand between Giani’s
and Nirula’s and then the flavour is chosen uniformly
randomly between chocolate and vanilla. The table
below lists the cost of each ice-cream in rupees for a
particular location, brand and flavour.

Additionally, Aman wants to get by with spending as less

money as possible, while Bharat wants to get the most
expensive treat he can get out of Aman, both in
expectation. Let’s model this as a minimax tree with
chance nodes and run expecti-minimax search.

See also An Introduction to Artificial Intelligence |

Week 11

These are An Introduction to Artificial Intelligence

Answers Week 5

Q7. If both Aman and Bharat choose optimally and

selfishly, which of the following statements are correct?
a. They go to the location Connaught Place.
b. They buy from the brand Nirula’s.
c. They go to the location Hauz Khas.
d. They buy from the brand Giani’s

Answer: a, d

These are An Introduction to Artificial Intelligence

Answers Week 5

Q8. If both the players play optimally, determine the

expected expenditure in rupees.

Answer: 40

These are An Introduction to Artificial Intelligence

Answers Week 5

Q9. Which of the following statements are true for the

expecti-minimax tree and alpha beta pruning for the
problem?
a. There are 4 chance nodes in the expecti-minimax tree.
b. Some nodes get pruned even if alpha beta pruning is
employed with the worst possible node ordering
c. Some nodes get pruned if alpha beta pruning is
employed with the best possible node ordering.
d. The choice of location and brand depends upon the
order of nodes explored.

Answer: a, c

These are An Introduction to Artificial Intelligence

Answers Week 5

Q10. Suppose the order of decisions is changed as

follows: First Bharat chooses the brand between Giani’s
and Nirula’s, then Aman gets to choose the location
between Hauz Khas and Connaught Place, and then the
flavour is chosen uniformly randomly between chocolate
and vanilla. If both decide optimally, which of the
following statement is correct about the new expected
expenditure(E’) compared to the expected expenditure in
the original case(E)?
a. E’ = E
b. E’ > E
c. E’ < E
d. Cannot be determined

Answer: c. E’ < E
These are An Introduction to Artificial Intelligence
Answers Week 5

More Solutions of An Introduction to Artificial Intelligence:

Click Here

More NPTEL Solutions: https://progiez.com/nptel-

assignment-answers/

Similar:

An Introduction to Artificial An Introduction to Artificial

Intelligence | Week 2 Intelligence | Week 3

An Introduction to Artificial An Introduction to Artificial

Intelligence | Week 4 Intelligence | Week 6

An Introduction to Artificial An Introduction to Artificial

Intelligence | Week 11 Intelligence | Week 9

An Introduction to Artificial An Introduction to Artificial

Intelligence | Week 10 Intelligence | Week 7

An Introduction to Artificial An Introduction to Artificial

Intelligence | Week 1 Intelligence | Week 8
© 2024 Progiez - Making Your Programming Easy