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 : 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 : 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
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
Last Answer : d) All of the mentioned
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 : Depth-first search always expands the ______ node in the current fringe of the search tree. a) Shallowest b) Child node c) Deepest d) Minimum cost
Last Answer : c) Deepest
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
Description : Breadth-first search always expands the ______ node in the current fringe of the search tree. a) Shallowest b) Child node c) Deepest
Last Answer : a) Shallowest
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 : Best-First search is a type of informed search, which uses ________________ to choose the best next node for expansion. a) Evaluation function returning lowest evaluation b) Evaluation function ... c) Evaluation function returning lowest & highest evaluation d) None of them is applicable
Last Answer : a) Evaluation function returning lowest evaluation
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 : Which function will select the lowest expansion node at first for evaluation? a) Greedy best-first search b) Best-first search c) Depth-first search d) None of the mentioned
Last Answer : b) Best-first search
Description : A* is optimal if h(n) is an admissible heuristic-that is, provided that h(n) never underestimates the cost to reach the goal. a) True b) False
Last Answer : a) True
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 : 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 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 : 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 : 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 : 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 : 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
Last Answer : A. Heuristic
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 (D) Only (a), (b) and (c).
Last Answer : (D) Only (a), (b) and (c).
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 : 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 : Best-First search is a type of informed search, which of the following principle used to choose the best next node for expansion A : Evaluation function returning lowest evaluation B : ... highest evaluation C : Evaluation function returning lowest & highest evaluation D : no evaluation function
Last Answer : A : Evaluation function returning lowest evaluation
Description : Define Uniform cost search.
Last Answer : Uniform cost search expands the node ‘n’ with the lowest path cost instead of expanding the shallowest node.
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 : Which search method will expand the node that is closest to the goal? a) Best-first search b) Greedy best-first search c) A* search d) None of the mentioned
Last Answer : b) Greedy best-first search
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 : Define search node.
Last Answer : The root of the search tree that is the initial state of the problem is called search 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
Description : Which is true regarding BFS (Breadth First Search)? a) BFS will get trapped exploring a single path b) The entire tree so far been generated must be stored in BFS c) BFS is not guaranteed to find a solution if exists d) BFS is nothing but Binary First Search
Last Answer : b) The entire tree so far been generated must be stored in BFS
Description : The _______ is a touring problem in which each city must be visited exactly once. The aim is to find the shortest tour. a) Finding shortest path between a source and a destination b) Travelling ... c) Map coloring problem d) Depth first search traversal on a given map represented as a graph
Last Answer : b) Travelling Salesman problem
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 : 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 : 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