How to practice topic:ai

Attempt a question, record the concept and assumptions, then check the available answer. Rework mistakes after revising the relevant concepts. Topic tags can overlap; review the question context.

Questions 1–10 of 17. Imported answers require independent review unless marked reviewed.

Topic practice 17 questionsPage 1 of 2

Question 13

Open question
DAMCQ1 markNeeds review
Which of the following algorithms is NOT an example of uninformed search?
Your answerChoose one option.

Log in to check the answer

You can attempt this question now. Sign in to view the answer key, explanations and discussion.Log in to check answer

Question 14

Open question
DAMCQ1 markNeeds review
Which of the following statements is NOT true?
(The names of the predicates are intuitive.)
Your answerChoose one option.

Log in to check the answer

You can attempt this question now. Sign in to view the answer key, explanations and discussion.Log in to check answer

Question 24

Open question
DAMSQ1 markNeeds review
Sentence

is said to entail Sentence

if whenever

is TRUE,

also must hold TRUE.
Which of the following statements is/are correct if

entails

?
Your answerSelect all correct options. You can choose more than one.

Log in to check the answer

You can attempt this question now. Sign in to view the answer key, explanations and discussion.Log in to check answer

Question 30

Open question
DANAT1 markNeeds review
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)
Diagram for Data Science and Artificial Intelligence question 30


Log in to check the answer

You can attempt this question now. Sign in to view the answer key, explanations and discussion.Log in to check answer

Question 38

Open question
DAMCQ2 marksNeeds review
Assume that a Creative (

) person will Succeed (

) if the person is also Disciplined (

), but will not succeed otherwise. Now, consider the following statements:
(i)

(ii)

(iii)

Which of the following options is correct?
Your answerChoose one option.

Log in to check the answer

You can attempt this question now. Sign in to view the answer key, explanations and discussion.Log in to check answer

Question 48

Open question
DAMSQ2 marksNeeds review
Let

be a predicate.
Which of the following statements is/are NOT valid in first-order logic?
Your answerSelect all correct options. You can choose more than one.

Log in to check the answer

You can attempt this question now. Sign in to view the answer key, explanations and discussion.Log in to check answer

Question 15

Open question
daMCQ1 markNeeds review
Let

and

be any two propositions. Consider the following propositional statements.

where

denotes conjunction (AND operation),

denotes disjunction (OR operation), and

denotes negation (NOT operation). Which one of the following options is correct?
(Note:

denotes logical equivalence)
Your answerChoose one option.

Log in to check the answer

You can attempt this question now. Sign in to view the answer key, explanations and discussion.Log in to check answer

Question 26

Open question
daMSQ1 markNeeds review
Which of the following statements is/are correct in a Bayesian network?
Your answerSelect all correct options. You can choose more than one.

Log in to check the answer

You can attempt this question now. Sign in to view the answer key, explanations and discussion.Log in to check answer

Question 43

Open question
daMCQ2 marksNeeds review
Consider game trees Tree-1 and Tree-2 as shown. The first level is a MAX agent and the second level is a MIN agent. The value in the square node is the output of the utility function.
Diagram for Data Science and Artificial Intelligence question 43

For what ranges of

and

, the right child of node

and the right child of node

will be pruned by alpha-beta pruning algorithm?
Your answerChoose one option.

Log in to check the answer

You can attempt this question now. Sign in to view the answer key, explanations and discussion.Log in to check answer

Question 44

Open question
daMCQ2 marksNeeds review
The state graph shows the action cost along the edges and the heuristic function h associated with each state.
Diagram for Data Science and Artificial Intelligence question 44

Suppose

algorithm is applied on this state graph using priority queue to store the frontier. In what sequence are the nodes expanded?
Your answerChoose one option.

Log in to check the answer

You can attempt this question now. Sign in to view the answer key, explanations and discussion.Log in to check answer