Bihar STET Computer Science – Artificial Intelligence Set 1

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

Uniform Cost Search (UCS) expands nodes in order of increasing path cost g(n) using which data structure?

Answers for question 21

Question 22

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

In adversarial game playing, which algorithm prunes branches of the game tree that cannot affect the final decision?

Answers for question 22

Question 23

MCQ · Single Correct 1 mark

What is a major limitation of Depth-First Search in infinite state spaces?

Answers for question 23

Question 24

MCQ · Single Correct 1 mark

Bidirectional search reduces search time from O($b^d)$ to O($b^{d/2$}) by:

Answers for question 24

Question 25

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

In Artificial Intelligence, PEAS representation for an intelligent agent stands for:

Answers for question 25
Scroll to Top