Quiz on BFS and DFS Algorithms

What type of data structure does BFS use?

• Stack

• Priority Queue

• Queue

• Tree

What is the main characteristic of uninformed search algorithms?

• They use heuristics

• They are always optimal

• They do not use domain knowledge

• They use backtracking

Which of the following is true about BFS?

• It always finds the deepest path

• It uses LIFO order

• It finds the shortest path if all step costs are equal

• It never consumes more memory than DFS

In BFS, nodes are explored in what order?

• Alphabetical order

• Last-visited first

• Deepest node first

• Level by level

Which real-world activity best represents BFS?

• Solving a maze

• Finding an item in a supermarket row-by-row

• Navigating deep menu options in a food app

• Searching nested folders

Which algorithm uses recursion or a stack?

• BFS

• Dijkstra

• DFS

• A*

In DFS, the search goes as deep as possible before...

• Halting

• Skipping nodes

• Backtracking

• Returning an error

What is a drawback of DFS?

• Requires a lot of memory

• Cannot be used on trees

• May not find the shortest path

• Is always slower than BFS

Which example illustrates DFS in a real-world situation?

• Suggesting mutual friends

• Searching for a file in multiple drives simultaneously

• Searching deep into one folder path before checking others

• Visiting a social network friend graph

Which structure is visited first in DFS?

• All nodes at level 1

• The deepest node in one path

• All child nodes of the root

• The node with the lowest cost