Hello learners In this article we are going to discuss NPTEL An Introduction to Artificial Intelligence Assignment 2 Answers. All the Answers provided below to help the students as a reference, You must submit your assignment with your own knowledge and use this article as reference only.
About the course:-
The course introduces the variety of concepts in the field of artificial intelligence. It discusses the philosophy of AI, and how to model a new problem as an AI problem. It describes a variety of models such as search, logic, Bayes nets, and MDPs, which can be used to model a new problem. It also teaches many first algorithms to solve each formulation. The course prepares a student to take a variety of focused, advanced courses in various subfields of AI.
NPTEL An Introduction to Artificial Intelligence Assignment 2 Answers 2024:
1. Consider the Vacuum World Illustration as covered in the videos. Assume that now there are 3 rooms and 2 Roombas (autonomous robotic vacuum cleaners). Each room can be either dirty/clean and each Roomba is present in one of the 3 rooms.
What are the number of states in propositional/factored knowledge representation?
Answer :- 72
2. Which of the following is/are part of a node?
Answer :- a,b
3. Full duplicate detection can reduce the number of nodes to be visited from exponential to linear (in problem size).
Answer :- a
4. Start from state A. Goal state is G. The number over each edge indicates the cost to transition from one state to another. What is the order of nodes visited by BFS (including the start and goal state too)? Break any ties using lexicographic ordering and do not perform duplicate detection.
Answer :- ACBEDFG
5. Start from state A. Goal state is G. The number over each edge indicates the cost to transition from one state to another. What is the cost of the path given by BFS? Break any ties using lexicographic ordering and do not perform duplicate detection.
Answer :- 32
6. What is the order of nodes visited by IDDFS (Iterative-deepening depth-first search)? Start from A, Goal State is E, break any ties using lexicographic ordering, and no duplicate detection.
Answer :- ACBDFE
7. Which of the following problems is typically not modelled as a search problem?
Answer :- c
8. Which of the following is/are true for a search tree with a finite branching factor and all costs greater than one?
Answer :- b,c
9. Suppose there is only one goal state and each step cost is k (k>0, k is constant). Which of the following search algorithm(s) will return the optimal path?
Answer :- c
10. Which of the following is/are false regarding search? The maximum branching factor of the search tree is finite and is represented by b, d is the depth of the least cost solution and m is the maximum depth of the search-space
Answer :- a,b,c
