Home / Engineering / Artificial Intelligence and Robotics (AIR) / Question

M

Madhu • 12.02K Points
Tutor II 

Q.) 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
Correct answer : Option (B) - finds the shortest path through the search space using the heuristic function i.e f(n)=g(n) + h(n)

Share

Previous

Next

Discusssion

Login to discuss.

Related MCQs on Artificial Intelligence and Robotics (AIR)

Q. The ' // ' tells the query that _.

Q. If "S -> aS, S -> a" are the productions in a grammar G, then the grammar is called_____.

Q. Which one of the following algorithm is not used in asymmetric-key cryptography?

Q. The very first computer memory consisted of

Q. R is a relation defined in Z by aRb if and only if ab ³ 0, then R is

Q. Any algorithm is a program.

Q. _______ is the practice and precautions taken to protect valuable information from unauthorized access, recording, disclosure or destruction.

Q. Which of the following is an example of data-link layer vulnerability?

Q. occurs when the same clock signal arrives at different times at different clock inputs due to propagation delay.

Q. Hamiltonian path problem is