Q: What is the time complexity of a breadth-first search (BFS) algorithm on a graph with V vertices and E edges?

A O(1)
B O(log V)
C O(V)
D O(V + E)

Share this MCQ

Answer: D

Explanation:

Breadth-first search (BFS) is a graph traversal algorithm that explores all vertices at the same level before moving to the next level. In the worst case, BFS visits each vertex once and each edge once, resulting in a time complexity proportional to the sum of the number of vertices (V) and the number of edges (E). Hence, the time complexity of BFS is O(V + E).

Time Complexity

Share Above MCQ

‹ Previous Next ›

Write your comment

Learn More MCQ Questions from Data Structure Time Complexity

Q: What is the time complexity of a breadth-first search (BFS) algorithm on a graph with V vertices and E edges?

Report Question