Bihar STET Computer Science – Artificial Intelligence Set 1

Questions 16-20 of 100

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

Question 16

MCQ · Single Correct 1 mark

What is the time complexity of Breadth-First Search where b is the branching factor and d is the depth of the shallowest goal?

Answers for question 16

Question 17

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

An admissible heuristic function h(n) in A* search is one that:

Answers for question 17

Question 18

MCQ · Single Correct 1 mark

Iterative Deepening Depth-First Search (IDDFS) combines which two desirable properties?

Answers for question 18

Question 19

MCQ · Single Correct 1 mark

What is the space complexity of Depth-First Search (DFS) for branching factor b and maximum search depth m?

Answers for question 19

Question 20

MCQ · Single Correct 1 mark

In a state-space graph where step costs are equal, which uninformed search algorithm is guaranteed to find the optimal (shortest path) solution?

Answers for question 20
Scroll to Top