Quiz

1. What is the feature of the dijkstra algorithm?

a. minimal path
b. long way
c. worst way
d. best way
2. Dijkstra's algorithm is more used in?
a. telematics
b. graph
c. list
d. queue
3. What is the asymptotic cost in the worst case?
a. O(n)
b. O(log n)
c. O(|V|+|A|) = O(|V|)
d. O(v)
4. the dijkstra algorithm consists of?
a. n interactions
b. n-2 interactions
c. n-1 interactions
d. v interactions
5. the dijkstra algorithm how many interactions do?
a. O(n)
b. O(n-1)
c. O(n2)
d. O(n+1)