Description : ___ is one of the fundamental combinatorial optimization problems a. Assignment problem b. Transportation problem c. Optimization problem d. None of the above
Last Answer : a. Assignment problem
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 : 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 : An AI system developed by Daniel Bobrow to read and solve algebra word problems. a) SHRDLU b) SIMD c) BACON d) STUDENT
Last Answer : d) STUDENT
Description : Planning graphs works only for prepositional planning problems. a) True b) False
Last Answer : a) True
Description : Adversarial search problems uses ____________ a) Competitive Environment b) Cooperative Environment c) Neither Competitive nor Cooperative Environment d) Only Competitive and Cooperative Environment
Last Answer : a) Competitive Environment
Description : Constraint satisfaction problems on finite domains are typically solved using a form of ___________ a) Search Algorithms b) Heuristic Search Algorithms c) Greedy Search Algorithms d) All of the mentioned
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
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 : The time and space complexity of BFS is (For time and space complexity problems consider b as branching factor and d as depth of the search tree.) a) O(bd+1) and O(bd+1) b) O(b2) and O(d2) c) O(d2) and O(b2) d) O(d2) and O(d2)
Last Answer : a) O(bd+1) and O(bd+1)
Description : People overcome natural language problems by _____________ a) grouping attributes into frames b) understanding ideas in context c) identifying with familiar situations d) both understanding ideas in context & identifying with familiar situations
Last Answer : d) both understanding ideas in context & identifying with familiar situations
Description : Membership function can be thought of as a technique to solve empirical problems on the basis of A. knowledge B. examples C. learning D. experience
Last Answer : D. experience
Description : ANN is composed of large number of highly interconnected processing elements(neurons) working in unison to solve problems. A. True B. False C. D.
Last Answer : A. True
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
Description : Having multiple perceptrons can actually solve the XOR problem satisfactorily: this is because each perceptron can partition off a linear part of the space itself, and they can then combine their results. ... have to be explicitly hand-coded d) False - just having a single perceptron is enough
Last Answer : c) True – perceptrons can do this but are unable to learn to do it – they have to be explicitly hand-coded
Description : Why are linearly separable problems of interest of neural network researchers? a) Because they are the only class of problem that network can solve successfully b) Because they are the only ... mathematical functions that are continue d) Because they are the only mathematical functions you can draw
Last Answer : b) Because they are the only class of problem that Perceptron can solve successfully
Description : What are the two sub problems in discourse understanding?
Last Answer : i. Reference Resolution ii. The structure of coherent discourse.
Description : What are the things that agent knows in online search problems?
Last Answer : a. Actions(s) b. Step cost function C(s, a, s’) c. Goal TEST(s)
Description : What is Released problems?
Last Answer : A problem with fewer restrictions on the actions is called a relaxed problem.
Description : Give example for real world end toy problems.
Last Answer : Real world problem examples: i. Airline travel problem. ii. Touring problem. iii. Traveling salesman problem. iv. VLSI Layout problem v. Robot navigation vi. Automatic Assembly vii. Internet searching Toy problem Examples: Vacuum world problem. 8 – Queen problem 8 – Puzzle problem
Description : Give example problems for Artificial Intelligence.
Last Answer : i. Toy problems ii. Real world problems
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 : 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 : ______ is a branch of computer science which deals with helping machines finds solutions to complex problems in a more human like fashions A. Artificial Intelligence B. Internet of Things C. Embedded System D. Cyber Security
Last Answer : A. Artificial Intelligence
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 : Define Information Extraction.
Last Answer : It is a process of creating database entries by skimming a text and looking for occurrences of a particular class of object.
Description : Define Information Retrieval (IR).
Last Answer : IR is the task of finding documents that are relevant to user’s need for information.
Description : Define Segmentation?
Last Answer : The process of finding the words boundaries in a text with no spaces.
Description : Define Discourse understanding.
Last Answer : A discourage is any string of language usually one that is more than one sentence long.
Description : Define Disambiguation.
Last Answer : The speaker’s aim is to communicate some words in utterance and hearer work is to get back the meaning of the world from the knowledge of situation.
Description : Define Ambiguity.
Last Answer : The sentence that does not provide exact meaning are called ambiguous sentence.
Description : Define Sub categorization.
Last Answer : E 2 eliminates VP by mentioning which phrases can allow which verbs which are known as sub categorization.
Description : Define DCG.
Last Answer : The method of rewriting the existing rules in the grammar by the method of augmentation is called as DCG (Define Clause Grammar).
Description : Define Augmentation.
Last Answer : The process of adding the existing rules of a grammar instead of introducing new rules. It is called Augmentation.
Description : Define Bottom up parsing.
Last Answer : We start from the leaf nodes (i.e.) with the words and search for a tree with root S.
Description : Define Top down parsing.
Last Answer : It starts with root node S and search for a tree that has the words as it leaves.
Description : Define Parsing.
Last Answer : Parsing is the process of finding a parse tree for a given input string. It is also known as syntactic analysis.
Description : Define Semantic Interpretation.
Last Answer : The process of extracting the meaning of an utterance an expression in some representation language.
Description : Define Formal Language.
Last Answer : A formal language is defined as a set of strings of terminal symbols. It is called as words.
Description : Define Language.
Last Answer : Language enables us to communicate most of what we have observed about the environment.
Description : Define Communication.
Last Answer : Communication is the international exchange of information brought about by the production and perception of signs drawn from a shared system of conventional signs.
Description : Define Reification.
Last Answer : The process of treating something abstract and difficult to talk about as though it were concrete and easy to talk about is called as reification.
Description : Define Similarity nets.
Last Answer : Similarity net is an approach for arranging models. Similarity net is a representation in which nodes denotes models, links connect similar models and links are tied to different descriptions.
Description : Define conditional planning.
Last Answer : Conditional planning is a way in which the incompleteness of information is incorporated in terms of adding a conditional step, which involves if – then rules.
Description : Define a consistent plan.
Last Answer : A consistent plan is one in which there are no contradictions in the ordering or binding constraints.
Description : Define a complete plan.
Last Answer : A complete plan is one in which every precondition of every step is achieved by some other step.
Description : Define a solution
Last Answer : A solution is defined as a plan that an agent can execute and that guarantees the achievement of goal.
Description : Define planning.
Last Answer : Planning can be viewed as a type of problem solving in which the agent uses beliefs about actions and their consequences to search for a solution.
Description : Define TD.
Last Answer : Temporal Difference learning: The key of TD is to use the observed transitions to adjust the values of the observed states so that they agree with the constraint equations.
Description : Define Active Learning.
Last Answer : The agent must learn what to do. An agent must experience as much as possible of its environment in order to learn how to behave in it.