Are you looking for the Answers to **NPTEL An Introduction to Artificial Intelligence Assignment 3? **This article will help you with the answer to the **Nation**** al Programme on Technology Enhanced Learning (NPTEL)** Course “

**“**

**An Introduction to Artificial Intelligence Assignment 3**#### 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.

## CRITERIA TO GET A CERTIFICATE

Average assignment score = 25% of the 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 THE 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.**

** Below you can find the answers for An Introduction to Artificial Intelligence Assignment 3 2023**

## An Introduction to Artificial Intelligence Assignment 3 Answers:-

**Q1.** Consider the undirected graph below. Cost for each edge is written adjacent to the edge. S is the start node and G is the goal node. The TREE-SEARCH version of A* SEARCH is performed on this undirected graph. Assume that the heuristic function h for a node is the least number of edges required to reach G from that node. For example, h(A) =2 since we can reach G from A by the path ABG. However, h(S) is defined as 0. Find the order of exploration of states. Ties are broken in the order GSABC.

(Write the answer as a capitalized string with no spaces. For example, if the order of exploration is A followed by B followed by A followed by D then write ABAD. Include the goal state in the answer)

**Answer:-** **GSBCAG**

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

**Answer:-** **a.f(n) = 100 * h(n)**

**Q3.** **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}:**

**Answer:-** **a, d**

**Q4.** **Which of the following statements are true (assume all edge costs are positive)?**

**Answer:-** **a, d**

**Next Week Answers: Assignment 04**

**Q5.** **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?**

**Answer:-** **a, b, c, d**

**Q6.** **Which of the following is(are) correct?**

**Answer:-** **b, c, d**

**If there are any changes in answers will notify you on telegram so you can get 100% score, So Join**

**Q7.** **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?**

**Answer:-** **a, d**

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

**Answer:-** **a, b, c**

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

**Answer:-** **c, d**

**Q10.** **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?**

**Answer:- a, b, d**

**For other courses answers:- Visit**

**For Internship and job updates:- Visit **

**Disclaimer:** We do not claim 100% surety of answers, these answers are based on our sole knowledge, and by posting these answers we are just trying to help students, so we urge do your assignment on your own.

if you have any suggestions then comment below or contact us at [email protected]

If you found this article Interesting and helpful, don’t forget to share it with your friends to get this information.