2/18/24, 8:40 PM An Introduction to Artificial Intelligence - - Unit 7 - Week 4

(https://swayam.gov.in) (https://swayam.gov.in/nc_details/NPTEL)

rajamdhana@gmail.com 

NPTEL (https://swayam.gov.in/explorer?ncCode=NPTEL) » An Introduction to Artificial Intelligence

(course)


Click to register
for Certification
exam
Week 4 : Assignment 4
(https://examform.nptel.ac.in/2024_01/exam_form/dashboard)
Your last recorded submission was on 2024-02-18, 18:53 Due date: 2024-02-21, 23:59 IST.
IST
If already
registered, click 1) Which of the following is (are) drawback(s) of Hill Climbing? 1 point
to check your
payment status Global Maxima
Local Maxima
Diagonal Ridges
Plateaus
Course
outline
2) Let x be the expected number of restarts (first try is not included in the number of restarts)
in Hill Climbing with Random Restarts Algorithm, if the probability of success, p = 0.23. Let y be
About
the expected number of steps taken to return a solution, given, it takes 4 steps when it succeeds
NPTEL ()
and 3 steps when it fails. What is 3x+y (return the nearest integer)?

How does an 7
NPTEL
1 point
online
course 3) Select the INCORRECT statements - 1 point
work? ()
Local beam search (with k nodes in memory) is the same as k random-start searches in
Week 1 () parallel.
Simulated annealing with temperature T = 0 behaves identically to greedy hill-climbing
Week 2 () search
Enforced Hill Climbing performs a depth-first search from a local minima.
Week 3 ()
In Tabu Search, we never make a currently tabu’ed step.

Week 4 ()
4) Select the CORRECT statements - 1 point
Local Search:
Satisfaction Vs

https://onlinecourses.nptel.ac.in/noc24_cs08/unit?unit=44&assessment=200 1/4
2/18/24, 8:40 PM An Introduction to Artificial Intelligence - - Unit 7 - Week 4

Optimization Genetic Algorithm has the effect of “jumping” to completely new parts of search-space,
Part-1 (unit?
and making “non-local” moves.
unit=44&lesso
n=45) As the size of the tabu list increases to infinity, tabu search reduces to a systematic
search.
Local Search:
Greedy Hill Climbing with Random Restarts is asymptotically complete, whereas Random
The Example
of N-Queens
Walk is not.
Part-2 (unit? If the initial temperature in Simulated Annealing is set too small, the search can get stuck
unit=44&lesso at a local optimum.
n=46)
5) We define First-Choice Hill Climbing (FCHC) as a stochastic hill-climbing algorithm 1 point
Local Search: that generates neighbours randomly until one is found better than the current state. When this
Hill Climbing
happens, the algorithm moves to this new state and repeats.
Part-3 (unit?
unit=44&lesso
n=47)
Select the CORRECT statements:

Local Search: FCHC is similar to Simulated Annealing for large values of T.

Drawbacks of FCHC will always return the same solution as Greedy Hill Climbing as we always take a
Hill Climbing
step in the direction of increasing slope.
Part-4 (unit?
unit=44&lesso FCHC will perform better than Greedy Hill Climbing when each state has a large number
n=48) of neighbours.
FCHC combined with Tabu List does not suffer from local maximas/minimas.
Local Search:
of Hill Climbing
With random 6) Consider the Hill Climbing Search algorithm for the N-Queens problem with N = 4. The
Walk & image represents the start state. We want to reach a state i.e. configuration of the board with 4
Random queens such that no two queens attack each other. The objective function we consider is the
Restart Part-5 number of pairs of queens that attack each other and we want to minimise this objective function.
(unit? The successor function we consider is moving a single queen along its column by one square
unit=44&lesso
either directly up or directly down.
n=49)

Local Search:
Hill Climbing
With Simulated
Anealing Part-
6 (unit?
unit=44&lesso
n=50)

Local Search:
Local Beam
Search and
Genetic
Let the objective function for the start state = x , the number of neighbours of the start state = y,
Algorithms
the objective function of the neighbour of the start state with the lowest objective function = z,
Part-7 (unit?
then what is the value of 2x + y + 3z ?
unit=44&lesso
n=51)
24
Quiz: Week 4 1 point
: Assignment
4 7) Consider the same setup as question 6, we apply the hill climbing algorithm to minimise the
(assessment? objective function. The hill climbing algorithm stops when the objective function becomes 0 i.e. no
name=200) two queens attack each other. To break ties b/w two neighbours with the same objective function
pick the neighbour obtained by moving the queen in the lower column number (a < b < c < d) and

https://onlinecourses.nptel.ac.in/noc24_cs08/unit?unit=44&assessment=200 2/4
2/18/24, 8:40 PM An Introduction to Artificial Intelligence - - Unit 7 - Week 4

if a tie still exists pick the neighbour obtained by moving the queen downward. The number of
Text
steps required by the hill climbing algorithm is:
Transcripts ()
2
Books ()
1 point

8) Assume that we have a function y = (x - 3)4 , starting at x = 4, which of the following 1 point
values of the step size λ will allow gradient descent to converge to the global minimum?

0.005
0.25
0.5
0.75

9) Consider a state space having 3 states: s1, s2 and s3. The value of each state is V(s1) = 0,
V(s2) = 4, V(s3) = 2. There can be transitions from s1 to s2, s2 to s1 and s3, and s3 to s2. Starting
at s1, what is the probability that we end up back at s1 after 2 steps of simulated annealing?
Assume that we follow a temperature schedule of [10, 5, 1]. Next state is chosen uniformly at
random whenever there are multiple possibilities.

Round answer to 3 digits after decimal point (eg, if the answer is 0.1346, return 0.135).

0.500
1 point

10) Consider the 1-D state space shown by the image below. For which of the following 1 point
start state regions using the greedy local search hill-climbing algorithm will we not reach the
global maximum ?

A
B
C
D
E
F

You may submit any number of times before the due date. The final submission will be
considered for grading.

https://onlinecourses.nptel.ac.in/noc24_cs08/unit?unit=44&assessment=200 3/4
2/18/24, 8:40 PM An Introduction to Artificial Intelligence - - Unit 7 - Week 4

Submit Answers

https://onlinecourses.nptel.ac.in/noc24_cs08/unit?unit=44&assessment=200 4/4