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

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
by

1 Answer

Answer :

b) Quality of heuristic function
by

Related questions

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 : 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

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 : 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

What is the other name of informed search strategy? a) Simple search b) Heuristic search c) Online search d) None of the mentioned

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

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 : 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

Last Answer : d) All of the mentioned

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

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

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

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

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

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

uniform-cost search expands the node n with the __________ a) Lowest path cost b) Heuristic cost c) Highest path cost d) Average path cost

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

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

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

What is the general term of Blind searching? a) Informed Search b) Uninformed Search c) Informed & Unformed Search d) 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

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

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

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

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 

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 : 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 

Which is used to improve the agents performance? a) Perceiving b) Learning c) Observing d) None of the mentioned

Description : Which is used to improve the agents performance? a) Perceiving b) Learning c) Observing d) None of the mentioned

Last Answer : b) Learning

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).

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).

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

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

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

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

Which search strategy is also called as blind search? a) Uninformed search b) Informed search c) Simple reflex search d) All of the mentioned

Description : Which search strategy is also called as blind search? a) Uninformed search b) Informed search c) Simple reflex search d) All of the mentioned

Last Answer : a) Uninformed search

Which search algorithm imposes a fixed depth limit on nodes? a) Depth-limited search b) Depth-first search c) Iterative deepening search d) Bidirectional search

Description : Which search algorithm imposes a fixed depth limit on nodes? a) Depth-limited search b) Depth-first search c) Iterative deepening search d) Bidirectional search

Last Answer : a) Depth-limited search

When is breadth-first search is optimal? a) When there is less number of nodes b) When all step costs are equal c) When all step costs are unequal

Description : When is breadth-first search is optimal? a) When there is less number of nodes b) When all step costs are equal c) When all step costs are unequal

Last Answer : b) When all step costs are equal

Choose from the following that are Decision Tree nodes? a) Decision Nodes b) End Nodes c) Chance Nodes d) All of the mentioned

Description : Choose from the following that are Decision Tree nodes? a) Decision Nodes b) End Nodes c) Chance Nodes d) All of the mentioned

Last Answer : d) All of the mentioned

Which is true for neural networks? a) It has set of nodes and connections b) Each node computes it’s weighted input c) Node could be in excited state or non-excited state d) All of the mentioned

Description : Which is true for neural networks? a) It has set of nodes and connections b) Each node computes it’s weighted input c) Node could be in excited state or non-excited state d) All of the mentioned

Last Answer : d) All of the mentioned

How the effectiveness of the alpha-beta pruning gets increased? a) Depends on the nodes b) Depends on the order in which they are executed c) All of the mentioned d) None of the mentioned

Description : How the effectiveness of the alpha-beta pruning gets increased? a) Depends on the nodes b) Depends on the order in which they are executed c) All of the mentioned d) None of the mentioned

Last Answer : a) Depends on the nodes

Optimality of BFS is ___________ a) When there is less number of nodes b) When all step costs are equal c) When all step costs are unequal d) None of the mentioned

Description : Optimality of BFS is ___________ a) When there is less number of nodes b) When all step costs are equal c) When all step costs are unequal d) None of the mentioned

Last Answer : b) When all step costs are equal

Which is true for neural networks? a) It has set of nodes and connections b) Each node computes it’s weighted input c) Node could be in excited state or non-excited state d) All of the mentioned

Description : Which is true for neural networks? a) It has set of nodes and connections b) Each node computes it’s weighted input c) Node could be in excited state or non-excited state d) All of the mentioned

Last Answer : d) All of the mentioned

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

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

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

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

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

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

Define Heuristic function, h (n).

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. 

A game can be formally defined as a kind of search problem with the following components. a) Initial State b) Successor Function c) Terminal Test d) All of the mentioned

Description : A game can be formally defined as a kind of search problem with the following components. a) Initial State b) Successor Function c) Terminal Test d) All of the mentioned

Last Answer : d) All of the mentioned

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

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

Special programs that assist programmers are called ____________ a) heuristic processors b) symbolic programmers c) intelligent programming tools d) program recognizers

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

_____________ 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

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

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

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

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

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)

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

Last Answer : a) Heuristic

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

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

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

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

Which term is used for describing the judgmental or commonsense part of problem solving? a) Heuristic b) Critical c) Value based d) Analytical

Description : Which term is used for describing the judgmental or commonsense part of problem solving? a) Heuristic b) Critical c) Value based d) Analytical

Last Answer : a) Heuristic

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

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

A bidirectional feedback loop links computer modelling with: a. artificial science b. heuristic processing c. human intelligence d. cognitive science

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

What are the 2 types of memory bounded heuristic algorithms?

Description : What are the 2 types of memory bounded heuristic algorithms?

Last Answer : i. Recursive Best First Search(RBFS)  ii. Memory bounded A*(MA*)

Define Admissible heuristic h (n).

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.

______ do not guarantee optimal/any solutions A. Heuristic B. Critical C. Value based D. Analytical

Description : ______ do not guarantee optimal/any solutions A. Heuristic B. Critical C. Value based D. Analytical 

Last Answer : A. Heuristic 

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

Last Answer : A. Heuristic 

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 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

Last Answer : A. Heuristic 

List the performance measures of search strategies.

Description : List the performance measures of search strategies.

Last Answer : i. Completeness ii. Optimality iii. Time complexity iv. Space complexity

Which modifies the performance element so that it makes better decision? a) Performance element b) Changing element c) Learning element d) None of the mentioned

Description : Which modifies the performance element so that it makes better decision? a) Performance element b) Changing element c) Learning element d) None of the mentioned

Last Answer : c) Learning element

What is the major component/components for measuring the performance of problem solving? a) Completeness b) Optimality c) Time and Space complexity d) All of the mentioned

Description : What is the major component/components for measuring the performance of problem solving? a) Completeness b) Optimality c) Time and Space complexity d) All of the mentioned

Last Answer : d) All of the mentioned

The Task Environment of an agent consists of ____________ a) Sensors b) Actuators c) Performance Measures d) All of the mentioned

Description : The Task Environment of an agent consists of ____________ a) Sensors b) Actuators c) Performance Measures d) All of the mentioned

Last Answer : d) All of the mentioned