Question Bank for Fundamentals in AI and ML
1. You are using Google Maps to navigate while driving a car. What type of intelligent agent is
being used in this scenario? Explain its working with a suitable block diagram.
2. Consider a situation where you rely on Google Maps for route planning while driving.
Identify the type of agent involved and provide a brief explanation along with a supporting
block diagram.
3. When navigating using Google Maps, the system provides real-time route suggestions.
What type of agent does Google Maps represent in this case? Illustrate your answer with a
block diagram.
4. Explain the PEAS (Performance measure, Environment, Actuators, Sensors) representation
for the following intelligent systems:
(i) Autonomous Warehouse Robot
(ii) Virtual Language Assistant
(iii) Home Automation System
5. Describe the PEAS model for the given intelligent agents and analyze their key components:
(i) Industrial Robotic Arm for Object Handling
(ii) AI-based Language Learning Assistant
(iii) Automated Climate Control System
6. Illustrate the PEAS framework for the following AI applications and justify its suitability:
(i) Robotic Sorting Machine
(ii) AI-powered Online Tutor
(iii) Smart HVAC (Heating, Ventilation, and Air Conditioning) System
7. Analyze the differences between Breadth-First Search (BFS) and Depth-First Search (DFS)
in terms of their traversal methods, computational complexity, and memory requirements. In
what scenarios would BFS be more appropriate than DFS, and vice versa? Provide a practical
example for each case.
8. Explain the working principles of Breadth-First Search (BFS) and Depth-First Search (DFS).
Compare their efficiency in terms of time and space complexity, and discuss their strengths
and weaknesses. When would DFS be a better choice than BFS, and in what situations should
BFS be preferred? Provide real-world use cases.
9. Compare and contrast BFS and DFS with respect to their exploration strategies,
performance characteristics, and practical applications. Under what conditions would BFS be
more efficient than DFS, and vice versa? Illustrate with a real-world example where one
algorithm outperforms the other.
10. Apply the A* algorithm to find the path from S to G using the given heuristic values h(n).
Graph Representation:
Edges with costs:
o S → A (2), S → C (4)
o A → B (3), A → D (6)
o C → D (2), C → G (5)
o B → G (7), D → G (3)
11. Apply the A* algorithm to find the shortest path from Start (S) to Goal (G) using the given
heuristic values.
Graph Representation:
• Edges with costs:
o S → A (1), S → B (4)
o A → C (2), A → D (5)
o B → D (1), B → G (6)
o C → G (3), D → G (2)
12. Use the A* algorithm on the given tree to determine the path from S to G, utilizing the
heuristic values h(n).
State h(n)
S 3
A 1
B 6
C 4
D 2
G 0
13. What is probability, and why is it essential in handling uncertainty in decision-making?
Also, state and explain the three axioms of probability.
14. Define probability and discuss its role in making informed decisions under uncertainty.
What are the fundamental axioms that govern probability theory?
15. Explain the concept of probability and its significance in risk assessment and decision-
making. List and describe the three fundamental axioms of probability.
16. How does probability help in dealing with uncertainty in real-world scenarios? Define
probability and enumerate its three basic axioms.
17. Explain the various types of decision-making processes and outline the key steps involved
in making effective decisions.
18. Describe different types of decision-making and discuss the essential steps for making
sound decisions.
19. What are the different types of decision-making? Briefly explain the steps required for
effective decision-making.
20. Discuss the classification of decision-making and elaborate on the structured approach to
making well-informed decisions.
