A search algorithm takes _________ as an input and returns ________ as an output. a) Input, output b) Problem, solution c) Solution, problem d) Parameters, sequence of actions

A search algorithm takes _________ as an input and returns ________ as an output.

a) Input, output

b) Problem, solution

c) Solution, problem

d) Parameters, sequence of actions
by

1 Answer

Answer :

b) Problem, solution
by

Related questions

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

The Set of actions for a problem in a state space is formulated by a ___________ a) Intermediate states b) Initial state c) Successor function, which takes current action and returns next immediate state d) None of the mentioned

Description : The Set of actions for a problem in a state space is formulated by a ___________ a) Intermediate states b) Initial state c) Successor function, which takes current action and returns next immediate state d) None of the mentioned

Last Answer : c) Successor function, which takes current action and returns next immediate state

The term ___________ is used for a depth-first search that chooses values for one variable at a time and returns when a variable has no legal values left to assign. a) Forward search b) Backtrack search c) Hill algorithm d) Reverse-Down-Hill search

Description : The term ___________ is used for a depth-first search that chooses values for one variable at a time and returns when a variable has no legal values left to assign. a) Forward search b) Backtrack search c) Hill algorithm d) Reverse-Down-Hill search

Last Answer : b) Backtrack search

The problem-solving agent with several immediate options of unknown value can decide what to do by just examining different possible sequences of actions that lead to states of known value, and then choosing the best sequence. This process of looking for such a sequence is called Search. a) True b) False

Description : The problem-solving agent with several immediate options of unknown value can decide what to do by just examining different possible sequences of actions that lead to states of known value, and then choosing the ... . This process of looking for such a sequence is called Search. a) True b) False

Last Answer : a) True

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

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

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 algorithm is used to solve any kind of problem? a) Breadth-first algorithm b) Tree algorithm c) Bidirectional search algorithm d) None of the mentioned

Description : Which algorithm is used to solve any kind of problem? a) Breadth-first algorithm b) Tree algorithm c) Bidirectional search algorithm d) None of the mentioned

Last Answer : b) Tree algorithm

The network that involves backward links from output to the input and hidden layers is called _________ a) Self organizing maps b) Perceptrons c) Recurrent neural network d) Multi layered perceptron

Description : The network that involves backward links from output to the input and hidden layers is called _________ a) Self organizing maps b) Perceptrons c) Recurrent neural network d) Multi layered perceptron

Last Answer : c) Recurrent neural network

Artificial intelligence is A . It uses machine-learning techniques. Here program can learn From past experience and adapt themselves to new situations B. Computational procedure that takes some value as input and produces some value as output. C. Science of making machines performs tasks that would require intelligence when performed by humans D . None of these

Description : Artificial intelligence is A . It uses machine-learning techniques. Here program can learn From past experience and adapt themselves to new situations B. Computational procedure that takes some ... performs tasks that would require intelligence when performed by humans D . None of these

Last Answer : C. Science of making machines performs tasks that would require intelligence when performed by humans

Which algorithm places two actions into a plan without specifying which should come first? a) Full-order planner b) Total-order planner c) Semi-order planner d) Partial-order planner

Description : Which algorithm places two actions into a plan without specifying which should come first? a) Full-order planner b) Total-order planner c) Semi-order planner d) Partial-order planner

Last Answer : d) Partial-order planner

In LISP, the function returns t if is a CONS cell and nil otherwise ________ a) (cons ) b) (consp ) c) (eq ) d) (cous =)

Description : In LISP, the function returns t if is a CONS cell and nil otherwise ________ a) (cons ) b) (consp ) c) (eq ) d) (cous =)

Last Answer : b) (consp )

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

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 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 is the most straightforward approach for planning algorithm? a) Best-first search b) State-space search c) Depth-first search d) Hill-climbing search

Description : Which is the most straightforward approach for planning algorithm? a) Best-first search b) State-space search c) Depth-first search d) Hill-climbing search

Last Answer : b) State-space search

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

Which of the following algorithm is generally used CSP search algorithm? a) Breadth-first search algorithm b) Depth-first search algorithm c) Hill-climbing search algorithm d) None of the mentioned

Description : Which of the following algorithm is generally used CSP search algorithm? a) Breadth-first search algorithm b) Depth-first search algorithm c) Hill-climbing search algorithm d) None of the mentioned

Last Answer : b) Depth-first search algorithm

The BACKTRACKING-SEARCH algorithm in Figure 5.3 has a very simple policy for what to do when a branch of the search fails: back up to the preceding variable and try a different value for it. This is called chronological-backtracking. It is also possible to go all the way to set of variable that caused failure. a) True b) False

Description : The BACKTRACKING-SEARCH algorithm in Figure 5.3 has a very simple policy for what to do when a branch of the search fails: back up to the preceding variable and try a different value for it. This is ... also possible to go all the way to set of variable that caused failure. a) True b) False

Last Answer : a) True

A genetic algorithm (or GA) is a variant of stochastic beam search in which successor states are generated by combining two parent states, rather than by modifying a single state. a) True b) False

