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 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 : 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 : 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 : ____________ planning allows the agent to take advice from the domain designer in the form of decomposition rules. a) GraphPlan b) Hierarchical task network (HTN) c) SatPlan d) None of the mentioned
Last Answer : b) Hierarchical task network (HTN)
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 : Which is created by using single propositional symbol? a) Complex sentences b) Atomic sentences c) Composition sentences d) None of the mentioned
Last Answer : b) Atomic sentences
Description : What are the composition for agents in artificial intelligence? a) Program b) Architecture c) Both Program & Architecture d) None of the mentioned
Last Answer : c) Both Program & Architecture
Description : What is the advantage of memory bounded search techniques?
Last Answer : We can reduce space requirements of A* with memory bounded algorithm such as IDA* & SMA*.
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 : _______________ 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 : 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 : 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 of the following are the advantage/s of Decision Trees? a) Possible Scenarios can be added b) Use a white box model, If given result is provided by a model c) Worst, best and expected values can be determined for different scenarios d) All of the mentioned
Description : Which of the following is an advantage of using an expert system development tool? a) imposed structure b) knowledge engineering assistance c) rapid prototyping d) all of the mentioned
Last Answer : d) all of the mentioned
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 : 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 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 : 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
Last Answer : b) Depth-first search
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 : 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 : 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 : 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 search method will expand the node that is closest to the goal? a) Best-first search b) Greedy best-first search c) A* search d) None of the mentioned
Last Answer : b) Greedy best-first search
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 : 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 : Which function will select the lowest expansion node at first for evaluation? a) Greedy best-first search b) Best-first search c) Depth-first search d) None of the mentioned
Last Answer : b) Best-first search
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 : 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 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 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
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 : 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 : 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 : Which action sequences are used to achieve the agent’s goal? a) Search b) Plan c) Retrieve d) Both Search & Plan
Last Answer : d) Both Search & Plan
Description : Vector A. It do not need the control of the human operator during their execution B. An arrow in a multi-dimensional space. It is a quantity usually characterized by an ordered set of scalars C. The validation of a theory on the basis of a finite number of examples D. None of these
Last Answer : B. An arrow in a multi-dimensional space. It is a quantity usually characterized by an ordered set of scalars
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 : What is the main task of a problem-solving agent? a) Solve the given problem and reach to goal b) To find out which sequence of action will get it to the goal state c) All of the mentioned d) None of the mentioned
Last Answer : c) All 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
Description : Which variable cannot be written in entire distribution as a table? a) Discrete b) Continuous c) Both Discrete & Continuous d) None of the mentioned
Last Answer : b) Continuous
Description : What is the other name of each plan resulted in partial order planning? a) Polarization b) Linearization c) Solarization d) None of the mentioned
Last Answer : b) Linearization
Description : Which kind of planning consists of successive representations of different levels of a plan? a) hierarchical planning b) non-hierarchical planning c) project planning d) all of the mentioned
Last Answer : a) hierarchical planning
Description : Define Tree decomposition.
Last Answer : The constraint graph is divided into a set of connected sub problems. Each sub problem is solved independently and the resulting solutions are then combined. This process is called tree decomposition.
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 : Consider a problem of preparing a schedule for a class of student. What type of problem is this? a) Search Problem b) Backtrack Problem c) CSP d) Planning Problem
Last Answer : c) CSP
Description : To overcome the need to backtrack in constraint satisfaction problem can be eliminated by ____________ a) Forward Searching b) Constraint Propagation c) Backtrack after a forward search d) Omitting the constraints and focusing only on goals
Last Answer : a) Forward Searching