List the performance measures of search strategies.

List the performance measures of search strategies.
by

1 Answer

Answer :

i. Completeness

ii. Optimality

iii. Time complexity

iv. Space complexity
by

Related questions

List the various search strategies.

Description : List the various search strategies.

Last Answer : a. BFS b. Uniform cost search c. DFS d. Depth limited search e. Iterative deepening search f. Bidirectional search

Uninformed search strategies are better than informed search strategies. a) True b) False

Description : Uninformed search strategies are better than informed search strategies. a) True b) False

Last Answer : a) True

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

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

Performance Measures are fixed for all agents. a) True b) False

Description : Performance Measures are fixed for all agents. a) True b) False

Last Answer : a) True

Define performance measures.

Description : Define performance measures.

Last Answer :  Performance measure embodies the criterion for success of an agent’s behavior. 

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

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

List some properties of SMA* search.

Description : List some properties of SMA* search. 

Last Answer : * It will utilize whatever memory is made available to it.  * It avoids repeated states as for as its memory allow.  * It is complete if the available memory is sufficient to store ... available for entire search tree, the search is optimally efficient.  *Hill climbing.  *Simulated annealing.

List the various informed search strategy.

Description : List the various informed search strategy.

Last Answer : Best first search –greedy search ,A* search Memory bounded search-Iterative deepening A*search -simplified memory bounded A*search -Iterative improvement search –hill climbing -simulated annealing 

Which of the following strategies would NOT be effective at improving your communication competence? a) Recognize the people, objects, and situations remain stable over time b) Recognize that each person’s frame of perception is unique c) Be active in perceiving d) Distinguish facts from inference

Description : Which of the following strategies would NOT be effective at improving your communication competence? a) Recognize the people, objects, and situations remain stable over time b) Recognize that each ... frame of perception is unique c) Be active in perceiving d) Distinguish facts from inference

Last Answer : a) Recognize the people, objects, and situations remain stable over time

Factors which affect the performance of learner system does not include? a) Representation scheme used b) Training scenario c) Type of feedback d) Good data structures

Description : Factors which affect the performance of learner system does not include? a) Representation scheme used b) Training scenario c) Type of feedback d) Good data structures

Last Answer : d) Good data structures

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

Where does the performance measure is included? a) Rational agent b) Task environment c) Actuators d) Sensor

Description : Where does the performance measure is included? a) Rational agent b) Task environment c) Actuators d) Sensor

Last Answer : b) Task environment

Which environment is called as semi dynamic? a) Environment does not change with the passage of time b) Agent performance changes c) Environment will be changed d) Environment does not change with the passage of time, but Agent performance changes

Description : Which environment is called as semi dynamic? a) Environment does not change with the passage of time b) Agent performance changes c) Environment will be changed d) Environment does not change with the passage of time, but Agent performance changes

Last Answer : d) Environment does not change with the passage of time, but Agent performance changes

What is rational at any given time depends on? a) The performance measure that defines the criterion of success b) The agent’s prior knowledge of the environment c) The actions that the agent can perform d) All of the mentioned

Description : What is rational at any given time depends on? a) The performance measure that defines the criterion of success b) The agent’s prior knowledge of the environment c) The actions that the agent can perform d) All of the mentioned

Last Answer : d) All of the mentioned

Which element in the agent are used for selecting external actions? a) Perceive b) Performance c) Learning d) Actuator

Description : Which element in the agent are used for selecting external actions? a) Perceive b) Performance c) Learning d) Actuator

Last Answer : b) Performance

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

Which of the factors affect the performance of learner system does not include? a) Representation scheme used b) Training scenario c) Type of feedback d) Good data structures

Description : Which of the factors affect the performance of learner system does not include? a) Representation scheme used b) Training scenario c) Type of feedback d) Good data structures

Last Answer : d) Good data structures

External actions of the agent is selected by __________ a) Perceive b) Performance c) Learning d) Actuator

Description : External actions of the agent is selected by __________ a) Perceive b) Performance c) Learning d) Actuator

Last Answer : b) Performance

The performance of an agent can be improved by __________ a) Learning b) Observing c) Perceiving d) None of the mentioned

