University of Sargodha BS 7 Semester / 3W Semester (5* Intake) Exam 2025 Paper: IT Infrastructure (ITCC-407/1TCC4544) Part 2, Q 5, Q6

0.5.

If we use Uniform-Cost Search:

a What in the final path for this search?

b) What is the final path for this DES search? If a node has multiple successors, then we always

expand the successors in increasing alphabetical order.

c) What is the final path for this A* search?

The start state is S, and the goal state is G. The transition costs are next to the edges, and the heuristic

estimate, h, of the distance from the state to the goal is in the state's node. Assume ties are always

broken by choosing the state which comes first alphabetically.

32

h 9

S

5

30

10

h=6

E

a) What is the order of states expanded using Depth First Search? Assume DFS terminates as soon

as it reaches the goal state.

b) What is the order of states expanded using Breadth First Search?

c) What is the order of states expanded using Best First Search? Assume BFS terminates as soon as

it reaches the goal state.

d) What is the order of states expanded using A* search?

c) What is a least cost path from S to G?

For a general search problem, state which of breadth-first search (BFS) or depth-first search (DFS)

is preferred under which of the following conditions:

a) A shallow solution (path from initial state to goal state) is preferred.

b) The search tree may contain large or possibly infinite branches.

c) Very large memory space to store the search tree (or the queue) is available.

- LK-4998/15-07-25 -----