25 questions · about 30 minutes. Press End Mock any time to see your score and the correct answers.
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 :
Correct answer: C. t(x,y)= 1-s(1-x, 1-y)
A t-norm and s-norm are dual (De Morgan) if t(x, y) = 1 − s(1 − x, 1 − y).
Let α denotes the -cut of a fuzzy set A at 0 α α α 0 . If 1 < 2 , then
Correct answer: A. A_α1 ⊇ A_α2
A higher threshold keeps fewer elements, so α₁ < α₂ gives A_α1 ⊇ A_α2.
Consider the following methods : M1: Mean of maximum M2: Centre of area M3: Height method Which of the following is/are defuzzification method(s)?
Correct answer: D. M1, M2, and M3
Mean of maximum, centre of area (centroid) and the height method are all defuzzification methods.
Consider the following :
(a) Evolution
(b) Selection
(c) Reproduction
(d) Mutation Which of the following are found in genetic algorithms?
Correct answer: C. (a), (b), (c) and (d)
Genetic algorithms model evolution through selection, reproduction (crossover) and mutation.
Which of the following is an example of unsupervised neural network?
Correct answer: D. Self-organizing feature map
Kohonen's self-organizing feature map learns without labelled outputs.
The value of the derivative of the Sigmoid function given by f(x) = 1 1+e−2x at x=0 is
Correct answer: B. 1/2
For f(x) = 1/(1 + e^(−2x)), f′(x) = 2f(1 − f). At x = 0, f = 1/2, so f′ = 2 × 1/2 × 1/2 = 1/2.
Reinforcement learning can be formalized in terms of _____ in which the agent initially only knows the set of possible ____ and the set of possible actions.
Correct answer: C. Markov's decision process, states
Reinforcement learning is formalized as a Markov decision process; the agent initially knows only the possible states and actions.
An agent can improve its performance by
Correct answer: C. Learning
An agent improves its performance over time by learning.
Which of the following is true for semi-dynamic environment?
Correct answer: B. The environment itself does not change with the passage of time but the agent's performance score does.
In a semi-dynamic environment the world doesn't change while the agent thinks, but its performance score does (e.g. chess with a clock).
Consider the following terminology and match
List I with List II and choose the correct answer from the code given below. b= branching factor d= depth of the shallowest solution m= Maximum depth of the search tree l = Depth limit
Correct answer: B. (a)-(ii), (b)-(iii), (c)-(iv), (d)-(i)
BFS stores the frontier, O(b^d); DFS O(bm); depth-limited O(bl); iterative deepening O(bd).
Match List I with List II and choose the correct answer from the code given below.
Correct answer: D. (a)-(i), (b)-(iv), (c)-(iii), (d)-(ii)
Per the key: greedy best-first (i), A*'s time depends on heuristic quality (iv), RBFS suffers from excessive node regeneration (iii), and IDA* avoids the overhead of a sorted queue (ii).
Consider the following statements :
S1: A heuristic is admissible if it never overestimates the cost to reach the goal.
S2: A heuristic is monotonous if it follows the triangle inequality property. Which one of the following is true referencing the above statements?
Correct answer: D. Both the statements S1 and S2 are true.
Admissible means never overestimating the cost to the goal; consistent (monotone) means h(n) ≤ c(n, n′) + h(n′), the triangle inequality. Both are true.
Consider the following statements related to AND-OR Search algorithm. S1 A solution is a subtree that has a goal node at every leaf. S2 OR nodes are analogous to the branching in a deterministic environment. S3 AND nodes are analogous to the branching in a non-deterministic environment. Which one of the following is true referencing the above statements ?
Correct answer: C. S1 - True, S2 - True, S3 - True
A solution is a subtree with goal nodes at every leaf. OR nodes are the agent's choices (like branching in a deterministic world), and AND nodes are the environment's possible outcomes (non-deterministic branching). All true.
Consider the following minimax game tree search
What will be the value propagated at the root?
Correct answer: C. 5
MAX nodes take the max of their leaves: left (4), (5,2,6) → 6, (3,9) → 9; middle (5,2) → 5, (7,3) → 7; right (1), (7,2) → 7, (4,6,3) → 6. MIN nodes give 4, 5 and 1. The root (MAX) gets 5.
Consider a vocabulary with only four propositions A, B, C, and D. How many models are there for the following sentence? ¬A ∨ ¬B ∨ ¬C ∨ ¬D
Correct answer: C. 15
¬A ∨ ¬B ∨ ¬C ∨ ¬D is false only when all four are true, so it holds in 16 − 1 = 15 models.
Consider the sentence below. "There is a country that borders both India and Nepal." Which of the following represents the above sentence correctly?
Correct answer: A. ∃c Country(c) ∧ Border(c, India) ∧ Border(c, Nepal)
An existential is paired with ∧; using ⇒ under ∃ is satisfied trivially by anything that isn't a country.
A full joint distribution for the Toothache, Cavity, and Catch is given in the table below:
What is the probability of Cavity, given evidence of Toothache?
Correct answer: D. <0.6,0.4>
P(toothache) = 0.108 + 0.012 + 0.016 + 0.064 = 0.2; P(cavity ∧ toothache) = 0.12. So P(Cavity | toothache) = ⟨0.12/0.2, 0.08/0.2⟩ = ⟨0.6, 0.4⟩.
In Artificial Intelligence (AI), an environment is uncertain if it is ________.
Correct answer: B. Not fully observable or not deterministic
An environment is uncertain if it is not fully observable or not deterministic (either is enough).
In Artificial Intelligence (AI), a simple reflex agent selects actions on the basis of_________.
Correct answer: A. current percept, completely ignoring rest of the percept history.
A simple reflex agent acts on the current percept alone, ignoring the percept history.
In heuristic search algorithms in Artificial Intelligence (AI), if a collection of admissible h … … . h heuristics 1 m is available for a problem and none of them dominates any of the others, which should we choose?
Correct answer: A. h(n) = max{h₁(n), …, hₘ(n)}
The max of admissible heuristics is still admissible and dominates each one, giving the most informed estimate.
Consider the following sentences about A* search:
(a) A* expands all nodes with f(n) < C*.
(b) A* expands no nodes with f(n) ≥ C*.
(c) Pruning is integral to A*. Here C* is the cost of the optimal solution path. Which is correct?
Correct answer: A. Both statement (a) and statement (b) are true.
Per AIMA, A* expands every node with f(n) < C* and none beyond the C* contour, matching (a) and (b) in the key.
Consider a vocabulary with only four propositions A, B, C and D. How many models are there for the sentence B ∨ C?
Correct answer: B. 12
B ∨ C fails only when B and C are both false (4 of 16 assignments). Models = 16 − 4 = 12.
Consider the following statements:
(a) False ⊨ True
(b) If α ⊨ (β ∧ γ) then α ⊨ β and α ⊨ γ. Which of the following is correct?
Correct answer: D. Both statement (a) and statement (b) are true.
False has no models, so it entails everything (a true). Every model of α makes β ∧ γ true, hence both β and γ (b true).
Consider the following English sentence : “Agra and Gwalior are both in India”. A student has written a logical sentence for the above English sentence in First-Order Logic using predicate In(x, y), which means x is in y, as follows : In(Agra, India) V In(Gwalior, India) Which one of the following is correct with respect to the above logical sentence ?
Correct answer: A. It is syntactically valid but does not express the meaning of the English sentence.
The sentence is well-formed but uses ∨; 'both' needs In(Agra, India) ∧ In(Gwalior, India).
Consider the following two sentences :
(a) The planning graph data structure can be used to give a better heuristic for a planning problem.
(b) Dropping negative effects from every action schema in a planning problem results in a relaxed problem. Which of the following is correct with respect to the above sentences ?
Correct answer: B. Both sentence (a) and sentence (b) are true.
Planning graphs give good heuristic estimates, and ignoring delete (negative) effects is a standard relaxation.
