Q. Which of the following search algorithm searches forward from initial state and backward from goal state till both meet to identify a common state?

View solution

Q. Uniform-cost search expands the node n with the __________

View solution

Q. What is the heuristic function of greedy best-first search?

View solution

Q. A* algorithm is based on __________

View solution

Q. When will Hill-Climbing algorithm terminate?

View solution

Q. Is optimality and completeness exist in bidirectional search algorithm?

View solution

Q. _____________search regresses over goals and validate a plan before returning it.

View solution

Q. _____________ Procedure selects a flaw in a given plan and looks for a resolver.

View solution

Q. Which of the following combination of labels is not allowed for W joint in scene labelling is not allowed?

View solution

Q. If it is possible to extend each pair of consistent variable instantiation to a third variable, a CSP is said to be _________________

View solution

Q. The __________algorithm explores the domain in a depth first manner.

View solution

Q. _________________ are mathematical problems defined as a set of objects whose state must satisfy a number of constraints or limitations.

View solution

Q. Which of the Following problems can be modeled as CSP?

View solution

Q. Backtracking is based on ____________.

View solution

Q. The inference engine goes through which cycle?

View solution

Q. The output of MATCH routine in Inference Engine is ______________.

View solution

Q. Operator PUTDOWN has which of the following sequence of actions?

View solution

Q. Frame problem in STRIPS Domain can be solved by _____________________.

View solution