Data Structure › Time Complexity › Question #15252
MCQ Single Best Answer Easy

QWhat is the time complexity of a depth-first search (DFS) algorithm on a graph with V vertices and E edges?

ID: #15252 Time Complexity 161 views
Question Info
#15252Q ID
EasyDifficulty
Time ComplexityTopic
Start Quiz on This Topic
 Your Answer

Choose the Best Option

Click any option to instantly check if you're correct.

  • A O(1) ✔ ✖
  • B O(log V) ✔ ✖
  • C O(V) ✔ ✖
  • D O(V + E) ✔ ✖
Correct Answer: Option D

Explanation

Depth-first search (DFS) is a graph traversal algorithm that explores as far as possible along each branch before backtracking. In the worst case, DFS 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). Therefore, the time complexity of DFS is O(V + E).

 Continue Practice
Previous Question Next Question
 Share

Share This Question

Challenge a friend or share with your study group.

 More from This Topic

Related MCQ Questions

What is the time complexity of a depth-first search (DFS) algorithm on a directed acyclic graph (DAG) with V v What is the time complexity of a merge sort algorithm for sorting an array of n elements in the worst case? What is the time complexity of a delete operation in a binary heap in the worst case? What is the time complexity of a selection sort algorithm for sorting an array of n elements in the worst case What is the time complexity of a selection sort algorithm for sorting an array of n elements in the worst case What is the time complexity of a bubble sort algorithm for sorting an array of n elements in the worst case? What is the time complexity of a linear search algorithm for an unsorted array of n elements in the worst case What is the time complexity of a binary search algorithm for finding an element in a sorted array of n element What is the time complexity of a topological sort algorithm on a directed acyclic graph (DAG) with V vertices What is the time complexity of a quicksort algorithm for sorting an array of n elements in the worst case?