Reg.No (Ex. RA2311027010076)

Full Name

Section

Mail-Id

Which of the following is an uninformed search algorithm?

• A* Search
• Greedy Best-First Search
• Breadth-First Search (BFS)
• Iterative Deepening A* (IDA*)

Which search algorithm guarantees the shortest path in an unweighted graph?

• Depth-First Search (DFS)
• Breadth-First Search (BFS)
• A* Search
• Uniform Cost Search (UCS)

Which of the following is a feature of Depth-First Search (DFS)?

• It is guaranteed to find the optimal solution.
• It explores all nodes at the current depth level before moving to the next.
• It explores a node as far as possible before backtracking.
• It uses a heuristic function to guide the search.

Which of the following algorithms uses a heuristic function to guide the search toward the goal?

• Uniform Cost Search (UCS)
• Depth-First Search (DFS)
• A* Search
• Breadth-First Search (BFS)

In the A* search algorithm, which function is used to determine the next node to explore?

• g(n)
• f(n) = g(n) + h(n)
• h(n)
• f(n) = g(n) - h(n)

Which of the following is a disadvantage of using Depth-First Search (DFS)?

• It can get stuck in infinite loops in cyclic graphs.
• It cannot find the optimal solution.
• It requires a large amount of memory.
• It is guaranteed to find the shortest path in weighted graphs.