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 : What is the evaluation function in A* approach? a) Heuristic function b) Path cost from start node to current node c) Path cost from start node to current node + Heuristic cost d) Average of Path cost from start node to current node and Heuristic cost
Last Answer : c) Path cost from start node to current node + Heuristic cost
Description : What is the evaluation function in greedy approach? a) Heuristic function b) Path cost from start node to current node c) Path cost from start node to current node + Heuristic cost d) Average of Path cost from start node to current node and Heuristic cost
Last Answer : a) Heuristic function
Description : The name best-first search is a venerable but inaccurate one. After all, if we could really expand the best node first, it would not be a search at all; it would be a straight march to the ... is choose the node that appears to be best according to the evaluation function. a) True b) False
Last Answer : a) True
Description : Best-First search is a type of informed search, which uses ________________ to choose the best next node for expansion. a) Evaluation function returning lowest evaluation b) Evaluation function ... c) Evaluation function returning lowest & highest evaluation d) None of them is applicable
Last Answer : a) Evaluation function returning lowest evaluation
Description : Which function will select the lowest expansion node at first for evaluation? a) Greedy best-first search b) Best-first search c) Depth-first search d) None of the mentioned
Last Answer : b) Best-first search
Description : A Term is either an individual constant (a 0-ary function), or a variable, or an n-ary function applied to n terms: F(t1 t2 ..tn). a) True b) False
Description : Define Heuristic function, h (n).
Last Answer : h (n) is defined as the estimated cost of the cheapest path from node n to a goal node.
Description : The process by which you become aware of messages through your sense is called ____________ a) Organization b) Sensation c) Interpretation-Evaluation d) Perception
Last Answer : d) Perception
Description : What are the types of evaluation of IR systems?
Last Answer : i. Recall ii. Precision
Description : Mention the criteria for the evaluation of search strategy.
Last Answer : There are 4 criteria: Completeness, time complexity, space complexity, optimality
Description : In LISP, the function (minusp (-20 4 8 8 1)) returns? a) T b) F
Last Answer : a) T
Description : In LISP, the following function (minusp (-20 4 8 8 1)) returns? a) T b) F c) NIL d) -20
Description : In LISP, the function returns the list that results after the first element is removed (the rest f the list), is __________ a) car b) last c) cons d) cdr
Last Answer : d) cdr
Description : Define Admissible heuristic h (n).
Last Answer : In A* search, if it is optimal then, h(n) is an admissible heuristic which means h(n) never overestimates the cost to reach the goal.
Description : Heuristic function h(n) is ________ a) Lowest path cost b) Cheapest path from root to goal node c) Estimated cost of cheapest path from root to goal node d) Average path cost
Last Answer : c) Estimated cost of cheapest path from root to goal node
Description : Define Successor function.
Last Answer : A value can be assigned to any unassigned variable, provided that does not conflict with previously assigned variables.
Description : Define Agent Function.
Last Answer : It is a mathematical description which deals with the agent’s behavior that maps the given percept sequence into an action.
Description : The traveling salesman problem involves n cities with paths connecting the cities. The time taken for traversing through all the cities, without knowing in advance the length of a minimum tour, is ___________ a) O(n) b) O(n2) c) O(n!) d) O(n/2)
Last Answer : c) O(n!)
Description : A* is optimal if h(n) is an admissible heuristic-that is, provided that h(n) never underestimates the cost to reach the goal. a) True b) False
Description : Which search is complete and optimal when h(n) is consistent? a) Best-first search b) Depth-first search c) Both Best-first & Depth-first search d) A* search
Last Answer : d) A* search
Description : uniform-cost search expands the node n with the __________ a) Lowest path cost b) Heuristic cost c) Highest path cost d) Average path cost
Last Answer : a) Lowest path cost
Description : n(log n) is referred to A. A measure of the desired maximal complexity of data mining algorithms B. A database containing volatile data used for the daily operation of an organization C. Relational database management system D. None of these
Last Answer : A. A measure of the desired maximal complexity of data mining algorithms
Description : f Kwik-Fit runs an ad asking customers to check windscreen wiper blades for wear, the firm is attempting to stimulate which of the following? A)Information Search B)Evoked set formation C)Evaluation of alternatives D)Problem recognition
Last Answer : D)Problem recognition
Description : What are the three phases of a security evaluation plan? (Choose three answers.) A. Conduct Security Evaluation B. Preparation C. Conclusion D. Final E. Reconnaissance F. Design Security G. Vulnerability Assessment
Last Answer : A. Conduct Security Evaluation B. Preparation C. Conclusion
Description : What are the three phases of a security evaluation plan? (Choose three answers.) ∙ A. Conduct Security Evaluation ∙ B. Preparation ∙ C. Conclusion ∙ D. Final ∙ E. Reconnaissance ∙ F. Design Security ∙ G. Vulnerability Assessment
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 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.