Question Bank
Generated on: 19/08/2025
1. Apply the following search algorithms to find a path from the node A to G in the
given graph:
i) Depth First Search (DFS)
ii) Depth-limited search (L=2)
iii) Iterative Deepening Search (IDS)
Note: Process the nodes alphabetically for the nodes at the same level.
Also Analyze the above algorithms regarding completeness, optimality, time
complexity, and space complexity
Question ID: 2912
Assessment Type: CAT 1
UniBud.in - Your Academic Companion
Question Bank
Generated on: 19/08/2025
2. Apply A* Search algorithm to find the shortest path from a to z using the
following graph
Question ID: 2913
Assessment Type: CAT 1
UniBud.in - Your Academic Companion
Question Bank
Generated on: 19/08/2025
3. Consider the directed graph below, where a is the start node, and f is the goal
node. Which sequences of paths are explored by BFS and DFS in this problem?
Show the complete intermediate state space for DFS and BFS with a neat
sketch.
Would you prefer DFS or BFS for this problem? Justify?
Note: Nodes are revisited as per the direction mentioned.
Question ID: 2917
Assessment Type: CAT 1
UniBud.in - Your Academic Companion
Question Bank
Generated on: 19/08/2025
UniBud.in - Your Academic Companion
Question Bank
Generated on: 19/08/2025
4. For the given directed graph (start node is S), perform the Uniform Cost
Search (UCS). Expand the node based on the alphabetic order if the nodes
have the same cumulative cost.
1. Show the priority queue and visited nodes for each step
2. Draw the tree for each step
3. Path and cost to reach the goal states (G1, G2, G3)
4. Find the goal node that has the minimum cost.
Question ID: 2918
Assessment Type: CAT 1
UniBud.in - Your Academic Companion
Question Bank
Generated on: 19/08/2025
5. Trace the operation of A' search applied to the problem of getting to Bucharest
from Lugoj using the straight-line distance heuristic. Show the sequence of
nodes that the algorithm will consider to reach the goal. Refer to the Hsld
mentioned in the table below
Question ID: 2923
Assessment Type: CAT 1
UniBud.in - Your Academic Companion
Question Bank
Generated on: 19/08/2025
6. Trace the Breadth First Search Algorithm for the given tree structure and
Compare its performance with the Depth Limited Search technique.
Question ID: 2926
Assessment Type: CAT 1
UniBud.in - Your Academic Companion
Question Bank
Generated on: 19/08/2025
7. List out the various measures to evaluate algorithm performance
Question ID: 2927
Assessment Type: CAT 1
8. Suppose two friends live in different cities on a map, such as the Romania map
shown:
On every turn, we can simultaneously move each friend to a neighboring city on
the map. The amount of time needed to move from city i to neighbor j is equal to
the road distance D(i,j) between the cities, but on each turn, the friend that
arrives first must wait until
the other one arrives (and calls the first on his/her cell phone) before the next
turn can begin. We want the two friends to meet as quickly as possible.
a. Write a detailed formulation for this search problem. (You will find it helpful to
define some formal notation here.)
b. Let D(i,j) be the straight-line distance between cities i and j. Which of the
following heuristic functions are admissible? (i) D(i,j); (ii) 2·D(i,j); (iii) D(i,j)/2.
c. Are there completely connected maps for which no solution exists?
d. Are there maps in which all solutions require one friend to visit the same city
twice?
Question ID: 2928
Assessment Type: CAT 1
UniBud.in - Your Academic Companion
Question Bank
Generated on: 19/08/2025
UniBud.in - Your Academic Companion
Question Bank
Generated on: 19/08/2025
9. List and discuss the steps involved in simple problem solving technique.
Question ID: 2931
Assessment Type: CAT 1
10. Consider a 5-city problem: Let's call VIT University (VU) and the 5 cities (C1),
(C2),(C3), (C4) & (C5) respectively. A student starts from (VU), he/she visits 5
cities, and then returns back to (VU). Find the state-space representation of this
problem. Also, compare DFS & BFS approaches for the given problem.
Question ID: 2932
Assessment Type: CAT 1
UniBud.in - Your Academic Companion
Question Bank
Generated on: 19/08/2025
11. Use the Greedy Best-First Search algorithm to solve the Romanian problem.
The agent is on holiday in Romania and is currently located in the city of Arad.
The agent has a flight from Bucharest tomorrow, so it can't be changed. Now
you need to find the shortest path to Bucharest.
Question ID: 2933
Assessment Type: CAT 1
[Image could not be loaded]
12. Consider the initial and the final state for an 8-puzzle problem given below.
i. Generate all the states for the given problem
ii. Find out the path to the final state using Breadth First Search (BFS)
iii. Find out the path to the final state using Depth First Search (DFS)
Question ID: 2936
Assessment Type: CAT 1
UniBud.in - Your Academic Companion
Question Bank
Generated on: 19/08/2025
UniBud.in - Your Academic Companion
Question Bank
Generated on: 19/08/2025
13. Consider the initial and the final state for an 8-puzzle problem given below.
i. Generate all the states for the given problem
ii. Find out the path to the final state using Breadth First Search (BFS)
iii. Find out the path to the final state using Depth First Search (DFS)
Question ID: 2937
Assessment Type: CAT 1
UniBud.in - Your Academic Companion
Question Bank
Generated on: 19/08/2025
UniBud.in - Your Academic Companion
Question Bank
Generated on: 19/08/2025
14. Consider the Water Jug problem as stated below: You are given two jugs, a
4-gallon one and a 3-gallon one. Neither
have any measuring markers on it. There is a pump that can be used to fill the
jugs with water and there is a sink for
emptying out the water. How can you get exactly 2 gallons of water into the
4-gallon jug?
i. Generate all the states for the given problem.
ii. Show how Depth First Search could be used to solve the problem?
iii. Why is Depth Limited Search necessary in Depth First Search?
Question ID: 2942
Assessment Type: CAT 1
15. Consider the Water Jug problem as stated below: You are given two jugs, a
4-gallon one and a 3-gallon one. Neither
have any measuring markers on it. There is a pump that can be used to fill the
jugs with water and there is a sink for
emptying out the water. How can you get exactly 2 gallons of water into the
4-gallon jug?
i. Generate all the states for the given problem.
ii. Is it possible to use Breadth First Search to find a solution? If yes, show the
solution. If no, then justify
UniBud.in - Your Academic Companion
your answer. Question Bank
iii. Show how Iterative Deepening Search could be used to solve the problem?
Question ID: 2943
Assessment Type: CAT 1
Generated on: 19/08/2025
16. i.Calculate the number of nodes generated in a depth-limited search to depth l
with branching factor n.
ii. Calculate the number of nodes generated in an iterative deepening search to
depth l with branching factor b.
iii. For n = 5, l = 10, suggest which one of the above two algorithms performs
better. Justify the answer.
Question ID: 2944
Assessment Type: CAT 1
17. i.Calculate the time required to search a node in an iterative deepening search
to depth d with branching factor b.
ii. Calculate the time required to search a node in breadth-first search to depth d
with branching factor b.
iii. For b = 10, d = 5 suggest which one of the above two algorithms performs
better. Justify the answer.
Question ID: 2945
Assessment Type: CAT 1
UniBud.in - Your Academic Companion
Question Bank
Generated on: 19/08/2025
18. Consider an 8-puzzle problem with the following initial and final states: Find the
most cost-effective path to reach to final state from the initial state using the A*
search algorithm. Consider the cost of reaching a state from its parent state is
one and the heuristic at any state is the number of misplaced tiles.
Question ID: 2946
Assessment Type: CAT 1
[Image could not be loaded]
19. Consider an 8-puzzle problem with the following initial and final states: Find the
most cost-effective path to reach to final state from the initial state using the A*
search algorithm. Consider the cost of reaching a state from its parent state is
one and the heuristic at any state is the number of misplaced tiles.
Question ID: 2947
Assessment Type: CAT 1
[Image could not be loaded]
UniBud.in - Your Academic Companion
Question Bank
Generated on: 19/08/2025
20. Consider the search graph depicted in Figure in which node “1” represents the
source node and node “8” represents the goal node. The weight of the edge (i-j)
represents the distance between node i to node j. The weights labeled on the
top of node i represent the distance from node i to the goal node. Determine the
optimal search path from the source node to the goal node using the A*
algorithm. Prove that A* is optimal.
Question ID: 2949
Assessment Type: CAT 1
UniBud.in - Your Academic Companion
Question Bank
Generated on: 19/08/2025
21. Imagine you have three jugs measuring 12 gallons, 8 gallons, and 3 gallons and
a water faucet. You can fill the jugs up or empty them out from one to another or
onto the ground. How can you measure out exactly one gallon. Represent this
as a problem in state space search and extract its production rules.
Question ID: 2952
Assessment Type: CAT 1
22. Consider the Water Jug problem as stated here: “You are given two jugs, a
4-gallon one and a 3-gallon one. Neither have any measuring markers on it.
There is a pump that can be used to fill the jugs with water. How can you get
exactly 2 gallons of water into the 4-gallon jug?” Represent this as a problem in
State Space Search and state its Production Rules. Show at least one solution
to this problem. Why is ‘depth limited search’ necessary in DFS?
Question ID: 2956
Assessment Type: CAT 1
UniBud.in - Your Academic Companion
Question Bank
Generated on: 19/08/2025
23. State the significance of using heuristic functions. Perform the A* search
algorithm on the graph given below taking node ‘0’ as the starting node and
giving the proof of optimality.
Question ID: 2958
Assessment Type: CAT 1
UniBud.in - Your Academic Companion
Question Bank
Generated on: 19/08/2025
24. Consider the following graph. In what order will the nodes be visited using a
(i) Breadth First Search and (ii) Depth First Search?
Question ID: 2963
Assessment Type: CAT 1
25. From the Following Figure.
a)What path would the breadth-first graph search return for this search
problem? S-G
b)What path would uniform cost graph search return for this search
problem? S-A-C-G
c)What path would the depth-first graph search return for this search
problem? S-A-B-D-G
d)What path would A* graph search, using a consistent heuristic, return
UniBud.in - Your Academic Companion
Question Bank
for this search problem? S-A-C-G
Question ID: 2965
Assessment Type: CAT 1
Generated on: 19/08/2025
26. Demonstrate the uniform cost search algorithm by using the below graph. Find
the minimum cost from node S to node G.
Question ID: 2969
Assessment Type: CAT 1
[Image could not be loaded]
UniBud.in - Your Academic Companion
Question Bank
Generated on: 19/08/2025
27. List the evaluation criteria of search strategies in artificial intelligence. Explain in
detail.
Question ID: 2971
Assessment Type: CAT 1
28. Perform A* search and Greedy best-first search on the given graph to find the
shortest path from node a to node z. Each edge is labeled with the cost to
traverse that edge. Heuristic values are given in the table below the graph.
Question ID: 2973
Assessment Type: CAT 1
UniBud.in - Your Academic Companion
Question Bank
Generated on: 19/08/2025
29. Formulate the problem definition for a board of size 3*3 with eight numbered
tiles and a blank space. A tile adjacent to the blank space can slide into the
space. The object is to reach a specified goal state, such as the one shown on
the right of the figure.
Question ID: 2978
Assessment Type: CAT 1
UniBud.in - Your Academic Companion
Question Bank
Generated on: 19/08/2025
30. Formulate the problem definition for a travel-planning website
Question ID: 2979
Assessment Type: CAT 1
31. Detail the steps involved in identifying the optimal path from A to D using the
Uniform cost search algorithm for the following graph. Nodes represent the
locations and the values on the edges
represent the distance in Km.
Question ID: 2980
Assessment Type: CAT 1
UniBud.in - Your Academic Companion
Question Bank
Generated on: 19/08/2025
UniBud.in - Your Academic Companion
Question Bank
Generated on: 19/08/2025
32. Identify the optimal path from the start node to the goal node by implementing
Breadth-First search and depth-first strategies and compare the performance
metrics of both strategies.
Question ID: 2981
Assessment Type: CAT 1
UniBud.in - Your Academic Companion
Question Bank
Generated on: 19/08/2025
33. What do you mean by admissible heuristic function? Give an example.
Question ID: 2982
Assessment Type: CAT 1
34. Differentiate greedy-best first search and A* search by solving the search path
from node a to r in the following instance of the graph. The heuristic distance
value is given near the nodes.
Numbers written on the edges represent the distance between the nodes.
Question ID: 2983
Assessment Type: CAT 1
UniBud.in - Your Academic Companion
Question Bank
Generated on: 19/08/2025
35. Consider the following graph. If there is ever a decision between multiple
neighbor nodes in the BFS or DFS algorithms, assume we always choose the
letter closest to the beginning of the alphabet first.
i) In what order will the nodes be visited using a Breadth First Search?
ii) In what order will the nodes be visited using a Depth First Search?
Question ID: 2985
Assessment Type: CAT 1
UniBud.in - Your Academic Companion
Question Bank
Generated on: 19/08/2025
36. Perform the A* search algorithm and give the proof of optimality on the graph
below to find the shortest path from node S to node G. Each node is labeled with
a
capital letter and the value of a heuristic function. Each edge is labeled by the
cost to traverse that edge.
Question ID: 2988
Assessment Type: CAT 1
UniBud.in - Your Academic Companion
Question Bank
Generated on: 19/08/2025
37. Four soldiers need to cross a river. One of them is arrogant (A), one is lazy(L)
and two are brave (B1 & B2).
Rules:
* The raft can hold a maximum of two soldiers at a time.
* The lazy soldier will not be alone either on the raft or on the banks.
* The arrogant one will not travel on the raft with anyone else.
* Everyone can row and the raft cannot row itself.
Model the problem with each state represented in the following order:
(A, L, B1, B2). Represent it with bits 0/1 to indicate the bank in which the soldier
is. 1 represents that the soldier is in the Left bank, and O represents the soldier
is in the right bank. Shade the restricted states. Initial state: 1111; Final state
is: 0000. Draw the search space and search for the solution using DFS. List the
order of traversal.
Question ID: 3050
Assessment Type: FAT
UniBud.in - Your Academic Companion
Question Bank
Generated on: 19/08/2025
38. Perform Greedy Best First Search on the given graph. Prove that the A* search
algorithm returns the optimal solution on the graph below to find the shortest
path from node S to node G. Each node is labeled with a capital letter and the
value of a heuristic function. Each edge is labeled by the cost to traverse that
edge. Analyze the path cost obtained by both algorithms.
Question ID: 3051
Assessment Type: FAT
[Image could not be loaded]
39. Apply Breadth First Search and Depth First Search on the following tree to
identify the path from initial state A to the goal state I and H. Calculate the
performance of the algorithms in terms of completeness, optimality, space, and
time.
Question ID: 3065
Assessment Type: FAT
UniBud.in - Your Academic Companion
Question Bank
Generated on: 19/08/2025
40. Describe and illustrate the working principle of the A* search algorithm from start
state A to goal state J mentioned in the below sample graph. Here, the Numeric
value on each arc represents step cost, and heuristic values are given next to
each node. Are the given heuristic values admissible?- Justify your answer.
Question ID: 3066
Assessment Type: FAT
UniBud.in - Your Academic Companion
Question Bank
Generated on: 19/08/2025
UniBud.in - Your Academic Companion
Question Bank
Generated on: 19/08/2025
41. Perform the A* search algorithm on the graph below to find the shortest path
from node 0 to node 4. Each edge is labeled by the cost to traverse that edge.
Heuristic values are given in the table below the graph.
Question ID: 3079
Assessment Type: FAT
UniBud.in - Your Academic Companion
Question Bank
Generated on: 19/08/2025
42. Compare and discuss in brief on Breadth First Search, Depth First Search,
Depth limited search, Iterative deepening and uniform cost search in terms of
various performance metrics like time, space,
completeness and optimality.
Question ID: 3086
Assessment Type: FAT
43. Write the A* algorithm and perform it on the following graph to find the optimal
path and path cost.
Question ID: 3087
Assessment Type: FAT
UniBud.in - Your Academic Companion
Question Bank
Generated on: 19/08/2025
44. Consider the following graph Write the DFS routine. Starting from state A,
execute DFS. The goal node is G. Show the
order in which the nodes are expanded.
Assume that the alphabetically smaller
node is expanded first to break ties.
Question ID: 3090
Assessment Type: FAT
UniBud.in - Your Academic Companion
Question Bank
Generated on: 19/08/2025
45. Suppose you're a traveling salesperson tasked with visiting a set of cities and
returning to your starting point while covering the minimum distance possible.
You have a list of cities and the distances between them. The goal is to find the
shortest possible route that visits each city exactly once and returns to the
starting city. Assume that the starting city is 'C'.
Cities: A, B, C, D
Distances:
A to B: 10
A to C: 15
A to D: 20
B to C: 35
B to D: 25
C to D: 30
Demonstrate and compare the Depth-First-Search and Breadth-First-Search
traversals with their path.
Question ID: 3270
Assessment Type: FAT
UniBud.in - Your Academic Companion
Question Bank
Generated on: 19/08/2025
46. The graph given below represents the state space of a particular problem
domain. Find the most cost-effective path to reach from start state A to final
state J using the A* Algorithm. Show the tree expansions at each step with
proper
justification as to why a particular path is being chosen (The numbers written on
nodes represent the heuristic value).
Question ID: 3271
Assessment Type: FAT
UniBud.in - Your Academic Companion
Question Bank
Generated on: 19/08/2025
47. Write the depth-first search algorithm and apply it to the following tree to find the
path from the initial state to the goal state. Show the results of every step and
the final path reached. Initial state: 1, Goal state: 12.
Question ID: 3313
Assessment Type: FAT
UniBud.in - Your Academic Companion
Question Bank
Generated on: 19/08/2025
48. Apply A* heuristic search algorithm on the following graph to find the optimal
path from initial state 'B' to goal state 'G'. Show the results of every step and the
final optimal path reached and its path cost.
Question ID: 3314
Assessment Type: FAT
UniBud.in - Your Academic Companion
Question Bank
Generated on: 19/08/2025
49. Apply A* search algorithm on the provided graph and determine the
optimal path from node B to node J with the minimum total cost. Also,
provide the pseudocode for the A* search algorithm as part of your
solution
Question ID: 3403
Assessment Type: CAT 1
UniBud.in - Your Academic Companion
Question Bank
Generated on: 19/08/2025
50. Enumerate the classical "8 queen problem". Describe the state space for this
problem and give the solution.
Question ID: 3404
Assessment Type: CAT 1
51. Apply depth-first search and iterative deepening search techniques to
traverse a graph, starting at node A and aiming to reach node G.
Question ID: 3405
Assessment Type: CAT 1
UniBud.in - Your Academic Companion
Question Bank
Generated on: 19/08/2025
UniBud.in - Your Academic Companion
Question Bank
Generated on: 19/08/2025
52. Given two unmarked jugs, one which holds 7 litres, and another
which holds 11 litres, an unlimited supply of water, how do you
measure exactly 4 litres in 7 litres jug? Represent the solution using
state space search method and explain the steps.
Question ID: 3409
Assessment Type: CAT 1
53. Consider the following graph. The starting node is A and the goal
node is G. Find the actual and traversed paths from A to G using
uniform cost search along with the algorithm’s performance measures.
Question ID: 3410
Assessment Type: CAT 1
UniBud.in - Your Academic Companion
Question Bank
Generated on: 19/08/2025
54. Using A* algorithm solve the given the 15 puzzle problem consisting
of 1-15 numbered tiles on a square box (one tile space is blank). The
objective of this problem is to change the arrangement of tile from
initial state to goal state by using series of legal moves (one tile at a
time). The initial and goal states arrangement is shown below). Find the most
cost-effective path to reach the goal state from initial state using A* Algorithm.
Question ID: 3411
Assessment Type: CAT 1
UniBud.in - Your Academic Companion
Question Bank
Generated on: 19/08/2025
55. Apply greedy best first search on the following graph and find a path from the
start mode (S) to the goal node (E).
Question ID: 3511
Assessment Type: FAT
UniBud.in - Your Academic Companion
Question Bank
Generated on: 19/08/2025
UniBud.in - Your Academic Companion
Question Bank
Generated on: 19/08/2025
56. Consider the following search problem, represented as a graph. The start state
is S and the goal state is G. The heuristic values are given in the table below.
Perform Uniform cost search on the graph.
Question ID: 3513
Assessment Type: FAT
UniBud.in - Your Academic Companion
Question Bank
Generated on: 19/08/2025
57. Write the A* algorithm and perform it on the following graph to find the most
cost-effective path to reach from start state S to final state G using A* Algorithm.
The numbers written on edges represent the distance between the nodes. The
numbers written inside the nodes represent the heuristic value.
Question ID: 3514
Assessment Type: FAT
UniBud.in - Your Academic Companion
Question Bank
Generated on: 19/08/2025
UniBud.in - Your Academic Companion
Question Bank
Generated on: 19/08/2025
58. Formulate the Towers of Hanoi problem with the given initial and goal states.
The goal is to move all the disks to another peg, following these rules:
i) Only one disk can be moved at a time.
ii) A disk can only be moved to a peg that is empty or has a larger disk on top.
Draw the complete state space tree for this scenario.
Question ID: 3676
Assessment Type: FAT
59. You are given the state space shown below, where Ais the initial state, and F
and I are goal states. The numbers on the edges indicate action costs. Explain
how the Depth First search and Breadth First search algorithm can be applied to
find out the optimal path from initial state to the goal state for this problem.
Discuss the advantages and disadvantages of these algorithms in this context.
Question ID: 3677
Assessment Type: FAT
UniBud.in - Your Academic Companion
Question Bank
Generated on: 19/08/2025
60. You are designing a search algorithm for a robot navigating a maze. Which
search algorithm would be more suitable, Breadth-First Search or Depth-First
Search? Justify your choice.
Question ID: 5283
Assessment Type: CAT 1
UniBud.in - Your Academic Companion
