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.

Related MCQs

Q. The Incremental Model is a result of combination of elements of which two models?

Q. The selector inputs to an arithmetic-logic unit (ALU) determine the:

Q. The elements of an array are allocated in spaces________.

Q. The probability that a person owns a sports car given that they subscribe to automotive magazine is 40%. We also know that 3% of the adult population

Q. A typical program creates some remote objects, makes references to these objects accessible, and waits for clients to invoke method

Q. Bluetooth transceiver devices operate in ______ band.

Q. In a chip, which type/s of pad design/s is/are adopted to solve the problem of pin count?

Q. Given an arbitrary non-deterministic finite automaton NFA with N states, the maximum number of states in an equivalent minimized DFA is at least:

Q. Which Project 802 standard provides for a collision-free protocol?

Q. Purpose of Class Diagrams ___________

Question analytics