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 : Decision support programs are designed to help managers make __________ a) budget projections b) visual presentations c) business decisions d) vacation schedules
Last Answer : c) business decisions
Description : Which of the following are the advantage/s of Decision Trees? a) Possible Scenarios can be added b) Use a white box model, If given result is provided by a model c) Worst, best and expected values can be determined for different scenarios d) All of the mentioned
Last Answer : d) All of the mentioned
Description : Decision Nodes are represented by ____________ a) Disks b) Squares c) Circles d) Triangles
Last Answer : b) Squares
Description : Choose from the following that are Decision Tree nodes? a) Decision Nodes b) End Nodes c) Chance Nodes d) All of the mentioned
Description : Decision Trees can be used for Classification Tasks. a) True b) False
Last Answer : a) True
Description : What is Decision Tree? a) Flow-Chart b) Structure in which internal node represents test on an attribute, each branch represents outcome of test and each leaf node represents class label c) ... branch represents outcome of test and each leaf node represents class label d) None of the mentioned
Last Answer : c) Flow-Chart & Structure in which internal node represents test on an attribute, each branch represents outcome of test and each leaf node represents class label
Description : Decision Tree is a display of an algorithm. a) True b) False
Description : A _________ is a decision support tool that uses a tree-like graph or model of decisions and their possible consequences, including chance event outcomes, resource costs, and utility. a) Decision tree b) Graphs c) Trees d) Neural Networks
Last Answer : a) Decision tree
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 : What takes input as an object described by a set of attributes? a) Tree b) Graph c) Decision graph d) Decision tree
Last Answer : d) Decision tree
Description : Which modifies the performance element so that it makes better decision? a) Performance element b) Changing element c) Learning element d) None of the mentioned
Last Answer : c) Learning element
Description : Which is true for Decision theory? a) Decision Theory = Probability theory + utility theory b) Decision Theory = Inference theory + utility theory c) Decision Theory = Uncertainty + utility theory d) Decision Theory = Probability theory + preference
Last Answer : c) Decision Theory = Uncertainty + utility theory
Description : Which of the following is an extension of the semantic network? a) Expert Systems b) Rule Based Expert Systems c) Decision Tree Based networks d) Partitioned Networks
Last Answer : d) Partitioned Networks
Description : Which of the following are the applications of Expert systems? a) Disease Diagnosis b) Planning and Scheduling c) Decision making d) All of the mentioned
Description : Which search is equal to minimax search but eliminates the branches that can’t influence the final decision? a) Depth-first search b) Breadth-first search c) Alpha-beta pruning d) None of the mentioned
Last Answer : c) Alpha-beta pruning
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
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 : 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 : 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 : 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 : How the decision tree reaches its decision? a) Single test b) Two test c) Sequence of test d) No test
Last Answer : c) Sequence of test
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 : Which of the following is the model used for learning? a) Decision trees b) Neural networks c) Propositional and FOL rules d) All of the mentioned
Description : Mention the exercises which broaden the applications of decision trees.
Last Answer : i. Missing data ii. Multivalued attributes iii. Continuous and integer valued input attributes iv. Continuous valued output attributes.
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 : For general graph, how one can get rid of repeated states? a) By maintaining a list of visited vertices b) By maintaining a list of traversed edges c) By maintaining a list of non-visited vertices d) By maintaining a list of non-traversed edges
Last Answer : a) By maintaining a list of visited vertices
Description : In LISP, what is the function (list-length )? a) returns a new list that is equal to <:list> by copying the top-level element of b) returns the length of c) returns t if is empty d) all of the mentioned
Last Answer : b) returns the length of
Description : In LISP, the function (copy-list ) a) returns a new list that is equal to by copying the top-level element of b) returns the length of c) returns t if is empty d) all of the mentioned
Last Answer : a) returns a new list that is equal to by copying the top-level element of
Description : In LISP, the function returns the list that results after the first element is removed (the rest f the list), is __________ a) car b) last c) cons d) cdr
Last Answer : d) cdr
Description : List some properties of SMA* search.
Last Answer : * It will utilize whatever memory is made available to it. * It avoids repeated states as for as its memory allow. * It is complete if the available memory is sufficient to store ... available for entire search tree, the search is optimally efficient. *Hill climbing. *Simulated annealing.
Description : List some drawbacks of hill climbing process.
Last Answer : Local maxima: A local maxima as opposed to a goal maximum is a peak that is lower that the highest peak in the state space. Once a local maxima is reached the algorithm will halt even though ... of the state space where the evaluation fn is essentially flat. The search will conduct a random walk.
Description : List the various informed search strategy.
Last Answer : Best first search –greedy search ,A* search Memory bounded search-Iterative deepening A*search -simplified memory bounded A*search -Iterative improvement search –hill climbing -simulated annealing
Description : List the various search strategies.
Last Answer : a. BFS b. Uniform cost search c. DFS d. Depth limited search e. Iterative deepening search f. Bidirectional search
Description : List the performance measures of search strategies.
Last Answer : i. Completeness ii. Optimality iii. Time complexity iv. Space complexity
Description : List the steps involved in simple problem solving technique.
Last Answer : i. Goal formulation ii. Problem formulation iii. Search iv. Solution v. Execution phase
Description : List the properties of environments.
Last Answer : o Fully Observable Vs Partially Observable o Deterministic Vs Stochastic o Episodic Vs Sequential o Static Vs Dynamic o Discrete Vs Continuous o Single Agent Vs Multi agent a. Competitive Multi agent b.Co – operative Multi agent
Description : List the various type of agent program.
Last Answer : Simple reflex agent program. Agent that keep track of the world. Goal based agent program. Utility based agent program
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).