Practice Week- 04 (27.1.4) - Mathematical Institute - Design & Analysis of Algorithms

Practise this section

9 questions

Flashcard drill
3 cards from this section. Quick, good the night before a test.
Exercise
6 questions · about 4 min · pass mark 70%. Hints available.
Sign up to start the exercise
Quiz
3 questions · about 2 min · pass mark 70%. Hints available.
Sign up to start the quiz

6 sample questions

Question 1.
What does Dijkstra's algorithm aim to find?
Show hintHide hint
Think about the routes in a graph.
Question 2.
Is Dijkstra's algorithm applicable for graphs with negative weight edges?
Show hintHide hint
Recall what happens with negative cycles.
3Question 3.
What type of algorithm is Dijkstra’s?
- Greedy
- Dynamic Programming
- Brute-force
Show hintHide hint
Recall the characteristics of Dijkstra's strategy.
4Question 4.
Is it true that Dijkstra's algorithm can handle negative weights?
- True
- False
Show hintHide hint
Think about the implications of negative paths.
Question 5.
Create a graph with vertices and edges, some with negative weights and demonstrate Dijkstra's failure.
Show hintHide hint
Be sure to showcase a path where earlier choices seem optimal.
Question 6.
Explain how the use of a heap impacts the efficiency of Dijkstra's algorithm.
Show hintHide hint
Think about the performance impact on large datasets.

5 more questions in this section. Enroll free to practise them all.