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
Last Answer : a) True
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 : Which of the Following problems can be modeled as CSP? a) 8-Puzzle problem b) 8-Queen problem c) Map coloring problem d) All of the mentioned
Last Answer : d) All of the mentioned
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
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 : 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
Description : Constraint Propagation technique actually modifies the CSP problem. a) True b) False
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 : Define CSP.
Last Answer : Constraint Satisfaction problem (CSP) is defined by a set of variables X1,X2,…Xn and set of constraints C1,C2,…Cm.
Description : Which reveals an improvement in online smoothing? a) Matrix formulation b) Revelation c) HMM d) None of the mentioned
Last Answer : a) Matrix formulation
Description : ____________ is/are useful when the original formulation of a problem is altered in some way, typically because the set of constraints to consider evolves because of the environment. a) Static CSPs b) Dynamic CSPs c) Flexible CSPs d) None of the mentioned
Last Answer : b) Dynamic CSPs
Description : Define Successor function.
Last Answer : A value can be assigned to any unassigned variable, provided that does not conflict with previously assigned variables.
Description : The minimax algorithm computes the minimax decision from the current state. It uses a simple recursive computation of the minimax values of each successor state, directly implementing the defining equations. The ... are backed up through the tree as the recursion unwinds. a) True b) False
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
Description : Which of the following is the component of learning system? a) Goal b) Model c) Learning rules d) All of the mentioned
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 : 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 : 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 : 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 : When do we call the states are safely explorable? a) A goal state is unreachable from any state b) A goal state is denied access c) A goal state is reachable from every state d) None of the mentioned
Last Answer : c) A goal state is reachable from every state
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 is the evaluation function in A* approach? a) Heuristic function b) Path cost from start node to current node c) Path cost from start node to current node + Heuristic cost d) Average of Path cost from start node to current node and Heuristic cost
Last Answer : c) Path cost from start node to current node + Heuristic cost
Description : What is the evaluation function in greedy approach? a) Heuristic function b) Path cost from start node to current node c) Path cost from start node to current node + Heuristic cost d) Average of Path cost from start node to current node and Heuristic cost
Last Answer : a) Heuristic function
Description : Which of the following elements constitutes the frame structure? a) Facts or Data b) Procedures and default values c) Frame names d) Frame reference in hierarchy
Last Answer : a) Facts or Data
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* 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 : 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 : NC contouring is an example of a.Continuous path positioning b.Point-to-point positioning c.Absolute positioning d.Incremental positioning
Last Answer : a.Continuous path positioning
Description : An electric field is given as E = 6y 2 z i + 12xyz j + 6xy 2 k. An incremental path is given by dl = -3 i + 5 j – 2 k mm. The work done in moving a 2mC charge along the path if the location of the path is at p(0,2,5) is (in Joule) a) 0.64 b) 0.72 c) 0.78 d) 0.80
Last Answer : b) 0.72
Description : Which is used to choose among multiple consistent hypotheses? a) Razor b) Ockham razor c) Learning element d) None of the mentioned
Last Answer : b) Ockham razor
Description : Which among the following could the Existential instantiation of ∃x Crown(x) ^ OnHead(x, Johnny)? a) Crown(John) ^ OnHead(John, Jonny) b) Crown(y) ^ OnHead(y, y, x) c) Crown(x) ^ OnHead(x, Jonny) d) None of the mentioned
Last Answer : a) Crown(John) ^ OnHead(John, Jonny)
Description : What among the following could the universal instantiation of ___________ For all x King(x) ^ Greedy(x) => Evil(x) a) King(John) ^ Greedy(John) => Evil(John) b) King(y) ^ Greedy(y) => Evil(y) c) King(Richard) ^ Greedy(Richard) => Evil(Richard) d) All of the mentioned
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 : Any node is the path from the root to the node is called A) Successor node B) Ancestor node C) Internal node D) None of the above
Last Answer : B) Ancestor node
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 : Define Path Cost.
Last Answer : A function that assigns a numeric cost to each path, which is the sum of the cost of the each action along the path.
Description : ______________ is the analysis of costs and benefits of a proposed project with the goal of assuming a rational allocation of limited funds. A. Project formulation. B. Project evaluation. C. Project appraisal . D. Project Design.
Last Answer : C. Project appraisal .
Description : what is heuristic function A : Lowest path cost B : Cheapest path from root to goal node C : Average path cost D : Estimated cost of cheapest path from root to goal node
Last Answer : D : Estimated cost of cheapest path from root to goal node
Description : In , the coordinates are mentioned in the program with respect to onePrevious point. a.Incremental System b.Absolute System c.Datum System d.Screen Coordinates System
Last Answer : a.Incremental System
Description : In , the coordinates are mentioned in the program with respect to onereference point a.Incremental System b.Absolute System c.Datum System d.Screen Coordinates System
Last Answer : b.Absolute System
Description : Which of the following backup technique is most space efficient? a) Full backup b) Incremental backup c) Differential backup d) All of the mentioned
Last Answer : Incremental backup
Description : When a top-level function is entered, the LISP processor does? a) It reads the function entered b) It prints the result returned by the function c) Large memory and high-speed processor d) All of the mentioned
Last Answer : b) It prints the result returned by the function
Description : In LISP, which of the following function assigns the value 10 to the symbol a? a) (setq a 10) b) (a = b) where b = 10 c) (a = 10) (d) (setq 10 a) d) All of the mentioned
Last Answer : a) (setq a 10)