# NPTEL An Introduction to Artificial Intelligence Assignment 4 Answers 2023 Hello Learners, In this Post, you will find NPTEL An Introduction to Artificial Intelligence Assignment 4 Answers 2023. All the Answers are provided below to help the students as a reference don’t straight away look for the solutions.

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

Note: 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:

#### Q.1. We want to sort an array of n distinct integers using local search. The start state is a random permutation of the integers. All neighbors of a state are those permutations that can be achieved by swapping one pair of different numbers. For n=7, which of the following are INCORRECT options?

• a. Number of reachable states from the start state is 77.
• b. The number of reachable states from the start state depends on the randomly sampled initial state.
• c. Every state has 42 neighbors.
• d. For S = {i|a_i < a_i+1}, minimizing |S| leads to the desired goal state.

#### Q.2. Which of the following are correct statements?

• a. Local search through random sampling is not asymptotically complete because it takes a lot of steps.
• b. Random walk with restarts is asymptotically complete
• c. Hill climbing is not asymptotically complete because it can get stuck in plateaus/local optima.
• d. Hill climbing with sideways moves is asymptotically complete.

#### Q.3. Which of the following statement is correct about the temperature parameter in simulated annealing?

• a. If the initial temperature is set too small, the search can get stuck at a local optimum.
• b. The tendency to remain at a local optimum increases with an increase in temperature.
• c. It is increased over time to provide stability to the search process.
• d. It is increased over time to accelerate exploration. Answer: Update Soon

#### Q.4. Identify all differences between Simulated Annealing (SA) and Genetic Algorithms (GA)

• a. GA maintains multiple candidate solutions while SA does not.
• b. GA provides stronger guarantees about convergence to the global optimum than SA
• c. SA has no parameters to set whereas GA requires you to set multiple parameters such as crossover rate
• d. GA will always converge to an optimal solution faster than SA on any given problem.

#### Q.5.Which of the following optimization objectives will convert a constraint satisfaction problem to an equivalent optimization problem?

• a. Minimize the number of satisfied constraints
• b. Maximize the number of satisfied constraints
• c. Maximize R where R is 0 when all constraints are satisfied and 1 otherwise
• d. Maximize R where R is 1 when all constraints are satisfied and 0 otherwise
• a. It consumes more memory than greedy hill-climbing search regardless of beam size
• b. It can never find the optimal solution with a beam size of k if it does not find the optimal solution with a beam size > k for a single run
• c. It may find the optimal solution with a beam size of k even if it does not find the optimal solution with a beam size > k for a single run
• d. Local Beam Search with a beam size of k is equivalent to performing k random walk searches with random starts in parallel.

#### Q.8. In the previous question, what is the probability that simulated annealing terminates at the state with highest value? Assume that the run terminates after 3 steps. Round answer to 3 digits after decimal point.

• a. It never visits the same state more than once.
• b. It never visits a state that is currently in the tabu list.
• c. As the size of the tabu list increases to infinity, tabu search reduces to a systematic search.
• d. It is guaranteed to escape any local optimum it is stuck in.

#### Q.10.Assume that we have a function y = (x – 1)4. Starting at x = 2, which of the following values of the step size λ will allow gradient descent to converge to the global minimum?

• a. 0.05
• b. 0.2
• c. 0.5
• d. 0.75
##### NPTEL An Introduction to Artificial Intelligence Assignment 4 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 Brokenprogrammers. 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/