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

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. The __________algorithm explores the domain in a depth first manner.

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. Which of the following combination of labels is not allowed for W joint in scene labelling is not allowed?

View solution

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

View solution

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

View solution

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

View solution

Q. When will Hill-Climbing algorithm terminate?

View solution

Q. A* algorithm is based on __________

View solution

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

View solution

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

View solution

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. The process of removing detail from a given state representation is called ______

View solution

Q. What is Space Complexity of Depth First search algorithm?

View solution

Q. What is Branching Factor?

View solution

Q. Searching using query on Internet is, use of ___________ type of agent.

View solution

Q. What is disadvantage of Greedy Best First Search?

View solution

Q. Greedy search strategy chooses the node for expansion in ___________

View solution

Q. Which data structure conveniently used to implement BFS?

View solution