Bihar STET Computer Science – Artificial Intelligence SET-3

Questions 36-40 of 100

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

Question 36

MCQ · Single Correct 1 mark

In Markov Decision Processes (MDPs), what does the Bellman Optimality Equation for V*(s) state?

Answers for question 36

Question 37

MCQ · Single Correct 1 mark

Which algorithm computes optimal policy values in an MDP by iteratively executing sweep updates over all state values until convergence?

Answers for question 37

Question 38

MCQ · Single Correct 1 mark

Which unsupervised learning clustering algorithm partitions n observations into k clusters where each observation belongs to the cluster with the nearest mean?

Answers for question 38

Question 39

MCQ · Single Correct 1 mark

In K-Nearest Neighbors (KNN) classification, what happens when K is chosen as 1?

Answers for question 39

Question 40

MCQ · Single Correct 1 mark

Which decision tree splitting criterion measures impurity based on the probability of incorrect classification of a randomly chosen element?

Answers for question 40
Scroll to Top