Description : ____________ planning allows the agent to take advice from the domain designer in the form of decomposition rules. a) GraphPlan b) Hierarchical task network (HTN) c) SatPlan d) None of the mentioned
Last Answer : b) Hierarchical task network (HTN)
Description : Which cannot be taken as advantage for totally ordered plan search? a) Composition b) State search c) Problem decomposition d) None of the mentioned
Last Answer : c) Problem decomposition
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 search tree.
Last Answer : The tree which is constructed for the search process over the state space is called search 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 : 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 : 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 : To eliminate the inaccuracy problem in planning problem or partial order planning problem we can use ___________________ data structure/s. a) Stacks b) Queue c) BST (Binary Search Tree) d) Planning Graphs
Last Answer : d) Planning Graphs
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 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 : 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 : 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
Description : Breadth-first search always expands the ______ node in the current fringe of the search tree. a) Shallowest b) Child node c) Deepest
Last Answer : a) Shallowest
Description : Depth-first search always expands the ______ node in the current fringe of the search tree. a) Shallowest b) Child node c) Deepest d) Minimum cost
Last Answer : c) Deepest
Description : The time and space complexity of BFS is (For time and space complexity problems consider b as branching factor and d as depth of the search tree.) a) O(bd+1) and O(bd+1) b) O(b2) and O(d2) c) O(d2) and O(b2) d) O(d2) and O(d2)
Last Answer : a) O(bd+1) and O(bd+1)
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 : 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 : 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 : Explain Min-Max method of generating the game tree.
Last Answer : Ans. The Minmax search procedure is a depth-first, depth-limited procedure. The ideas is to start at the current position & use the plausible-move generator to generate the set of possible successor ... its child values - 4. When value reaches the root: choose max value and the corresponding move.
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 : 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).
Description : Define Augmentation.
Last Answer : The process of adding the existing rules of a grammar instead of introducing new rules. It is called Augmentation.
Description : Define Bottom up parsing.
Last Answer : We start from the leaf nodes (i.e.) with the words and search for a tree with root S.
Description : Define Top down parsing.
Last Answer : It starts with root node S and search for a tree that has the words as it leaves.
Description : Define Parsing.
Last Answer : Parsing is the process of finding a parse tree for a given input string. It is also known as syntactic analysis.
Description : Define Semantic Interpretation.
Last Answer : The process of extracting the meaning of an utterance an expression in some representation language.
Description : Define Formal Language.
Last Answer : A formal language is defined as a set of strings of terminal symbols. It is called as words.
Description : Define Language.
Last Answer : Language enables us to communicate most of what we have observed about the environment.
Description : Define Communication.
Last Answer : Communication is the international exchange of information brought about by the production and perception of signs drawn from a shared system of conventional signs.
Description : Define Reification.
Last Answer : The process of treating something abstract and difficult to talk about as though it were concrete and easy to talk about is called as reification.
Description : Define Similarity nets.
Last Answer : Similarity net is an approach for arranging models. Similarity net is a representation in which nodes denotes models, links connect similar models and links are tied to different descriptions.
Description : Define conditional planning.
Last Answer : Conditional planning is a way in which the incompleteness of information is incorporated in terms of adding a conditional step, which involves if – then rules.
Description : Define a consistent plan.
Last Answer : A consistent plan is one in which there are no contradictions in the ordering or binding constraints.
Description : Define a complete plan.
Last Answer : A complete plan is one in which every precondition of every step is achieved by some other step.
Description : Define a solution
Last Answer : A solution is defined as a plan that an agent can execute and that guarantees the achievement of goal.
Description : Define planning.
Last Answer : Planning can be viewed as a type of problem solving in which the agent uses beliefs about actions and their consequences to search for a solution.
Description : Define TD.
Last Answer : Temporal Difference learning: The key of TD is to use the observed transitions to adjust the values of the observed states so that they agree with the constraint equations.
Description : Define Active Learning.
Last Answer : The agent must learn what to do. An agent must experience as much as possible of its environment in order to learn how to behave in it.