Breadth First Search Quiz

Which data structure is used in breadth first search?

• Queue

• Stack

• Array

• Heap

What is the traversal algorithm used in breadth first search?

• queue

• stack

• linked list

• heap

What is the main purpose of breadth first search?

• To find the shortest path between two vertices.

• To explore all the vertices of a graph or tree in breadth-first order.

• To find the maximum flow in a network.

• To sort the vertices of a graph in ascending order.

Which type of graph is used in breadth first search?

• Undirected graph

• Cyclic graph

• Weighted graph

• Directed graph

What is the time complexity of breadth first search?

• O(V)

• O(E)

• O(V + E)

• O(V * E)

In breadth first search, which vertex is visited first?

• Starting vertex or root vertex

• Random vertex

• Middle vertex

• Last vertex

Which of the following is NOT a step in breadth first search?

• C

• B

• D

• A

What is the space complexity of breadth first search?

• O(V^2)

• O(V)

• O(log V)

• O(E)

Which of the following is true about breadth first search?

• It only visits vertices on the left side of the tree

• It visits vertices in a random order

• It visits all the vertices at the same level before moving on to the next level.

• It always starts from the root node

What is the main difference between breadth first search and depth first search?

• The order in which they explore the nodes.

• The number of nodes they explore.

• The distance between explored nodes.

• The type of nodes they explore.