Description : The performance of an agent can be improved by __________ a) Learning b) Observing c) Perceiving d) None of the mentioned

Last Answer : a) Learning

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

Factors which affect the performance of learner system does not include a) Representation scheme used b) Training scenario c) Type of feedback d) Good data structures

Description : Factors which affect the performance of learner system does not include a) Representation scheme used b) Training scenario c) Type of feedback d) Good data structures

Last Answer : d) Good data structures

What are the 3 mechanism to achieve performance improvement?

Description : What are the 3 mechanism to achieve performance improvement?

Last Answer : i. Relevance feedback  ii. Document classification  iii. Document clustering

How to measure the performance of an agent?

Description : How to measure the performance of an agent?

Last Answer : Performance measure of an agent is got by analyzing two tasks. They are How and When actions.

Define Artificial Intelligence in terms of human performance.

Description : Define Artificial Intelligence in terms of human performance.

Last Answer : The art of creating machines that performs functions that require intelligence when performed by people. 

In which of the following situations might a blind search be acceptable? a) Real life situation b) Complex game c) Small search space d) All of the mentioned

Description : In which of the following situations might a blind search be acceptable? a) Real life situation b) Complex game c) Small search space d) All of the mentioned

Last Answer : c) Small search space

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

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

Which algorithm is used for solving temporal probabilistic reasoning? a) Hill-climbing search b) Hidden markov model c) Depth-first search d) Breadth-first search

Description : Which algorithm is used for solving temporal probabilistic reasoning? a) Hill-climbing search b) Hidden markov model c) Depth-first search d) Breadth-first search

Last Answer : b) Hidden markov model

What are the two major aspects which combines AI Planning problem? a) Search & Logic b) Logic & Knowledge Based Systems c) FOL & Logic d) Knowledge Based Systems

Description : What are the two major aspects which combines AI Planning problem? a) Search & Logic b) Logic & Knowledge Based Systems c) FOL & Logic d) Knowledge Based Systems

Last Answer : a) Search & Logic

To eliminate the inaccuracy problem in planning problem or partial order planning problem we can use ___________________ data structure/s. a) Stacks b) Queue c) BST (Binary Search Tree) d) Planning Graphs

Description : To eliminate the inaccuracy problem in planning problem or partial order planning problem we can use ___________________ data structure/s. a) Stacks b) Queue c) BST (Binary Search Tree) d) Planning Graphs

Last Answer : d) Planning Graphs

Which is used to extract solution directly from the planning graph? a) Planning algorithm b) Graphplan c) Hill-climbing search d) All of the mentioned

Description : Which is used to extract solution directly from the planning graph? a) Planning algorithm b) Graphplan c) Hill-climbing search d) All of the mentioned

Last Answer : b) Graphplan

Which strategy is used for delaying a choice during search? a) First commitment b) Least commitment c) Both First & Least commitment d) None of the mentioned

Description : Which strategy is used for delaying a choice during search? a) First commitment b) Least commitment c) Both First & Least commitment d) None of the mentioned

Last Answer : b) Least commitment

Which cannot be taken as advantage for totally ordered plan search? a) Composition b) State search c) Problem decomposition d) None of the mentioned

Description : Which cannot be taken as advantage for totally ordered plan search? a) Composition b) State search c) Problem decomposition d) None of the mentioned

Last Answer : c) Problem decomposition

Which of the following search belongs to totally ordered plan search? a) Forward state-space search b) Hill-climbing search c) Depth-first search d) Breadth-first search

Description : Which of the following search belongs to totally ordered plan search? a) Forward state-space search b) Hill-climbing search c) Depth-first search d) Breadth-first search

Last Answer : a) Forward state-space search

Which algorithm takes two sentences and returns a unifier? a) Inference b) Hill-climbing search c) Depth-first search d) Unify algorithm

Description : Which algorithm takes two sentences and returns a unifier? a) Inference b) Hill-climbing search c) Depth-first search d) Unify algorithm

Last Answer : d) Unify algorithm

