greedy-dijkstra

Using the figure above, what is the best-case scenario for the longest path using a greedy algorithm?

• optimal choice

• greedy choice

Which of the following greedy algorithm is NOT the value using greedy choice?

• 34

• 110

• 38

What is the first value of the figure above using greedy choice for the longest path?

• 34

• 110

• 38

Using greedy choice of the above figure, what is the scenario?

• BEST CASE

• AVERAGE CASE

• WORSE CASE

Using the figure above, what is the shortest path of A for the Dijkstra algorithm?

• B

• C

Using the figure above, what is the shortest path of E for the Dijkstra algorithm?

• B

• C

Using the figure above, what is the shortest path of D for the Dijkstra algorithm?

• C

• E

Using Dijkstra Algorithm, that is the shortest path of C?

• A

• B

• E

• D

Using Dijkstra Algorithm, that is the shortest path of C?

• A

• B

• E

• D

Using the Dijkstra Algorithm, of the above figure, which is a worst case scenario?

• A

• B

• E

• F