GATE DA Artificial Intelligence – Full Mock Test-1 ⋆ CSE Study247

GATE DA Artificial Intelligence – Full Mock Test-1

Questions 26-30 of 100

0% completed (0/100 answered)

Question 26

MSQ · Multiple Correct 2 mark

Which of the following search algorithms are COMPLETE on finite graphs with positive step costs?

A Breadth-First Search B Uniform Cost Search C A* Search with admissible heuristic D Depth-First Search on infinite graphs without depth limit

Question 27

MSQ · Multiple Correct 2 mark

Which statements regarding $\ALPHA-\BETA PRUNING$ are CORRECT?

A $\Alpha$ is the best (highest) value MAX can guarantee so far. B $\Beta$ is the best (lowest) value MIN can guarantee so far. C Pruning does NOT affect the final Minimax value at the root. D In the worst case (reverse order), $\Alpha-\Beta evaluates O(b^m) leaves$.

Question 28

MSQ · Multiple Correct 2 mark

Select the CORRECT statements regarding Uninformed Search memory usage:

A BFS space complexity is O($b^d)$. B DFS space complexity is O(b * m). C Iterative Deepening DFS space complexity is O(b * d). D Uniform Cost Search space complexity is O($b^d)$.

Question 29

MSQ · Multiple Correct 2 mark

Which of the following local search algorithms can handle CONTINUOUS state spaces?

A Gradient Descent B Simulated Annealing C Hill Climbing D Genetic Algorithms

Question 30

NAT · Numerical Answer 2 mark

Consider $\Alpha-\Beta pruning$ on a game tree evaluated left-to-right. Root is MAX (level 0). Level 1 has two MIN nodes L and R. L has children 4 and 7. R has children 2, 9, 1. How many leaf evaluations are PRUNED?

Enter your numerical answer