AI MCQs

Here are 50 multiple-choice questions based on the notes:

1. What is the combination of BFS and DFS known as?

- A) UCS

- B) IDS

- C) A*

- D) Hill Climbing

2. Which type of search uses domain knowledge?

- A) Uninformed Search

- B) Depth-First Search

- C) Informed Search

- D) Breadth-First Search

3. What does a greedy algorithm prioritize?

- A) Optimal solution

- B) First immediate benefit

- C) Goal state

- D) Random choice

4. What is an action space?

- A) The set of possible goals

- B) The space where action is performed by the agent

- C) The agent's current state

- D) The environment's parameters

5. How can a heuristic be defined?

- B) A mathematical model

- C) An educated guess

- D) An error margin

6. What characterizes a deterministic environment?

- A) Random outcomes

- B) Unknown actions

- C) Known actions and results

- D) Unpredictable results

7. Which algorithm is used for the N-Queens problem in the notes?

- A) BFS

- B) DFS

- C) UCS

- D) A*

8. What approach is suggested instead of backtracking for the N-Queens problem?

- A) Breadth-First Search

- B) Hill Climbing

- C) Depth-First Search

- D) Random Walk

9. What is the size of the board mentioned for the 4-Queens problem?

- A) 5x5

- B) 6x6

- C) 4x4

- D) 8x8
10. What is the role of a simple reflex agent?

- A) Goal-based agent

- B) Role-based agent

- C) Learning agent

- D) Model-based agent

11. In informed search, what does the heuristic estimate?

- A) Total path cost

- B) Immediate benefit

- C) Probability of success

- D) Time complexity

12. In a 2-mark question, what is one of the comparisons required?

- A) Memory usage of two agents

- B) Comparisons between two agents in a specific environment

- C) Algorithm speed of two agents

- D) Distance between agents

13. In a 2-mark question, which two complexities are to be compared?

- A) Time and cost

- B) Space and speed

- C) Time and space

- D) Cost and space

14. Which search algorithm can be applied to a specific problem according to the notes?

- A) BFS, DFS, UCS, Bidirectional

- B) Greedy, UCS, Backtracking

- C) Hill Climbing, BFS, Bidirectional

- D) Only DFS
15. What is the topic of a 3-mark question related to game theory?

- A) Minimax

- B) Alpha-Beta Pruning

- C) Dynamic Programming

- D) Expectimax

16. What data structure is associated with UCS in the notes?

- A) Stack

- B) Queue

- C) Priority Queue

- D) Binary Tree

17. What does UCS stand for?

- A) Uniform Cost Search

- B) Uniform Caching Strategy

- C) Universal Class Search

- D) User Computed Search

18. What is the main advantage of IDS?

- A) Minimal memory usage

- B) Fastest solution

- C) Complete and optimal

- D) Less complex

19. Which search algorithm expands the shallowest unvisited node?

- A) DFS

- B) UCS

- C) BFS
 - D) IDS

20. What is a characteristic of DFS?

- A) Expands the shallowest unvisited node

- B) Optimal for all cases

- C) May not find the shortest path

- D) Uses a priority queue

21. What is the difference between informed and uninformed search?

- A) Informed search uses heuristics

- B) Uninformed search is always optimal

- C) Uninformed search uses domain knowledge

- D) Informed search does not require heuristics

22. What does a greedy algorithm select?

- A) The optimal solution

- B) The most promising option based on cost

- C) The first available option

- D) The option with the least heuristic value

23. How does a simple reflex agent work?

- A) Reacts based on a predefined set of rules

- B) Calculates the best possible outcome

- C) Adapts based on feedback

- D) Uses a model of the environment

24. In which environment are actions and outcomes predictable?

- A) Probabilistic environment

- B) Deterministic environment
 - C) Stochastic environment

- D) Uncertain environment

25. Which agent type acts based on predefined rules?

- A) Utility-based agent

- B) Goal-based agent

- C) Simple reflex agent

- D) Model-based agent

26. What does the heuristic in informed search help to determine?

- A) Immediate cost only

- B) Path length

- C) Total estimated cost to the goal

- D) Number of nodes to expand

27. What search method is recommended for comparing two graphs in terms of complexity?

- A) UCS

- B) IDS

- C) DFS

- D) BFS

28. Which algorithm uses a priority queue?

- A) BFS

- B) DFS

- C) UCS

- D) Bidirectional

29. Which algorithm explores nodes based on depth?

- A) BFS
 - B) UCS

- C) IDS

- D) DFS

30. What is the focus of alpha-beta pruning?

- A) Minimizing the path length

- B) Reducing the search space in game trees

- C) Identifying the shortest path

- D) Generating the most promising solution

31. What is the purpose of the frontier in UCS?

- A) To store unvisited nodes

- B) To track visited nodes

- C) To store goal nodes

- D) To keep track of solutions only

32. Which algorithm is iterative deepening a combination of?

- A) UCS and A*

- B) DFS and Greedy

- C) BFS and DFS

- D) BFS and UCS

33. Which search algorithm is generally faster in a wide tree?

- A) DFS

- B) UCS

- C) Greedy

- D) BFS

34. How does alpha-beta pruning improve search efficiency?

- B) Eliminates irrelevant branches

- C) Uses random selection

- D) Follows a depth-first approach only

35. Which search technique finds an optimal path in weighted graphs?

- A) DFS

- B) Greedy

- C) UCS

- D) Bidirectional

36. Which algorithm is most suited for problems without predefined heuristics?

- A) UCS

- B) Greedy

- C) DFS

- D) A*

37. What is the primary advantage of a heuristic in search algorithms?

- A) Reduces space complexity

- B) Guarantees an optimal solution

- C) Provides an estimate to guide search

- D) Minimizes time complexity in all cases

38. Which environment has unpredictable results?

- A) Stochastic

- B) Deterministic

- C) Reflexive

- D) Reactive
39. In a backtracking problem, which approach could reduce redundancy?

- A) BFS

- B) DFS

- C) Hill Climbing

- D) Greedy

40. What is an educated guess that guides a search called?

- A) Reflex action

- B) Heuristic

- C) Random choice

- D) Cost function

41. What does DFS prioritize in terms of node expansion?

- A) Least cost

- B) Most promising node

- C) Deepest node

- D) Widest node

42. What data structure does DFS typically use?

- A) Queue

- B) Stack

- C) Priority Queue

- D) Binary Tree

43. Which approach considers both time and space complexity for evaluation?

- A) UCS

- B) Alpha-beta pruning

- C) Greedy

- D) IDS
44. What is the main goal of bidirectional search?

- A) Search from both the start and goal

- B) Use a single direction

- C) Combine UCS and DFS

- D) Alternate between BFS and A*

45. Which search type is best for game trees with two players?

- A) Greedy

- B) UCS

- C) Alpha-Beta Pruning

- D) Hill Climbing

46. What

problem size is the 4-Queens problem associated with?

- A) 8x8 board

- B) 3x3 board

- C) 5x5 board

- D) 4x4 board

47. What type of agent uses condition-action rules?

- A) Goal-based agent

- B) Utility-based agent

- C) Reflex agent

- D) Learning agent

48. In UCS, which list keeps track of expandable nodes?

- A) Path list
 - B) Frontier list

- C) Solution list

- D) Goal list

49. Which search algorithm uses an educated guess?

- A) BFS

- B) Greedy

- C) DFS

- D) UCS

50. Which algorithm typically requires the least memory?

- A) IDS

- B) UCS

- C) BFS

- D) Greedy