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

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
by

1 Answer

Answer :

b) Hidden markov model
by

Related questions

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

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

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

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

Where does the Hidden Markov Model is used? a) Speech recognition b) Understanding of real world c) Both Speech recognition & Understanding of real world d) None of the mentioned

Description : Where does the Hidden Markov Model is used? a) Speech recognition b) Understanding of real world c) Both Speech recognition & Understanding of real world d) None of the mentioned

Last Answer : a) Speech recognition

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

__________ 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

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*

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

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

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

Where does the Bayes rule can be used? a) Solving queries b) Increasing complexity c) Decreasing complexity d) Answering probabilistic query

Description : Where does the Bayes rule can be used? a) Solving queries b) Increasing complexity c) Decreasing complexity d) Answering probabilistic query

Last Answer : d) Answering probabilistic query

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

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. 

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

Which search uses the problem specific knowledge beyond the definition of the problem? a) Informed search b) Depth-first search c) Breadth-first search d) Uninformed search

Description : Which search uses the problem specific knowledge beyond the definition of the problem? a) Informed search b) Depth-first search c) Breadth-first search d) Uninformed search

Last Answer : a) Informed search

Which of the following is/are Uninformed Search technique/techniques? a) Breadth First Search (BFS) b) Depth First Search (DFS) c) Bidirectional Search d) All of the mentioned

Description : Which of the following is/are Uninformed Search technique/techniques? a) Breadth First Search (BFS) b) Depth First Search (DFS) c) Bidirectional Search d) All of the mentioned

Last Answer : d) All of the mentioned

Which search implements stack operation for searching the states? a) Depth-limited search b) Depth-first search c) Breadth-first search d) None of the mentioned

Description : Which search implements stack operation for searching the states? a) Depth-limited search b) Depth-first search c) Breadth-first search d) None of the mentioned

Last Answer : b) Depth-first search

Which search is implemented with an empty first-in-first-out queue? a) Depth-first search b) Breadth-first search c) Bidirectional search d) None of the mentioned

Description : Which search is implemented with an empty first-in-first-out queue? a) Depth-first search b) Breadth-first search c) Bidirectional search d) None of the mentioned

Last Answer : b) Breadth-first search

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 agent operates by interleaving computation and action? a) Offline search b) Online search c) Breadth-first search d) Depth-first search

Description : Which search agent operates by interleaving computation and action? a) Offline search b) Online search c) Breadth-first search d) Depth-first search

Last Answer : b) Online 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

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

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

What are the tasks in probabilistic language model?

Description : What are the tasks in probabilistic language model?

Last Answer : i. Information retrieval  ii. Information Extraction  iii. Machine Translation 

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

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

Last Answer : a) True

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.

Where does the additional variables are added in HMM? a) Temporal model b) Reality model c) Probability model d) All of the mentioned

Description : Where does the additional variables are added in HMM? a) Temporal model b) Reality model c) Probability model d) All of the mentioned

Last Answer : a) Temporal model

The concept derived from ________ level are propositional logic, tautology, predicate calculus, model, temporal logic. A. Cognition level B. Logic level C. Functional level D. All of above

Description : The concept derived from ________ level are propositional logic, tautology, predicate calculus, model, temporal logic. A. Cognition level B. Logic level C. Functional level D. All of above

Last Answer : B. Logic level 

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

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

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

Breadth-first search always expands the ______ node in the current fringe of the search tree. a) Shallowest b) Child node c) Deepest

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

Breadth-first search is not optimal when all step costs are equal, because it always expands the shallowest unexpanded node. a) True b) False

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

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

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

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