Unit -2 AIML

Q.No 1. What is a key attribute of uninformed search algorithms?

• 1. a.They don’t utilize any additional information about the problem.

• 1. They utilize domain specific knowledge.

• 1. They are used to maximize or minimize the problem.

• 1. These algorithms have complete knowledge and understanding of the problem. 

Q.No 2. Based on the projected total cost from the start node to the target node, which informed search algorithm prioritizes nodes?

• 1. A* algorithm. 

• 1. Breadth First Search

• 1. Best First Search 

• Uniform Cost Search

Q.No 3. If the heuristic isn't designed properly for a specific scenario, which informed search method is most likely to underperform?

• 1. Greedy Best-First Search 

• 1. Depth-First Search 

• 1. Greedy A* algorithm 

• 1. Uniform-Cost Search

Q.No 4. What is the hardest thing about making heuristic functions for intelligent search algorithms?

• 1. Making them computationally very expensive

• 1. None

• 1. Making them problem-independent

• 1. Maintaining a balance between informativeness and computational cost

Q.No 5. Which of the following is often used to describe the additional information used in informed search algorithms?

• 1. Greedy choice 

• 1. Heuristic 

• 1. Bias  

• 1. Randomization

Q.No 6. Which of the following is used for a Heuristic function?

• a) Euclidean Distance

• b) Manhattan Distance

• c) Any function with a better guess

• d) None

Q.No 7. Which algorithm is commonly used for making decisions in adversarial, two-player, zero-sum games?

• 1. Minimax algorithm 

• 1. Depth-First Search 

• 1. Breadth-First Search 

• 1. A* algorithm

Q.No 8. Which of the following is the objective in solving stochastic games?

1.  

• 1. Finding a strategy that maximizes the expected cumulative reward

• 1. Maximizing the number of players 

• 1. Minimizing the number of random events

• 1. Achieving a perfect information state

Q.No 9. In the Minimax algorithm, what does the term "utility function" represent?

• 1. Opponent winning probability 

• 1. The total moves made by both players 

• 1. The speed at which the AI processes the game moves

• 1. A measure (numerical) of the desirability of game states for the AI 

Q.No 10. What is the initial value of alpha at the root node in alpha-beta pruning?

• 1. -∞ (negative infinity) 

• 1. 0 

• 1. +∞ (positive infinity) 

• 1. 1