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

GATE DA Artificial Intelligence – Full Mock Test-1

Questions 21-25 of 100

0% completed (0/100 answered)

Question 21

MCQ · Single Correct 2 mark

In an 8-puzzle game, which heuristic function is both admissible and consistent?

A Manhattan distance (sum of horizontal and vertical distances to target positions) B $Constant heuristic h(n) = 100$ C Number of misplaced tiles squared D Double the Manhattan distance

Question 22

MCQ · Single Correct 1 mark

If step costs are positive and bounded below by $\epsilon > 0, Uniform Cost Search$ is:

A Optimal but Incomplete B Neither Complete nor Optimal C Complete and Optimal D Complete but Non-optimal

Question 23

MCQ · Single Correct 1 mark

For a game tree of depth m with branching factor b, standard Minimax without pruning evaluates how many terminal leaf nodes?

A $m^b$ B b! / m! C b * m D $b^m$

Question 24

MCQ · Single Correct 1 mark

In Genetic Algorithms, the operator that combines parts of two parent chromosomes to produce offspring is:

A Selection B Inversion C Mutation D Crossover

Question 25

MSQ · Multiple Correct 2 mark

Which of the following statements regarding CONSISTENT heuristics are CORRECT?

A Consistency satisfies h(n) <= c(n, a, n') + h(n') for all transitions n -> n'. B Every consistent heuristic is also admissible. C A* Graph Search with a consistent heuristic finds optimal paths without re-opening closed nodes. D Manhattan distance in the 8-puzzle is a consistent heuristic.