Bihar STET Computer Science – Artificial Intelligence Set 2

Questions 21-25 of 100

0% completed (0/100 answered)
Your score 0/100 0 answered
Correct 0 Incorrect 0 Unanswered 100 Accuracy 0%

Question 21

MCQ · Single Correct 1 mark
Previous Year Question Bihar STET C.S. 12.09.2023 (Shift-III) PYQ

The $\Alpha-\Beta Pruning technique$ in minimax game trees improves search efficiency without changing the final move decision by:

Answers for question 21

Question 22

MCQ · Single Correct 1 mark

In First-Order Logic, a Horn Clause is defined as a clause containing at most how many positive literals?

Answers for question 22

Question 23

MCQ · Single Correct 1 mark

The Resolution Refutation proof procedure proves that a query Q is entailed by Knowledge Base KB by showing that:

Answers for question 23

Question 24

MCQ · Single Correct 1 mark

Semantic Networks represent domain knowledge visually using:

Answers for question 24

Question 25

MCQ · Single Correct 1 mark

Two random variables X and Y are conditionally independent given Z if:

Answers for question 25
Scroll to Top