# NPTEL An Introduction to Artificial Intelligence Assignment 4 Answers 2022

Are you looking for the Answers to NPTEL An Introduction to Artificial Intelligence Assignment 4 – IIT Delhi? This article will help you with the answer to the National Programme on Technology Enhanced Learning (NPTEL) Course “NPTEL An Introduction to Artificial Intelligence Assignment 4

## What is An Introduction to Artificial Intelligence?

An Introduction to Artificial Intelligence by IIT Delhi 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.

## 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 NPTEL An Introduction to Artificial Intelligence Assignment 4

## NPTEL An Introduction to Artificial Intelligence Assignment 4 Answers:-

Q1. Which of the following algorithms is asymptotically complete?

Q2. Genetic algorithms are said to jump from one hill to another. Which of the following is responsible for such behavior?

Q3. Mona was doing a Hill Climbing procedure to solve a problem. She observed that her procedure often gets stuck in plateaus.. Which of the following additions to the procedure would you recommend to her?

Q4. Which of the following is/are true about local search algorithms?

???? Next Week Answers: Assignment 05 ????

Q5. Fischl wishes to solve the 8-queens problem using Hill climbing with random restarts and with no sideway moves allowed. It is known that the probability of a successful run of the hill climb algorithm on this problem is 0.14. On average, how many restarts should she expect? (Round off your answer to the closest integer)

Q6. The famous FF planner uses which of the following algorithms?

Q7. Gradient descent is guaranteed to converge for strictly convex functions assuming the step size λ is sufficiently small. Assume that we have the function y = x2. For what values of λ, will gradient descent converge?

In Simulated Annealing, generally, the temperature is reduced from a positive value to a low value in successive iterations. Assume the following 3 step temperature schedule:
[20, 10, 0]
Assume that we have three states s1, s2, and s3 such that V(s1) = 5, V(s2) = 0, and V(s3) = 10. Successors of a state are chosen uniformly randomly. The successor states are defined as: next(s1) = {s2}, next(s2) = {s1, s3}, next(s3) = {s2}. Assume that s3 is the start state.

Q8. After the first iteration of simulated annealing, what is the probability that the current state would be s2. Round the answer to three digits after the decimal point.

Q9. What is the probability that when the algorithm ends, we are at the state with the highest value?
Round the answer to three digits after the decimal point.

Q10. What are the difference(s) between Simulated Annealing (SA) and Genetic Algorithms (GA)