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

1 Answer

Answer :

d) All of the mentioned

Related questions

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 : 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 : 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 : 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 : 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 : The Set of actions for a problem in a state space is formulated by a ___________ a) Intermediate states b) Initial state c) Successor function, which takes current action and returns next immediate state d) None of the mentioned

Last Answer : c) Successor function, which takes current action and returns next immediate state

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 : The values of the set membership is represented by a) Discrete Set b) Degree of truth c) Probabilities d) Both b & c

Last Answer : b) Degree of truth

Description : Quantitative attributes are A. A reference to the speed of an algorithm, which is quadratically dependent on the size of the data B. Attributes of a database table that can take only numerical values C. Tools designed to query a database D. None of these

Last Answer : B. Attributes of a database table that can take only numerical values

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

Last Answer : d) All of the mentioned

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

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 : Which of the following function returns t if the object is a number in LISP? a) (number ) b) (numberp ) c) (numericp ) d) (numeric )

Last Answer : b) (numberp )

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 : What is meant by probability density function? a) Probability distributions b) Continuous variable c) Discrete variable d) Probability distributions for Continuous variables

Last Answer : d) Probability distributions for Continuous variables

Description : Membership function defines the fuzziness in a fuzzy set irrespective of the elements in the set, which are discrete or continuous. A. True B. False

Last Answer : B. False

Description : What is meant by probability density function? a) Probability distributions b) Continuous variable c) Discrete variable d) Probability distributions for Continuous variables

Last Answer : d) Probability distributions for Continuous variables

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 : 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 : Optimality of BFS is ___________ a) When there is less number of nodes b) When all step costs are equal c) When all step costs are unequal d) None of the mentioned

Last Answer : b) When all step costs are equal

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 : 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 : extendible architecture is A. Modular design of a software application that facilitates the integration of new modules B. Showing a universal law or rule to be invalid by providing a counter example C. ... of attributes in a database table that refers to data in another table D. None of these

Last Answer : A. Modular design of a software application that facilitates the integration of new modules

Description : Falsification is A. Modular design of a software application that facilitates the integration of new modules B. Showing a universal law or rule to be invalid by providing a counter example C. A set of attributes in a database table that refers to data in another table D. None of these

Last Answer : B. Showing a universal law or rule to be invalid by providing a counter example

Description : What are the two subfields of Natural language processing? a) symbolic and numeric b) time and motion c) algorithmic and heuristic d) understanding and generation

Last Answer : c) algorithmic and heuristic

Description : Which of the following is true in Statistical reasoning? a) The representation is extended to allow some kind of numeric measure of certainty to be associated with each statement b) The ... extended to allow some kind of numeric measure of certainty to be associated common to all statements

Last Answer : a) The representation is extended to allow some kind of numeric measure of certainty to be associated with each statement

Description : A KES knowledge base contains information in the form of ___________ a) associations b) actions c) free text d) all of the mentioned

Last Answer : d) all of the mentioned

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

Last Answer : d) all of the mentioned

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

Last Answer : d) All of the mentioned

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

Last Answer : d) All of the mentioned

Description : A heuristic is a way of trying ___________ a) To discover something or an idea embedded in a program b) To search and measure how far a node in a search tree seems to be from a goal c) To compare two nodes in a search tree to see if one is better than another d) All of the mentioned

Last Answer : d) All of the mentioned

Description : Decision Trees can be used for Classification Tasks. 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 : 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 : 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 : 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 : 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 : 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 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 : 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 an appropriate language for describing the relationships? a) First-order logic b) Propositional logic c) ILP d) None of the mentioned

Last Answer : a) First-order logic

Description : Neural Networks are complex ______________ with many parameters. a) Linear Functions b) Nonlinear Functions c) Discrete Functions d) Exponential Functions

Last Answer : a) Linear Functions

Description : Neural Networks are complex ______________with many parameters. a) Linear Functions b) Nonlinear Functions c) Discrete Functions d) Exponential Functions

Last Answer : b) Nonlinear Functions

Description : Neural Networks are complex ———————–with many parameters. a) Linear Functions b) Nonlinear Functions c) Discrete Functions d) Exponential Functions e) Power Functions

Last Answer : b) Nonlinear Functions

Description : Neural Networks are complex ______________ with many parameters. a) Linear Functions b) Nonlinear Functions c) Discrete Functions d) Exponential Functions

Last Answer : a) Linear Functions

Description : Which values are independant in minimax search algorithm? a) Pruned leaves x and y b) Every states are dependant c) Root is independant d) None of the mentioned

Last Answer : a) Pruned leaves x and y