V

Vinay • 28.75K Points
Instructor 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
Share

No solution found for this question.
Add Solution and get +2 points.

You must be Logged in to update hint/solution

Discusssion

Login to discuss.

Be the first to start discuss.

Related MCQs

Q. Which of the following approach is adopted in C++?

Q. How many 3-line-to-8-line decoders are required for a 1-of-32 decoder?

Q. The Java specification defines an application programming interface for communication between the Web server and the applicatio

Q. ……………. Is a pile in which items are added at one end and removed from the other.

Q. The _____domains define registered hosts according to their generic behaviour.

Q. Which of the following is a valid uniform resource locator?

Q. Each start-up script can usually accept at least two command line arguments:

Q. Telnet protocol is used to establish a connection to

Q. _________ is Callable from the device only

Q. Amazon Relational Database Service is a variant of the 5.1 database system.

Question analytics