Computer Science and Engineering › Time Complexity › Question #15271
Single Choice Easy

QWhat is the time complexity of a topological sort algorithm on a directed acyclic graph (DAG) with V vertices and E edges?

ID: #15271 Time Complexity 180 views
Question Info
#15271Q 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

Explanation

Topological sort is an algorithm used to linearly order the vertices of a directed acyclic graph (DAG) based on their dependencies. It employs depth-first search (DFS) to visit all the vertices, resulting in a time complexity proportional to the sum of the number of vertices (V) and the number of edges (E), denoted as 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 vertices and E edges?... 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 binary search algorithm for finding an element in a sorted 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 depth-first search (DFS) algorithm on a graph with V vertices and E edges?... What is the time complexity of a quicksort algorithm for sorting an array of n elements in the worst case?...