Description : If h* represents an estimate of the cost of getting from the current node N to the goal node and h represents actual cost of getting from current node to the goal node, then A* algorithm gives an optimal solution ... h* us equal to h (B) h* overestimates h (C) h* underestimates h (D) none of these
Last Answer : (C) h* underestimates h
Description : Define Admissible heuristic h (n).
Last Answer : In A* search, if it is optimal then, h(n) is an admissible heuristic which means h(n) never overestimates the cost to reach the goal.
Description : Heuristic function h(n) is ________ a) Lowest path cost b) Cheapest path from root to goal node c) Estimated cost of cheapest path from root to goal node d) Average path cost
Last Answer : c) Estimated cost of cheapest path from root to goal node
Description : A solution to a problem is a path from the initial state to a goal state. Solution quality is measured by the path cost function, and an optimal solution has the highest path cost among all solutions. a) True b) False
Last Answer : a) True
Description : An algorithm A is admissible if ___________ a) It is not guaranteed to return an optimal solution when one exists b) It is guaranteed to return an optimal solution when one exists c) It returns more solutions, but not an optimal one d) It guarantees to return more optimal solutions
Last Answer : b) It is guaranteed to return an optimal solution when one exists
Description : A complete, local search algorithm always finds goal if one exists, an optimal algorithm always finds a global minimum/maximum. a) True b) False
Description : Hill climbing sometimes called ____________ because it grabs a good neighbor state without thinking ahead about where to go next. a) Needy local search b) Heuristic local search c) Greedy local search d) Optimal local search
Last Answer : c) Greedy local search
Description : Which is the best way to go for Game playing problem? a) Linear approach b) Heuristic approach (Some knowledge is stored) c) Random approach d) An Optimal approach
Last Answer : b) Heuristic approach (Some knowledge is stored)
Description : ______ do not guarantee optimal/any solutions A. Heuristic B. Critical C. Value based D. Analytical
Last Answer : A. Heuristic
Description : Greedy search strategy chooses the node for expansion in ___________ a) Shallowest b) Deepest c) The one closest to the goal node d) Minimum heuristic cost
Last Answer : c) The one closest to the goal node
Description : Which of the following statements is true for Branch-and-Bound search? (A) Underestimates of remaining distance may cause deviation from optimal path. (B) Overestimates can't cause right path to be ... Dynamic programming principle can be used to discard redundant partial paths. (D) All of the above
Last Answer : (C) Dynamic programming principle can be used to discard redundant partial paths.
Description : Define Heuristic function, h (n).
Last Answer : h (n) is defined as the estimated cost of the cheapest path from node n to a goal node.
Description : Which search is complete and optimal when h(n) is consistent? a) Best-first search b) Depth-first search c) Both Best-first & Depth-first search d) A* search
Last Answer : d) A* search
Description : A heuristic is a way of trying ___________ a) To discover something or an idea embedded in a program b) To search and measure how far a node in a search tree seems to be from a goal c) To compare two nodes in a search tree to see if one is better than another d) All of the mentioned
Last Answer : d) All of the mentioned
Description : Strategies that know whether one non-goal state is “more promising” than another are called ___________ a) Informed & Unformed Search b) Unformed Search c) Heuristic & Unformed Search d) Informed & Heuristic Search
Last Answer : d) Informed & Heuristic Search
Description : A heuristic is a way of trying __________ a) To discover something or an idea embedded in a program b) To search and measure how far a node in a search tree seems to be from a goal c) To compare two nodes in a search tree to see if one is better than the other is d) All of the mentioned
Description : uniform-cost search expands the node n with the __________ a) Lowest path cost b) Heuristic cost c) Highest path cost d) Average path cost
Last Answer : a) Lowest path cost
Description : Breadth-first search is not optimal when all step costs are equal, because it always expands the shallowest unexpanded node. a) True b) False
Last Answer : b) False
Description : What is the main task of a problem-solving agent? a) Solve the given problem and reach to goal b) To find out which sequence of action will get it to the goal state c) All of the mentioned d) None of the mentioned
Last Answer : c) All of the mentioned
Description : What is the evaluation function in A* approach? a) Heuristic function b) Path cost from start node to current node c) Path cost from start node to current node + Heuristic cost d) Average of Path cost from start node to current node and Heuristic cost
Last Answer : c) Path cost from start node to current node + Heuristic cost
Description : What is the evaluation function in greedy approach? a) Heuristic function b) Path cost from start node to current node c) Path cost from start node to current node + Heuristic cost d) Average of Path cost from start node to current node and Heuristic cost
Last Answer : a) Heuristic function
Description : The name best-first search is a venerable but inaccurate one. After all, if we could really expand the best node first, it would not be a search at all; it would be a straight march to the ... is choose the node that appears to be best according to the evaluation function. a) True b) False
Description : The main idea of Bidirectional search is to reduce the time complexity by searching two way simultaneously from start node and another from goal node. a) True b) False
Description : A problem solving approach (algorithm) to find a satisfactory solution where finding an optimal or exact solution is impractical or impossible. Heuristic A. Algebraic B. Hyroglyphics C. Hypertext
Last Answer : C. Hypertext
Description : 2. ______ do not guarantee optimal/any solutions A. Heuristic B. Critical C. Value based D. Analytical
Description : Which is the best way to go for Game playing problem? (A) Linear approach (B) Heuristic approach (C) Random approach (D) Optimal approach
Last Answer : (B) Heuristic approach
Description : What is the best method to go for the game playing problem? (1) Optimal Search (2) Random Search (3) Heuristic Search (4) Stratified Search
Last Answer : (3) Heuristic Search
Description : Mathematical game theory, a branch of economics, views any multi-agent environment as a game provided that the impact of each agent on the others is “significant,” regardless of whether the agents are cooperative or competitive. a) True b) False
Description : Special programs that assist programmers are called ____________ a) heuristic processors b) symbolic programmers c) intelligent programming tools d) program recognizers
Last Answer : c) intelligent programming tools
Description : _____________ algorithms is used to extract the plan directly from the planning graph, rather than using graph to provide heuristic. a) BFS/DFS b) A* c) Graph-Plan d) Greedy
Last Answer : c) Graph-Plan
Description : Which data structure is used to give better heuristic estimates? a) Forwards state-space b) Backward state-space c) Planning graph algorithm d) None of the mentioned
Last Answer : c) Planning graph algorithm
Description : General algorithm applied on game tree for making decision of win/lose is ____________ a) DFS/BFS Search Algorithms b) Heuristic Search Algorithms c) Greedy Search Algorithms d) MIN/MAX Algorithms
Last Answer : d) MIN/MAX Algorithms
Description : Constraint satisfaction problems on finite domains are typically solved using a form of ___________ a) Search Algorithms b) Heuristic Search Algorithms c) Greedy Search Algorithms d) All of the mentioned
Description : Which is used to improve the performance of heuristic search? a) Quality of nodes b) Quality of heuristic function c) Simple form of nodes d) None of the mentioned
Last Answer : b) Quality of heuristic function
Description : What is the other name of informed search strategy? a) Simple search b) Heuristic search c) Online search d) None of the mentioned
Last Answer : b) Heuristic search
Description : What is the general term of Blind searching? a) Informed Search b) Uninformed Search c) Informed & Unformed Search d) Heuristic Search
Last Answer : b) Uninformed Search
Description : Which method is effective for escaping from local minima? a) Updating heuristic estimate b) Reducing heuristic estimate c) Eliminating heuristic estimate d) None of the mentioned
Last Answer : a) Updating heuristic estimate
Description : What is the term used for describing the judgmental or commonsense part of problem solving? a) Heuristic b) Critical c) Value based d) Analytical
Last Answer : a) Heuristic
Description : An Artificial Intelligence technique that allows computers to understand associations and relationships between objects and events is called _____________ a) heuristic processing b) cognitive science c) relative symbolism d) pattern matching
Last Answer : c) relative symbolism
Description : What are the two subfields of Natural language processing? a) symbolic and numeric b) time and motion c) algorithmic and heuristic d) understanding and generation
Last Answer : c) algorithmic and heuristic
Description : Which term is used for describing the judgmental or commonsense part of problem solving? a) Heuristic b) Critical c) Value based d) Analytical
Description : Genetic Algorithm are a part of A . Evolutionary Computing B. inspired by Darwin's theory about evolution - "survival of the fittest" C. are adaptive heuristic search algorithm based on the evolutionary ideas of natural selection and genetics D . All of the above
Last Answer : D . All of the above
Description : An AI technique that allows computers to understand associations and relationships between objects and events is called: a. heuristic processing b. cognitive science c. relative symbolism d. pattern matching
Last Answer : d. pattern matching
Description : A bidirectional feedback loop links computer modelling with: a. artificial science b. heuristic processing c. human intelligence d. cognitive science
Last Answer : d. cognitive science
Description : What are the 2 types of memory bounded heuristic algorithms?
Last Answer : i. Recursive Best First Search(RBFS) ii. Memory bounded A*(MA*)
Description : The ____ level contains constituents at the third level which are knowledge based system, heuristic search, automatic theorem proving, multi-agent system. A. Cognition level B. Gross level C. Functional level D. All of above
Last Answer : B. Gross level
Description : A ____ is a rule of thumb, strategy, trick, simplification, or any other kind of device which drastically limits search for solutions in large problem spaces. A. Heuristic B. Critical C. Value based D. Analytical
Description : What is the term used for describing the judgmental or commonsense part of problem solving? A. Heuristic B. Critical C. Value based D. Analytical
Description : What is the term used for describing the judgmental or commonsense part of problem solving? A. Heuristic B. Critical C. Value based D. Analytical E. None of the above
Description : what is heuristic function A : Lowest path cost B : Cheapest path from root to goal node C : Average path cost D : Estimated cost of cheapest path from root to goal node
Last Answer : D : Estimated cost of cheapest path from root to goal node