Bihar STET Computer Science – Artificial Intelligence Set 1

Questions 31-35 of 100

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

Question 31

MCQ · Single Correct 1 mark

If a heuristic function h(n) is consistent, then h(n) is also guaranteed to be:

Answers for question 31

Question 32

MCQ · Single Correct 1 mark

In graph search, A* search is guaranteed to find the optimal solution if the heuristic function h(n) is:

Answers for question 32

Question 33

MCQ · Single Correct 1 mark

Which local search algorithm continuously moves in the direction of increasing value/elevation to find a peak, but can get stuck in local maxima?

Answers for question 33

Question 34

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

Which component of an Expert System contains the domain-specific facts and rules rules used to solve problems?

Answers for question 34

Question 35

MCQ · Single Correct 1 mark

Simulated Annealing avoids getting trapped in local maxima by:

Answers for question 35
Scroll to Top