Complexity Analysis (Big O) - Complexity Analysis

Download Q&A
Q. What is the time complexity of a breadth-first search (BFS) on a graph with V vertices and E edges?
  • A. O(V)
  • B. O(E)
  • C. O(V + E)
  • D. O(V * E)
Q. What is the time complexity of deleting an element from a stack?
  • A. O(1)
  • B. O(n)
  • C. O(log n)
  • D. O(n^2)
Showing 1 to 2 of 2 (1 Pages)
Soulshift Feedback ×

On a scale of 0–10, how likely are you to recommend The Soulshift Academy?

Not likely Very likely