Artificial Intelligence Concepts and Techniques Week 2 Answers

---

Artificial Intelligence Concepts and Techniques Week 2 Answers (July-Dec 2025)

Nptel Course link: Click here

---

Are you looking for Artificial Intelligence Concepts and Techniques Week 2 Answers? You’ve come to the right place! Access the latest and most accurate solutions for your Week 2 assignment in the Artificial Intelligence Concepts and Techniques course.

Question 1. If b is the branching factor and d is the depth of the search tree, the space complexity of BFS is
a) O(bd)
b) O(bd)
c) O(b)
d) O(d)

View Answer

---

Question 2. If b is the branching factor and m is the maximum depth of the search tree, what is the space complexity of breadth first search?
a) O(b)
b) O(m)
c) O(bm)
d) O(bm)

View Answer

---

Question 3. What is another name for blind search?
a) Informed search
b) Uninformed search
c) Greedy search
d) Heuristic search

View Answer

---

Question 4. Uniform cost search expands the node n with the _________
a) Highest path cost
b) Heuristic cost
c) Average path cost
d) Lowest path cost

View Answer

---

Question 5. Depth-first search always expands the ________ node among the leaf nodes of the search tree
a) Shallowest
b) Child node
c) Deepest node
d) Minimum cost node

View Answer

---

Question 6. Breadth-first search always expands the __________ node among the leaf nodes of the search tree
a) Shallowest
b) Child node
c) Deepest node
d) Minimum cost node

View Answer

---

Question 7. What search strategy is used for game-playing?
a) Linear search
b) Minimax search
c) Random search
d) None of these

View Answer

---

Question 8. The node chosen for expansion in the greedy search is the __________ node
a) Shallowest
b) Deepest
c) One estimated to be closest to goal
d) Minimum heuristic cost

View Answers

---

Question 9. What type of search algorithm is used in minimax search?
a) Hill-climbing search
b) Depth-first search
c) Breadth-first search
d) Local search

View Answers

---

Question 10. Which of the following search algorithm searches forward from initial state and backward from goal state till both meet to identify a common state?
a) Uniform cost strategy
b) Iterative deepening depth-first search strategy
c) Greedy search
d) Bidirectional search

View Answers

---

Click here to see all courses Nptel Assignment Answers

These are Artificial Intelligence Concepts and Techniques Week 2 Answers