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
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 complete, local search algorithm always finds goal if one exists, an optimal algorithm always finds a global minimum/maximum. a) True b) False
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 : The name best-first search is a venerable but inaccurate one. After all, if we could really expand the best node first, it would not be a search at all; it would be a straight march to the ... is choose the node that appears to be best according to the evaluation function. a) True b) False
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
Last Answer : 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 : The main idea of Bidirectional search is to reduce the time complexity by searching two way simultaneously from start node and another from goal node. a) True b) False
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 : 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 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 : Uncertainty arises in the wumpus world because the agent’s sensors give only ___________ a) Full & Global information b) Partial & Global Information c) Partial & local Information d) Full & local information
Last Answer : c) Partial & local Information
Description : Which approach is to pretend that a pure divide and conquer algorithm will work? a) Goal independence b) Subgoal independence c) Both Goal & Subgoal independence d) None of the mentioned
Last Answer : b) Subgoal independence
Description : Searching using query on Internet is, use of ___________ type of agent. a) Offline agent b) Online agent c) Both Offline & Online agent d) Goal Based & Online agent
Last Answer : d) Goal Based & Online agent
Description : Selective retention occurs when? a) we process, store, and retrieve information that we have already selected, organized, and interpreted b) we make choices to experience particular stimuli c ... choices to avoid particular stimuli d) we focus on specific stimuli while ignoring other stimuli
Last Answer : a) we process, store, and retrieve information that we have already selected, organized, and interpreted
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 : 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 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
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 : 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 search is complete and optimal when h(n) is consistent? a) Best-first search b) Depth-first search c) Both Best-first & Depth-first search d) A* search
Last Answer : d) A* search
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*
Description : Which provides agents with information about the world they inhabit? a) Sense b) Perception c) Reading d) Hearing
Last Answer : b) Perception
Description : Which cannot be represented by a set of attributes? a) Program b) Three-dimensional configuration of a protein molecule c) Agents
Last Answer : b) Three-dimensional configuration of a protein molecule
Description : Zero sum games are the one in which there are two agents whose actions must alternate and in which the utility values at the end of the game are always the same. a) True b) False
Last Answer : b) False
Description : Mathematical game theory, a branch of economics, views any multi-agent environment as a game provided that the impact of each agent on the others is “significant,” regardless of whether the agents are cooperative or competitive. a) True b) False
Description : Which were built in such a way that humans had to supply the inputs and interpret the outputs? a) Agents b) AI system c) Sensor d) Actuators
Last Answer : b) AI system
Description : What is rational at any given time depends on? a) The performance measure that defines the criterion of success b) The agent’s prior knowledge of the environment c) The actions that the agent can perform d) All of the mentioned
Description : Performance Measures are fixed for all agents. a) True b) False
Description : Agents behavior can be best described by ____________ a) Perception sequence b) Agent function c) Sensors and Actuators d) Environment in which agent is performing
Last Answer : b) Agent function
Description : Which is used to improve the agents performance? a) Perceiving b) Learning c) Observing d) None of the mentioned
Last Answer : b) Learning
Description : What is meant by agent’s percept sequence? a) Used to perceive the environment b) Complete history of actuator c) Complete history of perceived things d) None of the mentioned
Last Answer : c) Complete history of perceived things
Description : What among the following is/are the example of the intelligent agent/agents? a) Human b) Robot c) Autonomous Spacecraft d) All of the mentioned
Description : Incorrect information results in unsatisfied preconditions for actions and plans _____________ detects violations of the preconditions for successful completion of the plan. a) Conditional Plan b) Conformant Planning c) Execution monitoring d) Both Conditional Plan & Execution monitoring
Last Answer : c) Execution monitoring
Description : What are present in the empty plan? a) Start b) Finish c) Modest d) Both Start & Finish
Last Answer : d) Both Start & Finish
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 : 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
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 : Best-First search is a type of informed search, which uses ________________ to choose the best next node for expansion. a) Evaluation function returning lowest evaluation b) Evaluation function ... c) Evaluation function returning lowest & highest evaluation d) None of them is applicable
Last Answer : a) Evaluation function returning lowest evaluation
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 : 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 : What are the 3 mechanism to achieve performance improvement?
Last Answer : i. Relevance feedback ii. Document classification iii. Document clustering
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 : Which of the following is the component of learning system? a) Goal b) Model c) Learning rules d) All of the mentioned
Description : Forward chaining systems are _____________ where as backward chaining systems are ___________ a) Goal-driven, goal-driven b) Goal-driven, data-driven c) Data-driven, goal-driven d) Data-driven, data-driven
Last Answer : c) Data-driven, goal-driven
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
Description : Flexible CSPs relax on _______ a) Constraints b) Current State c) Initial State d) Goal State
Last Answer : a) Constraints
Description : What among the following constitutes to the incremental formulation of CSP? a) Path cost b) Goal cost c) Successor function d) All of the mentioned
Description : A* is optimal if h(n) is an admissible heuristic-that is, provided that h(n) never underestimates the cost to reach the goal. a) True b) False
Description : Heuristic function h(n) is ________ a) Lowest path cost b) Cheapest path from root to goal node c) Estimated cost of cheapest path from root to goal node d) Average path cost
Last Answer : c) Estimated cost of cheapest path from root to goal node