Bihar STET Computer Science – Artificial Intelligence Set 2

Questions 91-95 of 100

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

Question 91

MCQ · Single Correct 1 mark

In CSP Backtracking Search, the Degree Heuristic selects the variable that is:

Answers for question 91

Question 92

MCQ · Single Correct 1 mark

The Least Constraining Value (LCV) heuristic in CSPs is used to order domain values for a selected variable by picking the value that:

Answers for question 92

Question 93

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

Which AI search technique combines A* search memory efficiency by performing depth-first search up to increasing heuristic cost limits f(n)?

Answers for question 93

Question 94

MCQ · Single Correct 1 mark

In AI Automated Planning, the classical STRIPS language represents planning actions using which three components?

Answers for question 94

Question 95

MCQ · Single Correct 1 mark

In Planning Graphs (e.g., Graphplan algorithm), Mutex (Mutual Exclusion) links between two actions at the same level indicate that:

Answers for question 95
Scroll to Top