Artificial Intelligence (AI) – Previous Year Questions
202 questions from past UGC NET Paper 2 – Computer Science papers, each with the correct answer. Open any question for its explanation.
Topic-wise mock tests
- The probability of a toothache, given evidence of a cavity, P(toothache | cavity) is __________.
- P(cavity ∨ toothache) is __________.
- The probability for Cavity, given that either Toothache or Catch is true, P(Cavity | toothache ∨ catch) is _______.
- The process of removing details from a given state representation is called ______
- Which of the following is NOT true in problem solving in artificial intelligence?
- What kind of clauses are available in conjunctive normal form?
- Which of the following statements are true? α β β (A) A sentence entails another sentence if α is true in few worlds where is true. (B) Forward chaining and backward chaining are very natural reasoning algorithms for kn…
- Which of the following statements are true? (A) Minimax search is breadth-first; it processes all the nodes at a level before moving to a node in next level. (B) The effectiveness of the alpha-beta pruning is highly dep…
- Match List I with List II. List I: A. Branch-and-bound, B. Steepest-ascent hill climbing, C. Constraint satisfaction, D. Means-end analysis. List II: I. Keeps track of all partial paths that can be candidates for furthe…
- Match List I with List II. List I: A. Greedy best-first search, B. A*, C. Recursive best-first search, D. SMA*. List II: I. Space complexity is O(d), where d is the depth of the deepest optimal solution, II. Incomplete…
- Given below are two statements: V V If two variables 1 and 2 are used for clustering, then consider the following k k = 3 statements for means clustering with V V Statement I : If 1 and 2 have correlation of 1 the clust…
- Given below are two statements: Statement I: A genetic algorithm is a stochastic hill-climbing search in which a large population of states is maintained. Statement II: In nondeterministic environments, agents can apply…
- According to Dempster-Shafer theory for uncertainty management, Bel(A) Where denotes Belief of event A.
- Consider the game tree given below □ Here ○ and represent MIN and MAX nodes respectively. The value of the root node of the game tree is:
- Consider the following models: M1: Mamdani model M 2 : Takagi - Sugeno-Kang model M3: Kosko's additive model (SAM) Which of the following option contains examples of additive rule model? M M
- A fuzzy conjunction t(x, y) and disjunction s(x, y) form a pair if t(x, y) = 1 − s(1 − x, 1 − y). If t(x, y) = xy/(x + y − xy), then s(x, y) is
- Let W_ij represent the weight between node i at layer k and node j at layer (k − 1) of a given multilayer perceptron. The weight updation using the gradient descent method is given by
- The order of schema ?10?101? and ???0??1 are---- ----------- and --------------respectively.
- Let the population of chromosomes in genetic algorithm is represented in terms of binary number. The strength of fitness of a chromosome x in decimal form, , is given by f(x) Sf(x) = where f(x) = x2 Σf(x) P The populati…
- Consider the following: (a) Trapping at local maxima (b) Reaching a plateau (c) Traversal along the ridge. Which of the following option represents shortcomings of the hill climbing algorithm?
- Consider the following learning algorithms : (a) Logistic repression (b) Back propogation (c) Linear repression Which of the following option represents classification algorithms?
- -mean clustering algorithm has clustered the 1st given 8 observations into 3 clusters after iteration as follows: C1 : {(3, 3), (5, 5), (7, 7)} C2 : {(0, 6), (6, 0), (3, 0)} C3 : {(8, 8), (4, 4)} What will be the Manhat…
- Consider the game tree given below : Here and represents MIN and MAX nodes respectively. The value of the root node of the game tree is
- Match List I with List II. List I: (a) Greedy best-first, (b) Lowest cost-first, (c) A* algorithm. List II: (i) Minimal cost(p) + h(p), (ii) Minimal h(p), (iii) Minimal cost(p).
- The STRIPS representation is
- A fuzzy conjunction operator denoted as t(x,y) and a fuzzy disjunction operator denoted as s(x,y) form a dual pair if they satisfy the condition :
- Let α denotes the -cut of a fuzzy set A at 0 α α α 0 . If 1 < 2 , then
- Consider the following methods : M1: Mean of maximum M2: Centre of area M3: Height method Which of the following is/are defuzzification method(s)?
- Consider the following : (a) Evolution (b) Selection (c) Reproduction (d) Mutation Which of the following are found in genetic algorithms?
- Which of the following is an example of unsupervised neural network?