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 : 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 : The famous spare tire problem or Scheduling classes for bunch of students or Air cargo transport are the best example of ____________ a) Planning problem b) Partial Order planning problem c) Total order planning d) None of the mentioned
Last Answer : a) Planning problem
Description : The process by which the brain orders actions needed to complete a specific task is referred as ____________ a) Planning problem b) Partial order planning c) Total order planning d) Both Planning problem & Partial order planning
Last Answer : d) Both Planning problem & Partial order planning
Description : Which algorithm places two actions into a plan without specifying which should come first? a) Full-order planner b) Total-order planner c) Semi-order planner d) Partial-order planner
Last Answer : d) Partial-order planner
Description : Sussman Anomaly can be easily and efficiently solved by partial order planning. a) True b) False
Last Answer : a) True
Description : Partial-order planning is the opposite of total-order planning. a) True b) False
Description : Partial-order planning exhibits the Principle of Least Commitment, which contributes to the efficiency of this planning system as a whole. a) True b) False
Description : In partial order plan. A. Relationships between the actions of the behavior are set prior to the actions B. Relationships between the actions of the behavior are not set until absolutely necessary Choose the ... ) Either A or B can be true depending upon situation d) Neither A nor B is true
Last Answer : a) A is true
Description : The process by which the brain incrementally orders actions needed to complete a specific task is referred as ______________ a) Planning problem b) Partial order planning c) Total order planning d) Both Planning problem & Partial order planning
Last Answer : b) Partial order planning
Description : What is the other name of each and every total-order plans? a) Polarization b) Linearization c) Solarization d) None of the mentioned
Description : Fuzzy logic is extension of Crisp set with an extension of handling the concept of Partial Truth. a) True b) False
Description : How the compactness of the bayesian network can be described? a) Locally structured b) Fully structured c) Partial structure d) All of the mentioned
Last Answer : a) Locally structured
Description : What does the bayesian network provides? a) Complete description of the domain b) Partial description of the domain c) Complete description of the problem d) None of the mentioned
Last Answer : a) Complete description of the domain
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 : What kind of environment is strategic in artificial intelligence? a) Deterministic b) Rational c) Partial d) Stochastic
Last Answer : a) Deterministic
Description : What kind of observing environments are present in artificial intelligence? a) Partial b) Fully c) Learning d) Both Partial & Fully
Last Answer : d) Both Partial & Fully
Description : What does the Bayesian network provides? a) Complete description of the domain b) Partial description of the domain c) Complete description of the problem d) None 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 : Conditional Plans allows the agent to sense the world during execution to decide what branch of plan to follow. a) True b) False
Description : Which of the following task/tasks Artificial Intelligence could not do yet? a) Understand natural language robustly b) Web mining c) Construction of plans in real time dynamic systems d) All of the mentioned
Last Answer : d) All of the mentioned
Description : How many types are available in uninformed search method? a) 3 b) 4 c) 5 d) 6
Last Answer : c) 5
Description : An algorithm A is admissible if ___________ a) It is not guaranteed to return an optimal solution when one exists b) It is guaranteed to return an optimal solution when one exists c) It returns more solutions, but not an optimal one d) It guarantees to return more optimal solutions
Last Answer : b) It is guaranteed to return an optimal solution when one exists
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 : An algorithm is complete if ____________ a) It terminates with a solution when one exists b) It starts with a solution c) It does not terminate with a solution d) It has a loop
Last Answer : a) It terminates with a solution when one exists
Description : ____________ are algorithms that learn from their more complex environments (hence eco) to generalize, approximate and simplify solution logic. a) Fuzzy Relational DB b) Ecorithms c) Fuzzy Set d) None of the mentioned
Last Answer : c) Fuzzy Set
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 : 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 : A solution to a problem is a path from the initial state to a goal state. Solution quality is measured by the path cost function, and an optimal solution has the highest path cost among all solutions. a) True b) False
Description : A search algorithm takes _________ as an input and returns ________ as an output. a) Input, output b) Problem, solution c) Solution, problem d) Parameters, sequence of actions
Last Answer : b) Problem, solution
Description : What is the action of task environment in artificial intelligence? a) Problem b) Solution c) Agent d) Observation
Last Answer : a) Problem
Description : What is meant by simulated annealing in artificial intelligence? a) Returns an optimal solution when there is a proper cooling schedule b) Returns an optimal solution when there is no proper cooling ... not return an optimal solution when there is a proper cooling schedule d) None of the mentioned
Last Answer : a) Returns an optimal solution when there is a proper cooling schedule
Description : Third component of a planning system is to ___________ a) Detect when a solution has been found b) Detect when solution will be found c) Detect whether solution exists or not d) Detect whether multiple solutions exist
Last Answer : a) Detect when a solution has been found
Description : ______ are algorithms that learn from their more complex environments (hence eco) to generalize, approximate and simplify solution logic. a) Fuzzy Relational DB b) Ecorithms c) Fuzzy Set d) None of the mentioned
Description : Define a solution
Last Answer : A solution is defined as a plan that an agent can execute and that guarantees the achievement of goal.
Description : How many kinds of reflection are available in image perception? a) 1 b) 2 c) 3
Last Answer : b) 2
Description : How many objects are available in closed classes? a) 1 b) 2 c) 3 d) 4
Last Answer : d) 4
Description : How many literals are available in top-down inductive learning methods? a) 1 b) 2 c) 3 d) 4
Last Answer : c) 3
Description : How many reasons are available for the popularity of ILP? a) 1 b) 2 c) 3 d) 4
Description : How many types are available in machine learning? a) 1 b) 2 c) 3 d) 4
Description : How many types of random variables are available? a) 1 b) 2 c) 3 d) 4
Description : How many issues are available in describing degree of belief? a) 1 b) 2 c) 3 d) 4
Description : How many types of quantification are available in artificial intelligence? a) 1 b) 2 c) 3 d) 4
Description : How many conditions are available between two actions in mutex relation? a) 1 b) 2 c) 3 d) 4
Description : How many functions are available in the unification and lifting process? a) 1 b) 2 c) 3 d) 4
Description : What kind of clauses are available in Conjunctive Normal Form? a) Disjunction of literals b) Disjunction of variables c) Conjunction of literals d) Conjunction of variables
Last Answer : a) Disjunction of literals
Description : How many states are available in state-space search? a) 1 b) 2 c) 3 d) 4
Description : How many ways are available to solve the state-space search? a) 1 b) 2 c) 3 d) 4