Description : A genetic algorithm (or GA) is a variant of stochastic beam search in which successor states are generated by combining two parent states, rather than by modifying a single state. a) True b) False

Last Answer : a) True

__________ algorithm keeps track of k states rather than just one. a) Hill-Climbing search b) Local Beam search c) Stochastic hill-climbing search d) Random restart hill-climbing search

Description : __________ algorithm keeps track of k states rather than just one. a) Hill-Climbing search b) Local Beam search c) Stochastic hill-climbing search d) Random restart hill-climbing search

Last Answer : b) Local Beam search

______________ Is an algorithm, a loop that continually moves in the direction of increasing value – that is uphill. a) Up-Hill Search b) Hill-Climbing c) Hill algorithm d) Reverse-Down-Hill search

Description : ______________ Is an algorithm, a loop that continually moves in the direction of increasing value – that is uphill. a) Up-Hill Search b) Hill-Climbing c) Hill algorithm d) Reverse-Down-Hill search

Last Answer : b) Hill-Climbing

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 : A complete, local search algorithm always finds goal if one exists, an optimal algorithm always finds a global minimum/maximum. a) True b) False

Last Answer : a) True

A* algorithm is based on ___________ a) Breadth-First-Search b) Depth-First –Search c) Best-First-Search d) Hill climbing

Description : A* algorithm is based on ___________ a) Breadth-First-Search b) Depth-First –Search c) Best-First-Search d) Hill climbing

Last Answer : c) Best-First-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

Which search algorithm will use limited amount of memory? a) RBFS b) SMA* c) Hill-climbing search algorithm d) Both RBFS & SMA*

Description : Which search algorithm will use limited amount of memory? a) RBFS b) SMA* c) Hill-climbing search algorithm d) Both RBFS & SMA*

Last Answer : d) Both RBFS & SMA*

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

Search space A . The large set of candidate solutions possible for a problem B. The information stored in a database that can be, retrieved with a single query. C. Worth of the output of a machine learning program that makes it understandable for humans D . None of these

Description : Search space A . The large set of candidate solutions possible for a problem B. The information stored in a database that can be, retrieved with a single query. C. Worth of the output of a machine learning program that makes it understandable for humans D . None of these

Last Answer : A . The large set of candidate solutions possible for a problem

What is meant by simulated annealing in artificial intelligence? a) Returns an optimal solution when there is a proper cooling schedule b) Returns an optimal solution when there is no proper cooling schedule c) It will not return an optimal solution when there is a proper cooling schedule d) None of the mentioned

Description : What is meant by simulated annealing in artificial intelligence? a) Returns an optimal solution when there is a proper cooling schedule b) Returns an optimal solution when there is no proper cooling ... not return an optimal solution when there is a proper cooling schedule d) None of the mentioned

Last Answer : a) Returns an optimal solution when there is a proper cooling schedule

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

An algorithm is complete if ____________ a) It terminates with a solution when one exists b) It starts with a solution c) It does not terminate with a solution d) It has a loop

Description : An algorithm is complete if ____________ a) It terminates with a solution when one exists b) It starts with a solution c) It does not terminate with a solution d) It has a loop

Last Answer : a) It terminates with a solution when one exists

__________ algorithm translates a planning problem in to prepositional axioms. a) GraphPlan b) SatPlan c) Greedy d) None of the mentioned

Description : __________ algorithm translates a planning problem in to prepositional axioms. a) GraphPlan b) SatPlan c) Greedy d) None of the mentioned

Last Answer : b) SatPlan

Which problem can frequently occur in backward chaining algorithm? a) Repeated states b) Incompleteness c) Complexity d) Both Repeated states & Incompleteness

Description : Which problem can frequently occur in backward chaining algorithm? a) Repeated states b) Incompleteness c) Complexity d) Both Repeated states & Incompleteness

Last Answer : d) Both Repeated states & Incompleteness

Which algorithm will work backward from the goal to solve a problem? a) Forward chaining b) Backward chaining c) Hill-climb algorithm d) None of the mentioned

Description : Which algorithm will work backward from the goal to solve a problem? a) Forward chaining b) Backward chaining c) Hill-climb algorithm d) None of the mentioned

Last Answer : b) Backward chaining

An agent is composed of ________ a) Architecture b) Agent Function c) Perception Sequence d) Architecture and Program

Description : An agent is composed of ________ a) Architecture b) Agent Function c) Perception Sequence d) Architecture and Program

Last Answer : d) Architecture and Program

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

Each connection link in ANN is associated with ________ which has information about the input signal. A. neurons B. weights C. bias D. activation function

Description : Each connection link in ANN is associated with ________ which has information about the input signal. A. neurons B. weights C. bias D. activation function

Last Answer : B. weights

What takes input as an object described by a set of attributes? a) Tree b) Graph c) Decision graph d) Decision tree

Description : What takes input as an object described by a set of attributes? a) Tree b) Graph c) Decision graph d) Decision tree

Last Answer : d) Decision tree

What takes input as an object described by a set of attributes? a) Tree b) Graph c) Decision graph d) Decision tree

