Description : What form of negation does the prolog allows? a) Negation as failure b) Proposition c) Substitution d) Negation as success
Last Answer : a) Negation as failure
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 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 : 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
Last Answer : a) True
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 : Which is not the commonly used programming language for AI? a) PROLOG b) Java c) LISP d) Perl
Last Answer : d) Perl
Description : MLMenu, a natural language interface for the TI Explorer, is similar to __________ a) Ethernet b) NaturalLink c) PROLOG d) The Personal Consultant
Last Answer : b) NaturalLink
Description : Prolog is A. A programming language based on logic B. A computer where each processor has its own operating system, its own memory, and its own hard disk C. Describes the structure of the contents of a database D. None of these
Last Answer : A. A programming language based on logic
Description : Define Prolog program
Last Answer : It is a set of definite clauses written in a notation somewhat different from standard FOL.
Description : Which is not the commonly used programming language for AI? A. PROLOG B. LISP C. Perl D. Java script
Last Answer : C. Perl
Description : ______ that deals with the interaction between computers and humans using the natural language A. LISP B. ELIZA C. PROLOG D. NLP
Last Answer : D. NLP
Description : Symbols, symbolic expressions and computing with those is at the core of ______ A. LISP B. ELIZA C. PROLOG D. NLP
Last Answer : A. LISP A. LISP
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 : PROLOG, LISP, NLP are the language of ____ A. Artificial Intelligence B. Machine Learning C. Internet of Things D. Deep Learning
Last Answer : A. Artificial Intelligence
Description : PROLOG is an AI programming language which solves problems with a form of symbolic logic known as ______. A. Propositional logic B. Tautology C. Predicate calculus D. Temporal logic
Last Answer : C. Predicate calculus
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 can operate over the joint state space? a) Decision-making algorithm b) Learning algorithm c) Complex algorithm d) Both Decision-making & Learning algorithm
Last Answer : d) Both Decision-making & Learning algorithm
Description : How the new states are generated in genetic algorithm? a) Composition b) Mutation c) Cross-over d) Both Mutation & Cross-over
Last Answer : d) Both Mutation & Cross-over
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 : How many functions are available in the unification and lifting process? a) 1 b) 2 c) 3 d) 4
Last Answer : d) 4
Description : Which process makes different logical expression looks identical? a) Lifting b) Unification c) Inference process d) None of the mentioned
Last Answer : b) Unification
Description : Lifted inference rules require finding substitutions that make different logical expressions looks identical. a) Existential Instantiation b) Universal Instantiation c) Unification d) Modus Ponen
Last Answer : c) Unification
Description : Define Unification.
Last Answer : Lifted Inference rule require finding substitutions that make different logical expressions look identical (same). This is called Unification.
Description : Which is a refutation complete inference procedure for propositional logic? a) Clauses b) Variables c) Propositional resolution d) Proposition
Last Answer : c) Propositional resolution
Description : How many proposition symbols are there in artificial intelligence? a) 1 b) 2 c) 3 d) 4
Last Answer : b) 2
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 : Define Occur check.
Last Answer : When matching a variable in 2 expressions against a complex term, one must check whether the variable itself occurs inside the term, If it does the match fails. This is called occur check.
Description : Which variable can give the concrete form to the representation of the transition model? a) Single variable b) Discrete state variable c) Random variable d) Both Single & Discrete state variable
Last Answer : d) Both Single & Discrete state variable
Description : Which variable cannot be written in entire distribution as a table? a) Discrete b) Continuous c) Both Discrete & Continuous d) None of the mentioned
Last Answer : b) Continuous
Description : Which of the following is false for the programming language PROLOG? (A) A PROLOG variable can only be assigned to a value once (B) PROLOG is a Strongly Typed Language. (C) The scope of a variable in PROLOG is a single clause or rule. (D) the scope of a variable in PROLOG is a Single Query
Last Answer : (B) PROLOG is a Strongly Typed Language.
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 : 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 : 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 : Which allows for a simple and matrix implementation of all the basic algorithm? a) HMM b) Restricted structure of HMM c) Temporary model
Last Answer : b) Restricted structure of HMM
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 : __________ 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 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 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 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 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