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 : Where does the additional variables are added in HMM? a) Temporal model b) Reality model c) Probability model d) All of the mentioned
Last Answer : a) Temporal model
Description : Which suggests the existence of an efficient recursive algorithm for online smoothing? a) Matrix b) Constant space c) Constant time d) None of the mentioned
Last Answer : b) Constant space
Description : How does the state of the process is described in HMM? a) Literal b) Single random variable c) Single discrete random variable d) None of the mentioned
Last Answer : c) Single discrete random variable
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
Last Answer : a) True
Description : The BACKTRACKING-SEARCH algorithm in Figure 5.3 has a very simple policy for what to do when a branch of the search fails: back up to the preceding variable and try a different value for it. This is ... also possible to go all the way to set of variable that caused failure. a) True b) False
Description : Which algorithm is used for solving temporal probabilistic reasoning? a) Hill-climbing search b) Hidden markov model c) Depth-first search d) Breadth-first search
Last Answer : b) Hidden markov model
Description : Three main basic features involved in characterizing membership function are A. Intution, Inference, Rank Ordering B. Fuzzy Algorithm, Neural network, Genetic Algorithm C. Core, Support , Boundary D. Weighted Average, center of Sums, Median
Last Answer : C. Core, Support , Boundary
Description : Which data structure is used to give better heuristic estimates? a) Forwards state-space b) Backward state-space c) Planning graph algorithm d) None of the mentioned
Last Answer : c) Planning graph algorithm
Description : Which algorithm is used for matrix multiplication: a. Simple algorithm b. Specific algorithm c. Strassen algorithm d. Addition algorithm
Last Answer : c. Strassen algorithm
Description : Which agent deals with happy and unhappy states? a) Simple reflex agent b) Model based agent c) Learning agent d) Utility based agent
Last Answer : d) Utility based agent
Description : According to the private property defense of the classical model of corporate social responsibility, managers who use corporate funds for projects that are not directly devoted to maximizing ... . Stockholders in publicly traded corporations are better understood as investors rather than owners.
Last Answer : C. Investors buy their stocks with the hope of maximizing return on their investment. D. Stockholders in publicly traded corporations are better understood as investors rather than owners.
Description : Which of the following IS NOT one of the advantages associated with a robotics implementation program? a) Low costs for hardware and software b) Robots work continuously around the clock c) Quality of manufactured goods can be improved d) Reduced company cost for worker fringe benefits
Last Answer : a) Low costs for hardware and software
Description : ______ is used for AI because it supports the implementation of software that computes with symbols very well. A. LISP B. ELIZA C. PROLOG D. NLP
Last Answer : A. LISP
Description : Which is used to capture the internal structure of the phones? a) One-state phone model b) Two-state phone model c) Three-state phone mone d) All of the mentioned
Last Answer : c) Three-state phone mone
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 : 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 : 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 : Decision Tree is a display of an algorithm. a) True b) False
Description : A perceptron is a ______________ a) Feed-forward neural network b) Backpropagation algorithm c) Backtracking algorithm d) Feed Forward-backward algorithm
Last Answer : a) Feed-forward neural network
Description : Which is used for utility functions in game playing algorithm? a) Linear polynomial b) Weighted polynomial c) Polynomial d) Linear weighted polynomial
Last Answer : d) Linear weighted polynomial
Description : __________ algorithm translates a planning problem in to prepositional axioms. a) GraphPlan b) SatPlan c) Greedy d) None of the mentioned
Last Answer : b) SatPlan
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 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 illustrates a weakness of interleaved planning algorithm. a) True b) False
Last Answer : b) False
Description : Which makes the complexity of the entire algorithm quadratic in the size? a) Clause b) Inference c) Resolution d) Occur check
Last Answer : d) Occur check
Description : Which algorithm takes two sentences and returns a unifier? a) Inference b) Hill-climbing search c) Depth-first search d) Unify algorithm
Last Answer : d) Unify algorithm
Description : An inference algorithm that derives only entailed sentences is called sound or truth-preserving. a) True b) False
Description : Which is omitted in prolog unification algorithm? a) Variable check b) Occur check c) Proposition check d) Both Occur & Proposition check
Last Answer : b) Occur check
Description : Which problem can frequently occur in backward chaining algorithm? a) Repeated states b) Incompleteness c) Complexity d) Both Repeated states & Incompleteness
Last Answer : d) Both Repeated states & Incompleteness
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 will backward chaining algorithm will return? a) Additional statements b) Substitutes matching the query c) Logical statement d) All of the mentioned
Last Answer : b) Substitutes matching the query
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 are needed to compute the logical inference algorithm? a) Logical equivalence b) Validity c) Satisfiability d) All of the mentioned
Last Answer : d) All of the mentioned
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 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 : Which is the most straightforward approach for planning algorithm? a) Best-first search b) State-space search c) Depth-first search d) Hill-climbing search
Last Answer : b) State-space search
Description : General algorithm applied on game tree for making decision of win/lose is ____________ a) DFS/BFS Search Algorithms b) Heuristic Search Algorithms c) Greedy Search Algorithms d) MIN/MAX Algorithms
Last Answer : d) MIN/MAX Algorithms
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 : The term ___________ is used for a depth-first search that chooses values for one variable at a time and returns when a variable has no legal values left to assign. a) Forward search b) Backtrack search c) Hill algorithm d) Reverse-Down-Hill search
Last Answer : b) Backtrack search
Description : What are the two main features of Genetic Algorithm? a) Fitness function & Crossover techniques b) Crossover techniques & Random mutation c) Individuals among the population & Random mutation d) Random mutation & Fitness function
Last Answer : a) Fitness function & Crossover techniques
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 : __________ algorithm keeps track of k states rather than just one. a) Hill-Climbing search b) Local Beam search c) Stochastic hill-climbing search d) Random restart hill-climbing search
Last Answer : b) Local Beam search
Description : When will Hill-Climbing algorithm terminate? a) Stopping criterion met b) Global Min/Max is achieved c) No neighbor has higher value d) All of the mentioned
Last Answer : c) No neighbor has higher value
Description : ______________ Is an algorithm, a loop that continually moves in the direction of increasing value – that is uphill. a) Up-Hill Search b) Hill-Climbing c) Hill algorithm d) Reverse-Down-Hill search
Last Answer : b) Hill-Climbing
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* algorithm is based on ___________ a) Breadth-First-Search b) Depth-First –Search c) Best-First-Search d) Hill climbing
Last Answer : c) Best-First-Search
Description : Which search algorithm imposes a fixed depth limit on nodes? a) Depth-limited search b) Depth-first search c) Iterative deepening search d) Bidirectional search
Last Answer : a) Depth-limited search
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 : 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