List of top Data Science and Artificial Intelligence Questions on Artificial Intelligence asked in GATE DA

Which of the following algorithms is NOT an example of uninformed search?
Which of the following statements is NOT true? (The names of the predicates are intuitive.)
Sentence \(X\) is said to entail Sentence \(Y\) if whenever \(X\) is \(TRUE\), \(Y\) also must hold \(TRUE\).
Which of the following statements is/are correct if \(X\) entails \(Y\)?
Consider the game tree for a two-player turn-taking minimax game as shown in the figure. The value of a terminal node represents the utility of the game state if the game ends there. The numbers written next to the edges denote the strategies.



There are two players MAX and MIN. At any particular state of the game, MAX prefers to move to a state of maximum value. On the other hand, MIN prefers to move to a state of minimum value.

Suppose MAX starts the game at the root and has three strategies: 1, 2 and 3. Next, MIN plays and also has three strategies: 1, 2 and 3. The game ends there. Both players always take optimal strategies throughout the game.

At the root, the best strategy for MAX is __________. (Answer in integer)
Assume that a Creative (\(C\)) person will Succeed (\(S\)) if the person is also Disciplined (\(D\)), but will not succeed otherwise. Now, consider the following statements:
(i) \(C \wedge S \Leftrightarrow D\)
(ii) \(C \Rightarrow (S \Leftrightarrow D)\)
(iii) \(C \Leftrightarrow ((D \Rightarrow S) \vee \neg S)\)
Which of the following options is correct?
Let \(P(x)\) be a predicate.

Which of the following statements is/are NOT valid in first-order logic?