Description : Which of the following search strategy uses a problem specific knowledge A : uninformed Search B : Breadth-First-Search C : Heuristic Search D : Best search
Last Answer : C : Heuristic 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
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
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
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
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
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
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
Description : A heuristic is a rule of thumb------- (a) Strategy (b) Trick (c) Simplification (d) All of above
Last Answer : (d) All of above
Description : _______________ are mathematical problems defined as a set of objects whose state must satisfy a number of constraints or limitations. a) Constraints Satisfaction Problems b) Uninformed Search Problems c) Local Search Problems d) All of the mentioned
Last Answer : a) Constraints Satisfaction Problems
Description : Uninformed search strategies are better than informed search strategies. a) True b) False
Last Answer : a) True
Description : How many types are available in uninformed search method? a) 3 b) 4 c) 5 d) 6
Last Answer : c) 5
Description : What is the best method to go for the game playing problem? (1) Optimal Search (2) Random Search (3) Heuristic Search (4) Stratified Search
Last Answer : (3) Heuristic Search
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
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).
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
Description : The map colouring problem can be solved using which of the following technique? (A) Means-end analysis (B) Constraint satisfaction (C) AO* search (D) Breadth first search
Last Answer : (B) Constraint satisfaction
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
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
Description : Which search method takes less memory? (A) Depth-First Search (B) Breadth-First search (C) Both (A) and (B) (D) Linear Search
Last Answer : (A) Depth-First Search
Description : According to the text, the most common mistake that prevents evidence seized from Being admitted is: a. Uninformed consen b. Forcible entry c. Obtained without authorization d. None of the above
Last Answer : c. Obtained without authorization
Description : Which is the best way to go for Game playing problem? (A) Linear approach (B) Heuristic approach (C) Random approach (D) Optimal approach
Last Answer : (B) Heuristic approach
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
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
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
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
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
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
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
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
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
Description : "This Methodology Trains The Child To Search Facts, Rules And Principles Led By His Own Efforts, Organize The Set Of Knowledge Gained And Delineate General Rule". The Aforesaid Statement Is ... The following Methodology Of Teaching? Options: A) Montessori B) Kindergarten C) Heuristic D) Playway
Last Answer : C) Heuristic
Description : Merge sort uses a) Divide-and-conquer b) Backtracking c) Heuristic approach d) Greedy approach
Last Answer : a) Divide-and-conquer
Description : In the context of decision making, which of the following best describes a heuristic? (a) A rule that a person relies upon to assess or categorise choices. (b) One of many personal learned rules that a ... uses when making a decision. (d) An attitude that prefers to look at a question as a whole.
Last Answer : (b) One of many personal learned rules that a person applies in the process of decision making.
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
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
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
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
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
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
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
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
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
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
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
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
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