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 : 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 : 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 : 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 : Which cannot be represented by a set of attributes? a) Program b) Three-dimensional configuration of a protein molecule c) Agents
Last Answer : b) Three-dimensional configuration of a protein molecule
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 : 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 : Artificial intelligence is A . It uses machine-learning techniques. Here program can learn From past experience and adapt themselves to new situations B. Computational procedure that takes some ... performs tasks that would require intelligence when performed by humans D . None of these
Last Answer : C. Science of making machines performs tasks that would require intelligence when performed by humans
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 : 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
Last Answer : a) True
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 : 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 : 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 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 : 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 : _____________ algorithms is used to extract the plan directly from the planning graph, rather than using graph to provide heuristic. a) BFS/DFS b) A* c) Graph-Plan d) Greedy
Last Answer : c) Graph-Plan
Description : When will further expansion is unnecessary for planning graph? a) Identical b) Replicate c) Not identical d) None of the mentioned
Last Answer : a) Identical
Description : Which kind of problem are suitable for planning graph? a) Propositional planning problem b) Planning problem c) Action problem d) None of the mentioned
Last Answer : a) Propositional planning problem
Description : What are present in each level of planning graph? a) Literals b) Actions c) Variables d) Both Literals & Actions
Last Answer : d) Both Literals & Actions
Description : What is the starting level of planning graph? a) Level 3 b) Level 2 c) Level 1 d) Level 0
Last Answer : d) Level 0
Description : Which is used to extract solution directly from the planning graph? a) Planning algorithm b) Graphplan c) Hill-climbing search d) All of the mentioned
Last Answer : b) Graphplan
Description : Which data structure is used to give better heuristic estimates? a) Forwards state-space b) Backward state-space c) Planning graph algorithm d) None of the mentioned
Last Answer : c) Planning graph algorithm
Description : Graph used to represent semantic network is _____________ a) Undirected graph b) Directed graph c) Directed Acyclic graph (DAG) d) Directed complete graph
Last Answer : b) Directed graph
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 : The _______ is a touring problem in which each city must be visited exactly once. The aim is to find the shortest tour. a) Finding shortest path between a source and a destination b) Travelling ... c) Map coloring problem d) Depth first search traversal on a given map represented as a graph
Last Answer : b) Travelling Salesman problem
Description : What is called as multiple connected graph?
Last Answer : A multiple connected graph is one in which two nodes are connected by more than one path.
Description : Which of the following statement is not true? a) The union and concatenation of two context-free languages is context-free b) The reverse of a context-free language is context-free, but the ... it can be described by a regular grammar d) The intersection two context-free languages is context-free
Last Answer : d) The intersection two context-free languages is context-free
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 : How the compactness of the bayesian network can be described? a) Locally structured b) Fully structured c) Partial structure d) All of the mentioned
Last Answer : a) Locally structured
Description : Planning problem can be described as a propositional logic. a) True b) False
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 : Claude Shannon described the operation of electronic switching circuits with a system of mathematical logic called _____________ a) LISP b) XLISP c) Neural networking d) Boolean algebra
Last Answer : c) Neural networking
Description : Which stage of the manufacturing process has been described as “the mapping of function onto form”? a) Design b) Distribution c) Project management d) Field service
Last Answer : a) Design
Description : Which of the following statement is not true? a) The union and concatenation of two context-free languages is context-free b) The reverse of a context-free language is context-free, but ... a regular language is always context-free e) The intersection two context-free languages is context-free
Last Answer : e) The intersection two context-free languages is context-free
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
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
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
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