How the decision tree reaches its decision?
a) Single test
b) Two test
c) Sequence of test
d) No test

1 Answer

Answer :

c) Sequence of test

Related questions

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 : Choose from the following that are Decision Tree nodes? a) Decision Nodes b) End Nodes c) Chance Nodes d) All of the mentioned

Last Answer : d) All of the mentioned

Description : Decision Tree is a display of an algorithm. a) True b) False

Last Answer : a) True

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 : 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 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 : 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 : 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 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 is true regarding BFS (Breadth First Search)? a) BFS will get trapped exploring a single path b) The entire tree so far been generated must be stored in BFS c) BFS is not guaranteed to find a solution if exists d) BFS is nothing but Binary First Search

Last Answer : b) The entire tree so far been generated must be stored in BFS

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 : Decision Trees can be used for Classification Tasks. a) True b) False

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

Last Answer : d) All of the mentioned

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 are the applications of Expert systems? a) Disease Diagnosis b) Planning and Scheduling c) Decision making d) All of the mentioned

Last Answer : 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 : 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 : 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 : 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 : 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 : 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 : 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

Last Answer : d) All of the mentioned

Description : Define Decision list.

Last Answer : It is a logical expression of a restricted form, It consists of a series of tests, each of which conjunction of literals. If test succeeds, value is returned. If test fails, processing continues with the next test in the list.

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 : A production rule consists of ____________ a) A set of Rule b) A sequence of steps c) Set of Rule & sequence of steps d) Arbitrary representation to problem

Last Answer : c) Set of Rule & sequence of steps

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

Description : The problem-solving agent with several immediate options of unknown value can decide what to do by just examining different possible sequences of actions that lead to states of known value, and then choosing the ... . This process of looking for such a sequence is called Search. a) True b) False

Last Answer : a) True

Description : What is the main task of a problem-solving agent? a) Solve the given problem and reach to goal b) To find out which sequence of action will get it to the goal state c) All of the mentioned d) None of the mentioned

Last Answer : c) All of the mentioned

Description : An agent is composed of ________ a) Architecture b) Agent Function c) Perception Sequence d) Architecture and Program

Last Answer : d) Architecture and Program

Description : Agents behavior can be best described by ____________ a) Perception sequence b) Agent function c) Sensors and Actuators d) Environment in which agent is performing

Last Answer : b) Agent function

Description : What is meant by agent’s percept sequence? a) Used to perceive the environment b) Complete history of actuator c) Complete history of perceived things d) None of the mentioned

Last Answer : c) Complete history of perceived things

Description : Define Percept Sequence. 

Last Answer : An agent’s choice of action at any given instant can depend on the entire percept sequence observed to elate.

Description : An AC generator panel is fitted with both synchronizing lamps and a synchroscope. When the synchroscope pointer reaches the noon position, one synchronizing light is bright and the other is dark. This ... sequence is incorrect C. the phase sequence is correct D. the generator breaker may be closed

Last Answer : Answer: B

Description : What is an auto-associative network? a) a neural network that contains no loops b) a neural network that contains feedback c) a neural network that has only one loop d) a single layer feed-forward neural network with pre-processing

Last Answer : b) a neural network that contains feedback

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 : An auto-associative network is: a) a neural network that contains no loops b) a neural network that contains feedback c) a neural network that has only one loop d) a single layer feed-forward neural network with pre-processing

Last Answer : b) a neural network that contains feedback

Description : How many ALU(s) is/are control by one control unit is SIMD (single instruction stream, multiple data stream) architecture? a) one or more ALUs b) One ALU c) Only two ALU d) Impossible to say

Last Answer : a) one or more ALUs

Description : Which of the following is true? Single layer associative neural networks do not have the ability to: (i) perform pattern recognition (ii) find the parity of a picture (iii)determine whether two or more shapes in ... ) are true b) (ii) is true c) All of the mentioned d) None of the mentioned

Last Answer : a) (ii) and (iii) are true

Description : Wumpus World is a classic problem, best example of _______ a) Single player Game b) Two player Game c) Reasoning with Knowledge d) Knowledge based Game

Last Answer : c) Reasoning with Knowledge

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

Last Answer : a) True

Description : Which of the following is true? Single layer associative neural networks do not have the ability to: (i) perform pattern recognition (ii) find the parity of a picture (iii)determine whether two or more shapes in a ... ) are true b) (ii) is true c) All of the mentioned d) None of the mentioned

Last Answer : a) (ii) and (iii) are true

Description : Why is the XOR problem exceptionally interesting to neural network researchers? a) Because it can be expressed in a way that allows you to use a neural network b) Because it is complex ... solved by a single layer perceptron d) Because it is the simplest linearly inseparable problem that exists.

Last Answer : d) Because it is the simplest linearly inseparable problem that exists.

Description : What is perceptron? a) a single layer feed-forward neural network with pre-processing b) an auto-associative neural network c) a double layer auto-associative neural network d) a neural network that contains feedback

Last Answer : a) a single layer feed-forward neural network with pre-processing

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 : 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