For Question 5 and 6 –

Consider the following graph.

(Note: Duplicate Nodes are not expanded) (Write the answer as a capitalized string with no spaces. For example, if the
order of exploration is A followed by B followed by C followed by D then write ABCD)

Q5. A is the initial state and we always pick the lexicographically smallest state in case of a tie. If the goal state is L, find the
order of exploration of states in BFS?
Answer:- ABCDEFGHIJKL

Q6. A is the initial state and we always pick the lexicographically smallest state in case of a tie. If the goal state is L, find the
order of exploration of states in UCS?

Answer:- ADBGCFHJEKIL

Q6. Consider the graph shown below and answer the next three questions based on it. In the graph, all nodes represent a
state. A is the start state, and G is the goal state. The value of the heuristic function for each node is mentioned alongside.
For example, the value of the heuristic at E is 1, and at C is 4, etc. Similarly the cost of transitioning from a state to another
state is mentioned on the edges. For example, the cost of transitioning from B to D is 3 points.

Write down the order of nodes visited by A* graph search algorithm?

(A) A, C, D, E, G
(B) A, B, C, D, F, E, G
(C) A, B, D, F, C, E, G
(D) A, B, D, F, E, G

Answer:- (C) A, B, D, F, C, E, G

Topic Assigned: Problem solving by Searching- Uninformed Search

Sl.
QUESTION OPTION- 1 OPTION- 2 OPTION- 3 OPTION- 4 REMARKS
No.
Suppose we do Iterative Deepening Search
(IDS).Instead of increasing depths as 1,2,3,4,….we More efficient
1 increase it as 1,2,4,8,16….i.e, double the depth Complete than standard 2 marks
instead of increasing it by 1. This modified version of Optimal but not but not IDS in the worst
IDS is __________ complete optimal case None of the above
Breadth First
Depth First Breadth First Uniform Cost & Search, Uniform
2 Suppose there is only one goal state and each step Search & Search & Iterative Cost Search & 2 marks
cost is k (k >0). Which of the following search Breadth First Uniform Deepening Iterative
algorithms will return the optimal path? Search Cost Search Search Deepening Search
 Consider the following graph in which we are
searching from start state A to goal state G.The
number over each edge is the transition cost.Find the
path to the goal found by Depth First Search with
full duplicate detection, which explores children in
lexicographical order.

3 ABDFG ACDFG ABDEG ACDEG 4 marks

 Consider the following directed graph in which we
are searching from start state 'a' to goal state 'd'. The
number over each edge is the transition cost. Apply
Uniform Cost Search and find the shortest path from
start state 'a' to the goal state 'd'.

4 acd abd aced abcd 4 marks

S.NO QUESTION CHOICE CHOICE CHOICE CHOICE REMARKS
1 2 3 4
1 Find the h(n) value of the given board. 11 8 14 12 Let us find the distance between the given
position of the tiles to the target position.
Given board 1=0
1 4 2 2=1
7 5 8 3=3
6 3 4=2
5=0
6=3
Target board
7=1
1 2 3 8=2
4 5 6 Therefore h(n)=12
7 8
2 Find the path from A to J using A* search algorithm A->B- A->F-> A->F- A->B-
>D->E- G->I->J >H->I- >C->E-
>J >J >J
3 Find the path from A to G using Greedy search algorithm A->B- A->E- A->B- A->D-
>G >D->G >C >G

4 Which algorithm is used in graph traversal and path A* C* D* E* A* algorithm is used in graph traversal and
finding? path finding. It is an example of best first
search.