Description : What takes input as an object described by a set of attributes? a) Tree b) Graph c) Decision graph d) Decision tree

Last Answer : d) Decision tree

Which search method takes less memory? a) Depth-First Search b) Breadth-First search c) Linear Search d) Optimal search

Description : Which search method takes less memory? a) Depth-First Search b) Breadth-First search c) Linear Search d) Optimal search

Last Answer : a) Depth-First Search

Which search method takes less memory? a) Depth-First Search b) Breadth-First search c) Optimal search d) Linear Search

Description : Which search method takes less memory? a) Depth-First Search b) Breadth-First search c) Optimal search d) Linear Search

Last Answer : a) Depth-First Search

The process by which the brain orders actions needed to complete a specific task is referred as ____________ a) Planning problem b) Partial order planning c) Total order planning d) Both Planning problem & Partial order planning

Description : The process by which the brain orders actions needed to complete a specific task is referred as ____________ a) Planning problem b) Partial order planning c) Total order planning d) Both Planning problem & Partial order planning

Last Answer : d) Both Planning problem & Partial order planning

A plan that describe how to take actions in levels of increasing refinement and specificity is ____________ a) Problem solving b) Planning c) Non-hierarchical plan d) Hierarchical plan

Description : A plan that describe how to take actions in levels of increasing refinement and specificity is ____________ a) Problem solving b) Planning c) Non-hierarchical plan d) Hierarchical plan

Last Answer : d) Hierarchical plan

The process by which the brain incrementally orders actions needed to complete a specific task is referred as ______________ a) Planning problem b) Partial order planning c) Total order planning d) Both Planning problem & Partial order planning

Description : The process by which the brain incrementally orders actions needed to complete a specific task is referred as ______________ a) Planning problem b) Partial order planning c) Total order planning d) Both Planning problem & Partial order planning

Last Answer : b) Partial order planning

Which depends on the percepts and actions available to the agent? a) Agent b) Sensor c) Design problem d) None of the mentioned

Description : Which depends on the percepts and actions available to the agent? a) Agent b) Sensor c) Design problem d) None of the mentioned

Last Answer : c) Design problem

What is called an exploration problem? a) State and actions are unknown to the agent b) State and actions are known to the agent c) Only actions are known to agent d) None of the mentioned

Description : What is called an exploration problem? a) State and actions are unknown to the agent b) State and actions are known to the agent c) Only actions are known to agent d) None of the mentioned

Last Answer : a) State and actions are unknown to the agent

A 3-input neuron is trained to output a zero when the input is 110 and a one when the input is 111. After generalization, the output will be zero when and only when the input is? a) 000 or 110 or 011 or 101 b) 010 or 100 or 110 or 101 c) 000 or 010 or 110 or 100

Description : A 3-input neuron is trained to output a zero when the input is 110 and a one when the input is 111. After generalization, the output will be zero when and only when the input is? a) 000 or 110 or 011 or 101 b) 010 or 100 or 110 or 101 c) 000 or 010 or 110 or 100

Last Answer : c) 000 or 010 or 110 or 100

The network that involves backward links from output to the input and hidden layers is called as ____. a) Self organizing maps b) Perceptrons c) Recurrent neural network d) Multi layered perceptron

Description : The network that involves backward links from output to the input and hidden layers is called as ____. a) Self organizing maps b) Perceptrons c) Recurrent neural network d) Multi layered perceptron

Last Answer : c) Recurrent neural network

A 4-input neuron has weights 1, 2, 3 and 4. The transfer function is linear with the constant of proportionality being equal to 2. The inputs are 4, 10, 5 and 20 respectively. The output will be: a) 238 b) 76 c) 119 d) 123

Description : A 4-input neuron has weights 1, 2, 3 and 4. The transfer function is linear with the constant of proportionality being equal to 2. The inputs are 4, 10, 5 and 20 respectively. The output will be: a) 238 b) 76 c) 119 d) 123

Last Answer : a) 238

A 3-input neuron is trained to output a zero when the input is 110 and a one when the input is 111. After generalization, the output will be zero when and only when the input is: a) 000 or 110 or 011 or 101 b) 010 or 100 or 110 or 101 c) 000 or 010 or 110 or 100 d) 100 or 111 or 101 or 001

Description : A 3-input neuron is trained to output a zero when the input is 110 and a one when the input is 111. After generalization, the output will be zero when and only when the input is: a) 000 or 110 or 011 or 101 b) 010 or 100 or 110 or 101 c) 000 or 010 or 110 or 100 d) 100 or 111 or 101 or 001

Last Answer : c) 000 or 010 or 110 or 100

Sensing organs as input, mechanical movement organs as output and central nervous system (CNS) in brain as control and computing devices is known as _____ of human being A. Information Control Paradigm B. Information Processing Paradigm C. Information Processing Control D. None of above

Description : Sensing organs as input, mechanical movement organs as output and central nervous system (CNS) in brain as control and computing devices is known as _____ of human being A. Information Control Paradigm B. Information Processing Paradigm C. Information Processing Control D. None of above

Last Answer : B. Information Processing Paradigm