Description : A constructive approach in which no commitment is made unless it is necessary to do so, is ____________ a) Least commitment approach b) Most commitment approach c) Nonlinear planning d) Opportunistic planning
Last Answer : a) Least commitment approach
Description : Which strategy is used for delaying a choice during search? a) First commitment b) Least commitment c) Both First & Least commitment d) None of the mentioned
Last Answer : b) Least commitment
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
Last Answer : a) True
Description : Define constructive induction algorithm.
Last Answer : Algorithms that can generate new predicates are called constructive induction algorithms.
Description : Define Epistemological commitment.
Last Answer : The logic that allows the possible states of knowledge with respect to each fact.
Description : Define Ontological commitment.
Last Answer : The difference between propositional and first order logic is in the ontological commitment. It assumes about the nature of reality.
Description : From the following, which method is also called as the Building Block Approach? a.Cellular Decomposition b.Spatial Occupancy Enumeration c.Generalized Sweeps d.Constructive Solid Geometry
Last Answer : d.Constructive Solid Geometry
Description : The lowest level of commitment to international marketing, and also the most flexible approach, is A)a joint venture. B)direct ownership. C)exporting. D)licensing. E)a trading company.
Last Answer : C)exporting.
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 technique is being investigated as an approach to automatic programming? a) generative CAI b) specification by example c) non-hierarchical planning d) all of the mentioned
Last Answer : b) specification by example
Description : Which approach to speech recognition avoids the problem caused by the differences in the way words are pronounced according to context? a) continuous speech recognition b) connected word recognition c) isolated word recognition d) speaker-dependent recognition
Last Answer : c) isolated word recognition
Description : Which approach is used for refining a very general rule through ILP? a) Top-down approach b) Bottom-up approach c) Both Top-down & Bottom-up approach d) None of the mentioned
Last Answer : a) Top-down approach
Description : How is Fuzzy Logic different from conventional control methods? a) IF and THEN Approach b) FOR Approach c) WHILE Approach d) DO Approach
Last Answer : a) IF and THEN Approach
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 : 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 is the best way to go for Game playing problem? a) Linear approach b) Heuristic approach (Some knowledge is stored) c) Random approach d) An Optimal approach
Last Answer : b) Heuristic approach (Some knowledge is stored)
Description : A problem solving approach works well for ______________ a) 8-Puzzle problem b) 8-queen problem c) Finding a optimal path from a given source to a destination d) Mars Hover (Robot Navigation)
Last Answer : d) Mars Hover (Robot Navigation)
Description : A basic line following robot is based on __________ a) Strong Artificial Intelligence approach b) Weak Artificial Intelligence approach c) Cognitive Artificial Intelligence approach d) Applied Artificial Intelligence approach
Last Answer : b) Weak Artificial Intelligence approach
Description : A completely automated chess engine (Learn from previous games) is based on? a) Strong Artificial Intelligence approach b) Weak Artificial Intelligence approach c) Cognitive Artificial Intelligence approach d) Applied Artificial Intelligence approach
Last Answer : a) Strong Artificial Intelligence approach
Description : The Face Recognition system is based on? a) Strong Artificial Intelligence approach b) Weak Artificial Intelligence approach c) Cognitive Artificial Intelligence approach d) Applied Artificial Intelligence approach
Last Answer : d) Applied Artificial Intelligence approach
Description : An Artificial Neural Network Is based on? a) Strong Artificial Intelligence approach b) Weak Artificial Intelligence approach c) Cognitive Artificial Intelligence approach d) Applied Artificial Intelligence approach
Last Answer : c) Cognitive Artificial Intelligence approach
Description : Evolutionary computation is A . Combining different types of method or information B. Approach to the design of learning algorithms that is structured along the lines of the theory of evolution. C. ... the knowledge of an expert formulated in terms of if-then rules. D . None of these
Last Answer : B. Approach to the design of learning algorithms that is structured along the lines of the theory of evolution.
Description : Expert systems A . Combining different types of method or information B. Approach to the design of learning algorithms that is structured along the lines of the theory of evolution C. an information base ... the knowledge of an expert formulated in terms of if-then rules D . None of these
Last Answer : C. an information base filled with the knowledge of an expert formulated in terms of if-then rules
Description : How is Fuzzy Logic different from conventional control methods? a) IF and THEN Approach b) FOR Approach c) WHILE Approach d) DO Approach e) Else If approach
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 : The traveling salesman problem involves n cities with paths connecting the cities. The time taken for traversing through all the cities, without knowing in advance the length of a minimum tour, is ___________ a) O(n) b) O(n2) c) O(n!) d) O(n/2)
Last Answer : c) O(n!)
Description : The area of AI that investigates methods of facilitating communication between people and computers is ___________ a) natural language processing b) symbolic processing c) decision support d) robotics
Last Answer : a) natural language processing
Description : In AI programming, a list may contain ___________ a) cells b) fields c) pointers d) all of the mentioned
Last Answer : d) all of the mentioned
Description : A KES knowledge base contains information in the form of ___________ a) associations b) actions c) free text d) all of the mentioned
Description : The expert system developed at MIT to solve mathematical problems is known as ___________ a) RAND b) ISIS c) MACSYMA d) MOLGEN
Last Answer : c) MACSYMA
Description : In LISP, the atom that stands for “False” is ___________ a) t b) nil c) y d) time
Last Answer : b) nil
Description : Seymour Papert of the MIT AI lab created a programming environment for children called ___________ a) BASIC b) LOGO c) MYCIN d) FORTRAN
Last Answer : b) LOGO
Description : Parts-of-Speech tagging determines ___________ a) part-of-speech for each word dynamically as per meaning of the sentence b) part-of-speech for each word dynamically as per sentence structure c) all part-of-speech for a specific word given as input d) all of the mentioned
Description : Decision trees are appropriate for the problems where ___________ a) Attributes are both numeric and nominal b) Target function takes on a discrete number of values. c) Data may have errors d) All of the mentioned
Last Answer : d) All of the mentioned
Description : In his landmark book Cybernetics, Norbert Wiener suggested a way of modeling scientific phenomena using not energy, but ___________ a) mathematics b) intelligence c) information d) history
Last Answer : c) information
Description : MCC is investigating the improvement of the relationship between people and computers through a technology called ___________ a) computer-aided design b) human factors c) parallel processing d) all of the mentioned
Last Answer : b) human factors
Description : In LISP, the function returns t if is even and nil otherwise ___________ a) (evenp ) b) (even ) c) (numeven ) d) (numnevenp )
Last Answer : a) (evenp )
Description : Fuzzy logic is usually represented as ___________ a) IF-THEN-ELSE rules b) IF-THEN rules c) Both IF-THEN-ELSE rules & IF-THEN rules
Last Answer : b) IF-THEN rules
Description : The values of the set membership is represented by ___________ a) Discrete Set b) Degree of truth c) Probabilities d) Both Degree of truth & Probabilities
Last Answer : b) Degree of truth
Description : If a hypothesis says it should be positive, but in fact it is negative, we call it ___________ a) A consistent hypothesis b) A false negative hypothesis c) A false positive hypothesis d) A specialized hypothesis
Last Answer : c) A false positive hypothesis
Description : A Hybrid Bayesian network contains ___________ a) Both discrete and continuous variables b) Only Discrete variables c) Only Discontinuous variable
Last Answer : a) Both discrete and continuous variables
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 : Standard planning algorithms assumes environment to be ___________ a) Deterministic b) Fully observable c) Single agent d) Stochastic
Last Answer : a) Deterministic
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 : 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 : The adjective first-order distinguishes first-order logic from ___________ in which there are predicates having predicates or functions as arguments, or in which one or both of ... Representational Verification b) Representational Adequacy c) Higher Order Logic d) Inferential Efficiency
Last Answer : c) Higher Order Logic
Description : First Order Logic is also known as ___________ a) First Order Predicate Calculus b) Quantification Theory c) Lower Order Calculus d) All of the mentioned