23AD201 – Artificial Intelligence and Machine Learning Basics

Question Bank

PART A

1.​ Define Artificial Intelligence and give its application.

2.​ Discuss the importance of Heuristic function.

3.​ Compare and contrast Uninformed Search and Informed Search strategies.

4.​ Analyze the statement “The input to an agent program is the same as the input to the agent
function” – Justify your answer.​
5.​ Enumerate the components of well-defined problems. Formulate it for vacuum world example.

6.​ Give the order of traversal for BFS and DFS for the following search tree. Avoid repeated states
while expanding the
nodes.
7.​

List the percept sequence and action tabulation for the vacuum-cleaner world
8.​ How do you avoid ridge and plateau in hill climbing? Justify.

9.​ Relate the concepts of Local beam search

10.​ List the four basic types of agent program in any intelligent system

11.​ Illustrate the state space for Vacuum Cleaner World.

12.​ State the properties of environment for Image Analysis System.

13.​ Prove that if a heuristic is consistent it must be admissible construct an admissible heuristic that
is not consistent.
14.​
How will the intelligent agent communicate with the environment? Illustrate with a formula.
15.​ Formulate initial state, successor function, goal test, path cost for airline travel problem
 16.​ How C* is producing an optimal solution path while Searching?

17.​ What is heuristics? Give the heuristic function for the 8-puzzle problem on the basis of h1 (No of
misplaced tiles) and h2 (Manhattan distance).
Initial State​ Goal State

18.​ Consider the human agent and robotic agent. Identify the sensors and actuators for human
agent and robotic agent for doing a job in the environment.
19.​ Define Artificial Intelligence in terms of human performance.

20.​ State the various properties of environment.

21.​ What are the phases involved in designing a problem solving agent?

22.​ List the basic elements that are to be include in problem definition.

23.​ Differentiate blind search & heuristic search.

24.​ Differentiate BFS & DFS.

25.​ Differentiate greedy search & A* search.

PART B

1.​ An airline company wants to develop an AI-based flight scheduling system to efficiently assign
flights, pilots, and crew while considering constraints like weather, fuel efficiency, and
passenger demand.
●​ How can this problem be formulated as an AI-based problem-solving task?
●​ Describe the components of problem-solving agents in this scenario.
2.​ Suppose you have the following search space:
State Next Cost

A B 4

A C 1

B D 3

B E 8
 C C 0

C D 2

C F 6

D C 2

D E 4

E G 2

F G 8

a) Draw the state space of this problem.

b) Assume that the initial state is A and the goal state is G. Show how each of the following
search strategies would create a search tree to find a path from the initial state to the goal
state:
I. Breadth-first search
II. Depth-first search
3.​ With the heuristic information given below show the expansion of nodes in A* to obtain the
goal.” A” is the initial node and “L” is the goal node.
Node h(n)
s

A 8.0

B 6.3

C 6.3

D 5.0

E 4.0

F 5.1

G 5.0

H 4.5

I 2.8

J 2.2

K 3.6

L 0.0
4.​ Elaborate local search algorithm for optimization problems and apply hill-climbing search
algorithm to the following 8-queens problem.

5.​ Construct and explain the breadth-first search for the below graph.
 Write the pseudo-code, time complexity and space complexity for breadth-first search
technique.
6.​ How do problem-solving agents define problems in the context of state space search explain
with suitable example and pseudocode.

7.​ Consider the following search space where we want to find a path from the start state S to the
goal state G. The table shows three different heuristic functions h1, h2 and h3. What solution
path is found by Greedy Best-first search using h2? Break ties alphabetically?

8.​ Explain A* search and explain when A* will provide optimal solutions. Given the heuristic
information in the above problem, find out the solution path using h3 heuristics.(use the above
example)
9.​ Analyze the necessity of local search algorithms and illustrate the stimulated annealing
algorithm for the state space and elaborate the pseudocode.
10.​ Explain the following uninformed search strategies with examples.
( i )Breadth First search
( ii)Depth First search
11.​ Give the initial state, goal test, sucessor function, and cost function for each of the
following.
Choose a formulation that is precise enough to be implemented.
a) You have to colour a planar map using only four colours, in such a way that no two
adjacent regions have the same colour.
b) In the travelling salesperson problem (TSP) there is a map involving N cities some
of which are connected by roads. The aim is to find the shortest tour that starts
from a city, visits all the cities exactly once and comes back to the starting city.
c) Missionaries & Cannibals problem: 3 missionaries & 3 cannibals are on one side of
the river. 1 boat carries 2. Missionaries must never be outnumbered by cannibals.
Give​ a​ plan​for​ all​ to​ cross​the​ river.

12.​ Assume that the initial state is A and the goal state is G. Show how each of the following
search strategies would create a search tree to find a path from the initial state to the goal
state:
I. Breadth-first search
II. Depth-first search
At each step of the search algorithm, show which node is being expanded, and the
content of fringe. Also report the eventual solution found by each algorithm, and the
solution cost.

13.​ Consider the following graph as the search space. If there is ever a decision between multiple
neighbor nodes in Blind Search Techniques, assume we always choose the number closest to
 the beginning. Deduce the order of traversal and compare the search strategies in terms of the
evaluation criteria.

Node h1 h2 h3
S 0 5 6
A 0 3 5
B 0 4 2
C 0 2 5
D 0 5 3
G 0 0 0

14.​ Illustrate DFS with suitable example

15.​ Define Greedy best first search algorithm and Discuss about A* algorithm