Depth First Search Quiz


Depth First Search Quiz

Question 1
What is the worst case performance, expressed in Big-O notation, of the Depth First Search algorithm?
A
O(|E|+|V|)
B
O(log(n))
C
O(n)
D
O(|V||E|)
E
O(n^2)
Question 1 Explanation: 
The worst case performance is dependent on the number of edges and vertices.
Question 2
What is the worst case space complexity, expressed in Big-O notation, of the Depth First Search algorithm?
A
O(|V|^2)
B
O(log(|V|))
C
O(|V|)
D
O(|E|+|V|)
E
O(|V||E|)
Question 2 Explanation: 
The worst case space complexity is solely dependent on the number of vertices.
There are 2 questions to complete.
List
Return
Shaded items are complete.
12
Return