Question 1

What is true about variable neighborhood function?
A)neighbourhood functions that are sparse lead to quicker movement during search
B)algorithm has to inspect very fewer neighbours
C)vdn stars searching with sparse neighbourhood functions, when it reaches an optimum, it switches to denser function.
D)all of the above

Accepted Answer

Variable Neighborhood Search (VNS) algorithms typically start with a sparse neighborhood structure to quickly explore the search space. As they converge towards an optimum, they switch to denser neighborhood structures to perform a more thorough local search. This approach combines broad exploration with detailed exploitation, inspecting fewer neighbors initially and more as the search narrows down, making all the provided statements true.

Question 2

_______________________requires Linear Space but uses backtracking
A)breadth first search
B)recursive best first search (rbfs)
C)a*
D)ida*

Accepted Answer

Recursive Best First Search (RBFS) uses linear space and employs backtracking as part of its search strategy. Unlike breadth-first search or A*, which can consume memory proportional to the size of the search tree, RBFS is designed to use memory that grows only linearly with the number of nodes expanded, making it more space-efficient for certain problems.

Question 3

Which property asks that the algorithm is locally admissible?
A)admissibility
B)monotonicity
C)informedness
D)none of the above

Accepted Answer

Monotonicity is the property that requires an algorithm to be locally admissible, meaning that the cost of reaching a node, plus the estimated cost from that node to the goal, never decreases as we move towards the goal. This ensures that the path costs are non-decreasing along any path.

Question 4

A* Search Algorithm _______________
A)does not expand the node which have the lowest value of f(n),
B)finds the shortest path through the search space using the heuristic function i.e f(n)=g(n) + h(n)
C)terminates when the goal node is not found.
D)all of the above

Accepted Answer

The A* Search Algorithm finds the shortest path through the search space using the heuristic function f(n) = g(n) + h(n), where g(n) is the cost from the start node to n, and h(n) is a heuristic that estimates the cost of the cheapest path from n to the goal.

Quiz 3: Artificial Intelligence and Search Algorithms

What is true about variable neighborhood function?

_______________________requires Linear Space but uses backtracking

Which property asks that the algorithm is locally admissible?

A* Search Algorithm _______________