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 : 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 : 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 : _______________ 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 : What are the limitations of the semantic networks? a) Intractability b) Lack in expressing some of the properties c) Incomplete d) Has memory constraints
Last Answer : b) Lack in expressing some of the properties
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
Description : A model of language consists of the categories which does not include? a) Language units b) Role structure of units c) System constraints d) Structural units
Last Answer : d) Structural units
Description : What is the entailment constraints satisfied by EBL?
Last Answer : Hypothesis ^ Description |= classification Background |= Hypothesis
Description : What are the types of constraints?
Last Answer : There are 5 types, a. Unary constraints relates one variable. b. A binary constraint relates two variables. c. Higher order constraints relate more than two variables. d. Absolute constraints. e. Preference constraints.
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 : 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 : 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 : Consider the following conditions : (a) The solution must be feasible, i.e. it must satisfy all the supply and demand constraints. (b) The number of positive allocations must be equal to m+n-1, where m is the number of rows and n is ... B) (a) and (c) only (C) (b) and (c) only (D) (a), (b) and (c)
Last Answer : (D) (a), (b) and (c)
Description : What will happen if a predecessor description is generated that is satisfied by the initial state of the planning problem? a) Success b) Error c) Compilation d) Termination
Last Answer : d) Termination
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 : 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 : 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 : 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 : 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 : 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 : 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 : 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 : 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 : 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
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 : Web Crawler is a/an ____________ a) Intelligent goal-based agent b) Problem-solving agent
Last Answer : a) Intelligent goal-based agent
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 : Shaping teaching techniques to fit the learning patterns of individual students is the goal of __________ a) decision support b) automatic programming c) intelligent computer-assisted instruction d) expert systems
Last Answer : c) intelligent computer-assisted instruction
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 ____ the goal is for the software to use what it has learned in one area to solve problems in other areas. A. Machine Learning B. Deep Learning C. Neural Networks D. None of these
Last Answer : B. Deep Learning
Description : In a backward chaining system you start with the initial facts, and keep using the rules to draw new conclusions (or take certain actions) given those facts. a) True b) False
Last Answer : b) False
Description : Generality is the measure of _____________ a) Ease with which the method can be adapted to different domains of application b) The average time required to construct the target knowledge structures ... unreliable feedback and with a variety of training examples d) The overall power of the system
Last Answer : a) Ease with which the method can be adapted to different domains of application
Description : Ability to learn how to do tasks based on the data given for training or initial experience A. Self Organization B. Adaptive Learning C. Fault tolerance D. Robustness
Last Answer : B. Adaptive Learning
Description : Planning is a ------------ process A. Goal Oriented B. Flexible C. Time bound D. All of these
Last Answer : D. All of these
Description : The room temperature is hot. Here the hot (use of linguistic variable is used) can be represented by _______ a) Fuzzy Set b) Crisp Set c) Fuzzy & Crisp Set d) None of the mentioned
Last Answer : a) Fuzzy Set
Description : A Horn clause is a clause with _______ positive literal. a) At least one b) At most one c) None d) All
Last Answer : b) At most one
Description : Wumpus World is a classic problem, best example of _______ a) Single player Game b) Two player Game c) Reasoning with Knowledge d) Knowledge based Game
Last Answer : c) Reasoning with Knowledge
Description : The _______ is a touring problem in which each city must be visited exactly once. The aim is to find the shortest tour. a) Finding shortest path between a source and a destination b) Travelling ... c) Map coloring problem d) Depth first search traversal on a given map represented as a graph
Last Answer : b) Travelling Salesman problem
Description : The room temperature is hot. Here the hot (use of linguistic variable is used) can be represented by _______ . a) Fuzzy Set b) Crisp Set
Description : Charles Babbage and Boole who demonstrate the power of _______ A. Logic B. Computation logic C. Cognition logic D. All of above
Last Answer : B. Computation logic
Description : Flexible shafts have _______ rigidity in torsion making them flexible. a) Low b) High c) Very high d) Infinitely small
Last Answer : b) High
Description : Assume that a firm has accurately calculated the net cash flows relating to two mutua lly exclusive investment proposals. If the net present value of both proposals exceed zero and the firm is ... maximize shareholder wealth and, since the projects are mutually exclusive, we can only take one
Last Answer : D. accept the proposal that has the largest NPV since the goal of the firm is to maximize shareholder wealth and, since the projects are mutually exclusive, we can only take one