Stochastic hill climbing chooses at random from among the uphill moves; the probability of selection can vary with the steepness of the uphil1 move. a) True b) False

Stochastic hill climbing chooses at random from among the uphill moves; the probability of selection

can vary with the steepness of the uphil1 move.

a) True

b) False
by

1 Answer

Answer :

a) True
by

Related questions

__________ 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

What is the name of algorithm in which 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 : Platue climbing valley

Description : What is the name of algorithm in which 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 : Platue climbing valley

Last Answer : B : Hill-Climbing

What is the name of algorithm in which 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 : Platue climbing valley

Description : What is the name of algorithm in which 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 : Platue climbing valley

Last Answer : B : Hill-Climbing

What is the name of algorithm in which 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 : Platue climbing valley

Description : What is the name of algorithm in which 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 : Platue climbing valley

Last Answer : B : Hill-Climbing

What is the name of algorithm in which 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 : Platue climbing valley

Description : What is the name of algorithm in which 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 : Platue climbing valley

Last Answer : B : Hill-Climbing

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

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

How does randomized hill-climbing choose the next move each time? (A) It generates a random move from the moveset, and accepts this move. (B) It generates a random move from the whole state space, and accepts this move. (C) It generates a random move from the moveset, and accepts this move only if this move improves the evaluation function. (D) It generates a random move from the whole state space, and accepts this move only if this move improves the evaluation function.

Description : How does randomized hill-climbing choose the next move each time? (A) It generates a random move from the moveset, and accepts this move. (B) It generates a random move from the whole state ... move from the whole state space, and accepts this move only if this move improves the evaluation function.

Last Answer : (C) It generates a random move from the moveset, and accepts this move only if this move improves the evaluation function. 

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

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

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

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

What are the main cons of hill-climbing search? a) Terminates at local optimum & Does not find optimum solution b) Terminates at global optimum & Does not find optimum solution c) Does not find optimum solution & Fail to find a solution

Description : What are the main cons of hill-climbing search? a) Terminates at local optimum & Does not find optimum solution b) Terminates at global optimum & Does not find optimum solution c) Does not find optimum solution & Fail to find a solution

Last Answer : a) Terminates at local optimum & Does not find optimum solution

When will Hill-Climbing algorithm terminate? a) Stopping criterion met b) Global Min/Max is achieved c) No neighbor has higher value d) All of the mentioned

Description : When will Hill-Climbing algorithm terminate? a) Stopping criterion met b) Global Min/Max is achieved c) No neighbor has higher value d) All of the mentioned

Last Answer : c) No neighbor has higher value

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

What are the variants of hill climbing?

Description : What are the variants of hill climbing?

Last Answer : i. Stochastic hill climbing  ii. First choice hill climbing  iii. Simulated annealing search  iv. Local beam search  v. Stochastic beam search

List some drawbacks of hill climbing process.

Description : List some drawbacks of hill climbing process. 

Last Answer : Local maxima: A local maxima as opposed to a goal maximum is a peak that is lower that the highest peak in the state space. Once a local maxima is reached the algorithm will halt even though ... of the state space where the evaluation fn is essentially flat. The search will conduct a random walk.

Define Hill Climbing search.

Description : Define Hill Climbing search.

Last Answer : It is a loop that continually moves in a increasing value direction (i.e.) up hill and terminates when it reaches a “peak” where no neighbor has a higher value. 

Standard planning algorithms assumes environment to be ___________ a) Deterministic b) Fully observable c) Single agent d) Stochastic

Description : Standard planning algorithms assumes environment to be ___________ a) Deterministic b) Fully observable c) Single agent d) Stochastic

Last Answer : a) Deterministic

What kind of behavior does the stochastic environment posses? a) Local b) Deterministic c) Rational d) Primary

Description : What kind of behavior does the stochastic environment posses? a) Local b) Deterministic c) Rational d) Primary

Last Answer : a) Local

