# NPTEL An Introduction to Artificial Intelligence Assignment 3 Answers 2023

Hello NPTEL Learners, In this article, you will find NPTEL An Introduction to Artificial Intelligence Assignment 3 Week 3 Answers 2023. All the Answers are provided below to help the students as a reference don’t straight away look for the solutions, first try to solve the questions by yourself. If you find any difficulty, then look for the solutions.

###### NPTEL An Introduction to Artificial Intelligence Assignment 4 Answers 2023 Join Group👇

Note: We are trying to give our best so please share with your friends also.

## NPTEL An Introduction to Artificial Intelligence Assignment 3 Answers 2023:

#### Q.2. Which of the following evaluation functions will result in identical behaviour to greedy best-first search (assume all edge costs are positive)?

• a.f(n) = 100 * h(n)
• b. f(n) = g(n) * h(n)
• c. f(n) = h(n)^2
• d. f(n) = 1 / h(n)

#### Q.3. Consider the following directed graph, having A as the starting node and G as the goal node, with edge costs as mentioned, and the heuristic values for the nodes are given as – {h(A)=8, h(B)=7, h(C)=6, h(D)=5, h(E)=4, h(F)=2, h(G)=0}:

Which of the following is correct regarding heuristic function h?

• b. It is not admissible
• c. It is consistent
• d. It is not consistent

#### Q.4. Which of the following statements are true (assume all edge costs are positive)?

• a. h(n) = 0 is always a consistent heuristic function
• b. Manhattan distance is an admissible heuristic for the problem of moving a rook from any square on a chessboard to another square in the smallest number of moves
• c. Depth First Search can never terminate faster than A* search with an admissible heuristic
• d. Straight line distance is an admissible heuristic for the problem of moving from one city to another by covering the smallest distance

#### Q.5.In the directed graph given below, with edge weights as cost of those edges, and heuristic values of node written in red, TREE-SEARCH A* search is performed on the graph with the starting node “0” and one goal node “4” (node numbers are written inside the nodes). Consider the two sub cases: a) ties in selecting node for expansion from the fringe are resolved by choosing the node with the LARGER index b) ties in selecting node for expansion from the fringe are resolved by choosing the node with the SMALLER index. Which of the following are correct statements?

• a. In the first case, 5 node expansions are performed in the search.
• b. In the second case, node with the index 7 is expanded twice.
• c. The cost of path to the goal is different in the above two cases.
• d. Number of nodes in the optimal path from the start node to the goal is same for both the cases above.

#### Q.6. Which of the following is(are) correct?

• a. An inadmissible heuristic might be consistent.
• b. An inconsistent heuristic might be admissible.
• c. If the heuristic is consistent, A* using TREE-SEARCH is optimal.
• d. If the heuristic is consistent, A* using GRAPH-SEARCH is optimal.

#### Q.7. Consider the following directed graph.

The heuristic function for the nodes is defined as h(A) = 15, h(B) = 10, h(C) = 12, h(D) = 7, h(E) = 10, h(F) = 6, h(G) = 4, h(H) = 0. The start node is A and the goal node is H. Assume that ties in selecting node for expansion from the fringe are resolved by choosing the alphabetically smaller node. Which of the following statements are correct?

• a. The optimal path has cost 10.
• b. GRAPH-SEARCH A* results in a path with optimal cost.
• c. TREE-SEARCH A* results in a path with optimal cost.
• d. The heuristic is admissible.

#### Q.8. Suppose there are two admissible heuristics h1 and h2 for some problem, which of the following are correct?

• a. max(h1,h2) is an admissible heuristic.
• b. max(h1,h2) dominates h1 and h2
• c. min(h1,h2) is an admissible heuristic.
• d. min(h1,h2) dominates h1 and h2

#### Q.9. Which of the following algorithms are guaranteed to be complete and optimal? (Assume positive edge costs greater than 1)

• a. Depth-first search
• b. GRAPH-SEARCH A* with zero heuristic
• c. Uniform Cost Search
• d. GRAPH-SEARCH A* with admissible heuristic

#### Q.10.We want to sort an array of n distinct integers using A* search. The start state is a random permutation of the integers. The expansion function applied on a given state yields all permutations that can be achieved by swapping one pair of different numbers in the original state with all edge costs as 1. There is one goal state: the sorted array. Let S(p) be the number of elements of the array p that are not in the position they are supposed to be in the sorted array. Which of the following are admissible heuristics for this problem?

• a. S(p)
• b. S(p)/2
• c. S(p)/3
• d. 0
##### NPTEL An Introduction to Artificial Intelligence Assignment 2 Answers Join Group👇

Disclaimer: This answer is provided by us only for discussion purpose if any answer will be getting wrong don’t blame us. If any doubt or suggestions regarding any question kindly comment. The solution is provided by Chase2learn. This tutorial is only for Discussion and Learning purpose.

#### About NPTEL An Introduction to Artificial Intelligence 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. This 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.

##### Course Outcome:
• Week 1  :Introduction: Philosophy of AI, Definitions
• Week 2  :Modeling a Problem as Search Problem, Uninformed Search
• Week 3 :Heuristic Search, Domain Relaxations
• Week 4  :Local Search, Genetic Algorithms
• Week 6  :Constraint Satisfaction
• Week 7  :Propositional Logic & Satisfiability
• Week 8  :Uncertainty in AI, Bayesian Networks
• Week 9  :Bayesian Networks Learning & Inference, Decision Theory
• Week 10:Markov Decision Processes
• Week 11:Reinforcement Learning
• Week 12:Introduction to Deep Learning & Deep RL
###### CRITERIA TO GET A CERTIFICATE:

Average assignment score = 25% of average of best 8 assignments out of the total 12 assignments given in the course.
Exam score = 75% of the proctored certification exam score out of 100

Final score = Average assignment score + Exam score

YOU WILL BE ELIGIBLE FOR A CERTIFICATE ONLY IF AVERAGE ASSIGNMENT SCORE >=10/25 AND EXAM SCORE >= 30/75. If one of the 2 criteria is not met, you will not get the certificate even if the Final score >= 40/100.

If you have not registered for exam kindly register Through https://examform.nptel.ac.in/