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 : 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 the other is d) All of the mentioned
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 : Chance Nodes are represented by __________ a) Disks b) Squares c) Circles d) Triangles
Last Answer : c) Circles
Description : Decision Nodes are represented by ____________ a) Disks b) Squares c) Circles d) Triangles
Last Answer : b) Squares
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 is true for neural networks? a) It has set of nodes and connections b) Each node computes it’s weighted input c) Node could be in excited state or non-excited state d) All of the mentioned
Description : How the effectiveness of the alpha-beta pruning gets increased? a) Depends on the nodes b) Depends on the order in which they are executed c) All of the mentioned d) None of the mentioned
Last Answer : a) Depends on the nodes
Description : Which is used to improve the performance of heuristic search? a) Quality of nodes b) Quality of heuristic function c) Simple form of nodes d) None of the mentioned
Last Answer : b) Quality of heuristic function
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 : End Nodes are represented by __________ a) Disks b) Squares c) Circles d) Triangles
Last Answer : d) Triangles
Description : A network with named nodes and labeled arcs that can be used to represent certain natural language grammars to facilitate parsing. a) Tree Network b) Star Network c) Transition Network d) Complete Network
Last Answer : c) Transition Network
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
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 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
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 : 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 : Decision Tree is a display of an algorithm. a) True b) False
Last Answer : a) True
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
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 : 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 : Which of the following is not the promise of artificial neural network? a) It can explain result b) It can survive the failure of some nodes c) It has inherent parallelism d) It can handle noise
Last Answer : a) It can explain result
Description : The basic inference mechanism in semantic network in which knowledge is represented as Frames is to follow the links between the nodes. a) True b) False
Description : Basic idea of an partitioned nets is to break network into spaces which consist of groups of nodes and arcs and regard each space as a node. a) True b) False
Description : The basic inference mechanism in semantic network is to follow the links between the nodes. a) True b) False
Description : Which search algorithm imposes a fixed depth limit on nodes? a) Depth-limited search b) Depth-first search c) Iterative deepening search d) Bidirectional search
Last Answer : a) Depth-limited search
Description : When is breadth-first search is optimal? a) When there is less number of nodes b) When all step costs are equal c) When all step costs are unequal
Description : In artificial Neural Network interconnected processing elements are called A. nodes or neurons B. weights C. axons D. Soma
Last Answer : A. nodes or neurons
Description : Choose form the following areas where NLP can be useful. a) Automatic Text Summarization b) Automatic Question-Answering Systems c) Information Retrieval d) All of the mentioned
Description : Which is used to choose among multiple consistent hypotheses? a) Razor b) Ockham razor c) Learning element d) None of the mentioned
Last Answer : b) Ockham razor
Description : Fuzzy Set theory defines fuzzy operators. Choose the fuzzy operators from the following. a) AND b) OR c) NOT d) All of the mentioned
Description : Which function is used to calculate the feasibility of whole game tree? a) Evaluation function b) Transposition c) Alpha-beta pruning d) All of the mentioned
Last Answer : a) Evaluation function
Description : Which algorithm is used to solve any kind of problem? a) Breadth-first algorithm b) Tree algorithm c) Bidirectional search algorithm d) None of the mentioned
Last Answer : b) Tree algorithm
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 : Decision Trees can be used for Classification Tasks. a) True b) False
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 : 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.