What kind of environment is strategic in artificial intelligence? a) Deterministic b) Rational c) Partial d) Stochastic

Description : What kind of environment is strategic in artificial intelligence? a) Deterministic b) Rational c) Partial d) Stochastic

Last Answer : a) Deterministic

In Bayes theorem, what is meant by P(Hi|E)? a) The probability that hypotheses Hi is true given evidence E b) The probability that hypotheses Hi is false given evidence E c) The probability that hypotheses Hi is true given false evidence E d) The probability that hypotheses Hi is false given false evidence E

Description : In Bayes theorem, what is meant by P(Hi|E)? a) The probability that hypotheses Hi is true given evidence E b) The probability that hypotheses Hi is false given evidence E c) The probability ... Hi is true given false evidence E d) The probability that hypotheses Hi is false given false evidence E

Last Answer : a) The probability that hypotheses Hi is true given evidence E

The primitives in probabilistic reasoning are random variables. a) True b) False

Description : The primitives in probabilistic reasoning are random variables. a) True b) False

Last Answer : a) True

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

Two travellers spend from 12 o'clock to 6 o'clock walking along a level road, up a hill and back again. Their pace is 4 mph on the level, 3 mph uphill, and 6 mph downhill.How far do they walk and at what time do they reach the top of the hill? -Riddles

Description : Two travellers spend from 12 o'clock to 6 o'clock walking along a level road, up a hill and back again. Their pace is 4 mph on the level, 3 mph uphill, and 6 mph downhill.How far do they walk and at what time do they reach the top of the hill? -Riddles

Last Answer : 24 miles half past three.

What are the two main features of Genetic Algorithm? a) Fitness function & Crossover techniques b) Crossover techniques & Random mutation c) Individuals among the population & Random mutation d) Random mutation & Fitness function

Description : What are the two main features of Genetic Algorithm? a) Fitness function & Crossover techniques b) Crossover techniques & Random mutation c) Individuals among the population & Random mutation d) Random mutation & Fitness function

Last Answer : a) Fitness function & Crossover techniques

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

What steepness of a line is called the angle?

Description : What steepness of a line is called the angle?

Last Answer : What is the answer ?

Which is true for Decision theory? a) Decision Theory = Probability theory + utility theory b) Decision Theory = Inference theory + utility theory c) Decision Theory = Uncertainty + utility theory d) Decision Theory = Probability theory + preference

Description : Which is true for Decision theory? a) Decision Theory = Probability theory + utility theory b) Decision Theory = Inference theory + utility theory c) Decision Theory = Uncertainty + utility theory d) Decision Theory = Probability theory + preference

Last Answer : c) Decision Theory = Uncertainty + utility theory

Which of the following statements best describes ethics? A. Ethics considers how someone chooses among alternative courses of action. B. Ethics is about values and principles. C. Ethics is concerned with how a person chooses between right and wrong. D. Each of the above covers part of the definition. E. None of the above is true.

Description : Which of the following statements best describes ethics? A. Ethics considers how someone chooses among alternative courses of action. B. Ethics is about values and principles. C. Ethics is concerned with how a ... . Each of the above covers part of the definition. E. None of the above is true.

Last Answer : D. Each of the above covers part of the definition.

Select operator is not a unary operator. ii) Project operator chooses subset of attributes or columns of a relation. A) i-True, ii-False B) i-True, ii-True C) i-False, ii-True D) i-False, ii-False

Description : Select operator is not a unary operator. ii) Project operator chooses subset of attributes or columns of a relation. A) i-True, ii-False B) i-True, ii-True C) i-False, ii-True D) i-False, ii-False

Last Answer : C) i-False, ii-True

In 1985, the famous chess player David Levy beat a world champion chess program in four straight games by using orthodox moves that confused the program. What was the name of the chess program? a) Kaissa b) CRAY BLITZ c) Golf d) DIGDUG

