Description : How many ways are available to solve the state-space search? a) 1 b) 2 c) 3 d) 4
Last Answer : b) 2
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 : 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
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
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
Description : What are taken into account of state-space search? a) Postconditions b) Preconditions c) Effects d) Both Preconditions & Effects
Last Answer : d) Both Preconditions & Effects
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
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
Description : Which method is used to search better by learning? a) Best-first search b) Depth-first search c) Metalevel state space d) None of the mentioned
Last Answer : c) Metalevel state space
Description : A problem in a search space is defined by one of these state. a) Initial state b) Last state c) Intermediate state d) All of the mentioned
Last Answer : a) Initial state
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
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
Description : Though local search algorithms are not systematic, key advantages would include __________ a) Less memory b) More time c) Finds a solution in large infinite space d) Less memory & Finds a solution in large infinite space
Last Answer : d) Less memory & Finds a solution in large infinite space
Description : Which search uses only the linear space for searching? a) Best-first search b) Recursive best-first search c) Depth-first search d) None of the mentioned
Last Answer : b) Recursive best-first search
Description : The time and space complexity of BFS is (For time and space complexity problems consider b as branching factor and d as depth of the search tree.) a) O(bd+1) and O(bd+1) b) O(b2) and O(d2) c) O(d2) and O(b2) d) O(d2) and O(d2)
Last Answer : a) O(bd+1) and O(bd+1)
Description : What is the space complexity of Depth-first search? a) O(b) b) O(bl) c) O(m) d) O(bm)
Last Answer : d) O(bm)
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
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
Description : Write the time & space complexity associated with depth limited search.
Last Answer : Time complexity =O (bd) , b-branching factor, d-depth of tree Space complexity=o (bl)
Description : How many types are available in uninformed search method? a) 3 b) 4 c) 5 d) 6
Last Answer : c) 5
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
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
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
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
Description : What is the problem space of means-end analysis? a) An initial state and one or more goal states b) One or more initial states and one goal state c) One or more initial states and one or more goal state d) One initial state and one goal state
Last Answer : a) An initial state and one or more goal states
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
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
Description : A game can be formally defined as a kind of search problem with the following components. a) Initial State b) Successor Function c) Terminal Test d) All of the mentioned
Last Answer : d) All of the mentioned
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 : 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 : 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 : 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 : 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
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
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
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
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
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
Description : Inheritance Search a) True b) False
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 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
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
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
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
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 : 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 : Adversarial search problems uses ____________ a) Competitive Environment b) Cooperative Environment c) Neither Competitive nor Cooperative Environment d) Only Competitive and Cooperative Environment
Last Answer : a) Competitive Environment
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 : 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