Bellman-Ford Quiz


Bellman-Ford Quiz

Question 1
What is the worst case performance, expressed in Big-O notation, of the Bellman-Ford algorithm?
A
O(|E|+|V|)
B
O(log(n))
C
O(1)
D
O(|V||E|)
E
O(n^2)
Question 2
What is the average case performance, expressed in Big-O notation, of the Bellman-Ford algorithm?
A
O(|E|+|V|)
B
O(log(n))
C
O(1)
D
O(|V||E|)
E
O(n^2)
Question 3
What is the worst case space-complexity, expressed in Big-O notation, of the Bellman-Ford algorithm?
A
O(1)
B
O(|V|)
C
O(|V||E|)
D
O(|E|+|V|)
E
O(|E|)
There are 3 questions to complete.
List
Return
Shaded items are complete.
123
Return