Description : In 1985, the famous chess player David Levy beat a world champion chess program in four straight games by using orthodox moves that confused the program. What was the name of the chess program? a) Kaissa b) CRAY BLITZ c) Golf d) DIGDUG

Last Answer : b) CRAY BLITZ

The initial state and the legal moves for each side define the __________ for the game. a) Search Tree b) Game Tree c) State Space Search d) Forest

Description :  The initial state and the legal moves for each side define the __________ for the game. a) Search Tree b) Game Tree c) State Space Search d) Forest

Last Answer : b) Game Tree

What energy does a train have climbing up a hill at a steady speed?

Description : What energy does a train have climbing up a hill at a steady speed?

Last Answer : The train is expending mechanical energy to be lifted higher in the earth's gravity well. As it is lifted higher, it is collecting and storing potential energy because of the fact that it is in that gravity well.

A person climbing a hill bends forward in order to (a) avoid slipping (b) increase speed (c) reduce fatigue (d) increase stability

Description : A person climbing a hill bends forward in order to (a) avoid slipping (b) increase speed (c) reduce fatigue (d) increase stability

Last Answer : Ans:(d)

Why do we lean forward while climbing a hill?

Description : Why do we lean forward while climbing a hill?

Last Answer : Answer: In order to keeps the vertical line passing through our centre of gravity always between our feet, which is essential to attain equilibrium or stability.

What are the main cons of hill-climbing search? A : Terminates at local optimum & Does not find optimum solution B : Terminates at global optimum & Does not find optimum solution C : Does not find optimum solution & Fail to find a solution D : Fail to find a solution

Description : What are the main cons of hill-climbing search? A : Terminates at local optimum & Does not find optimum solution B : Terminates at global optimum & Does not find optimum solution C : Does not find optimum solution & Fail to find a solution D : Fail to find a solution

Last Answer : A : Terminates at local optimum & Does not find optimum solution

When will Hill-Climbing algorithm terminate? A : Stopping criterion met B : Global Min/Max is achieved C : No neighbour has higher value D : no criteria to terminate

Description : When will Hill-Climbing algorithm terminate? A : Stopping criterion met B : Global Min/Max is achieved C : No neighbour has higher value D : no criteria to terminate

Last Answer : C : No neighbour has higher value

A* algorithm is based on which of the following concept? A : Best-First-Search B : Breadth-First-Search C : Depth-First –Search D : Hill climbing

Description : A* algorithm is based on which of the following concept? A : Best-First-Search B : Breadth-First-Search C : Depth-First –Search D : Hill climbing

Last Answer : A : Best-First-Search

What are the main cons of hill-climbing search? A : Terminates at local optimum & Does not find optimum solution B : Terminates at global optimum & Does not find optimum solution C : Does not find optimum solution & Fail to find a solution D : Fail to find a solution

Description : What are the main cons of hill-climbing search? A : Terminates at local optimum & Does not find optimum solution B : Terminates at global optimum & Does not find optimum solution C : Does not find optimum solution & Fail to find a solution D : Fail to find a solution

Last Answer : A : Terminates at local optimum & Does not find optimum solution

What are the main cons of hill-climbing search? A : Terminates at local optimum & Does not find optimum solution B : Terminates at global optimum & Does not find optimum solution C : Does not find optimum solution & Fail to find a solution D : Fail to find a solution

Description : What are the main cons of hill-climbing search? A : Terminates at local optimum & Does not find optimum solution B : Terminates at global optimum & Does not find optimum solution C : Does not find optimum solution & Fail to find a solution D : Fail to find a solution

Last Answer : A : Terminates at local optimum & Does not find optimum solution

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 one of the following is not an informed search technique? (A) Hill climbing search (B) Best first search (C) A* search (D) Depth first search

Description : Which one of the following is not an informed search technique? (A) Hill climbing search (B) Best first search (C) A* search (D) Depth first search

Last Answer : (D) Depth first search