There exists two way to infer using semantic networks in which knowledge is represented as Frames. 1) Intersection Search 2) Inheritance Search a) True b) False

Description : There exists two way to infer using semantic networks in which knowledge is represented as Frames. 1) Intersection Search 2) Inheritance Search a) True b) False

Last Answer : 1) Intersection Search

Inheritance Search a) True b) False

Description : Inheritance Search a) True b) False

Last Answer : a) True

Which algorithm are in more similar to backward chaining algorithm? a) Depth-first search algorithm b) Breadth-first search algorithm c) Hill-climbing search algorithm d) All of the mentioned

Description : Which algorithm are in more similar to backward chaining algorithm? a) Depth-first search algorithm b) Breadth-first search algorithm c) Hill-climbing search algorithm d) All of the mentioned

Last Answer : a) Depth-first search algorithm

Which sentence will be unsatisfiable if the CNF sentence is unsatisfiable? a) Search statement b) Reading statement c) Replaced statement d) Original statement

Description : Which sentence will be unsatisfiable if the CNF sentence is unsatisfiable? a) Search statement b) Reading statement c) Replaced statement d) Original statement

Last Answer : d) Original statement

A _________ is used to demonstrate, on a purely syntactic basis, that one formula is a logical consequence of another formula. a) Deductive Systems b) Inductive Systems c) Reasoning with Knowledge Based Systems d) Search Based Systems

Description : A _________ is used to demonstrate, on a purely syntactic basis, that one formula is a logical consequence of another formula. a) Deductive Systems b) Inductive Systems c) Reasoning with Knowledge Based Systems d) Search Based Systems

Last Answer : a) Deductive Systems

What is called as transposition table? a) Hash table of next seen positions b) Hash table of previously seen positions c) Next value in the search d) None of the mentioned

Description : What is called as transposition table? a) Hash table of next seen positions b) Hash table of previously seen positions c) Next value in the search d) None of the mentioned

Last Answer : b) Hash table of previously seen positions

Which search is similar to minimax search? a) Hill-climbing search b) Depth-first search c) Breadth-first search d) All of the mentioned

Description : Which search is similar to minimax search? a) Hill-climbing search b) Depth-first search c) Breadth-first search d) All of the mentioned

Last Answer : b) Depth-first search

Which values are independant in minimax search algorithm? a) Pruned leaves x and y b) Every states are dependant c) Root is independant d) None of the mentioned

Description : Which values are independant in minimax search algorithm? a) Pruned leaves x and y b) Every states are dependant c) Root is independant d) None of the mentioned

Last Answer : a) Pruned leaves x and y

Which search is equal to minimax search but eliminates the branches that can’t influence the final decision? a) Depth-first search b) Breadth-first search c) Alpha-beta pruning d) None of the mentioned

Description : Which search is equal to minimax search but eliminates the branches that can’t influence the final decision? a) Depth-first search b) Breadth-first search c) Alpha-beta pruning d) None of the mentioned

Last Answer : c) Alpha-beta pruning

What is the other name of the backward state-space search? a) Regression planning b) Progression planning c) State planning d) Test planning

Description : What is the other name of the backward state-space search? a) Regression planning b) Progression planning c) State planning d) Test planning

Last Answer : a) Regression planning

What is the main advantage of backward state-space search? a) Cost b) Actions c) Relevant actions d) All of the mentioned

Description : What is the main advantage of backward state-space search? a) Cost b) Actions c) Relevant actions d) All of the mentioned

Last Answer : c) Relevant actions

How many states are available in state-space search? a) 1 b) 2 c) 3 d) 4

Description : How many states are available in state-space search? a) 1 b) 2 c) 3 d) 4

Last Answer : d) 4

What is the other name for forward state-space search? a) Progression planning b) Regression planning c) Test planning d) None of the mentioned

Description : What is the other name for forward state-space search? a) Progression planning b) Regression planning c) Test planning d) None of the mentioned

Last Answer : a) Progression planning

How many ways are available to solve the state-space search? a) 1 b) 2 c) 3 d) 4

Description : How many ways are available to solve the state-space search? a) 1 b) 2 c) 3 d) 4

Last Answer : b) 2