Practice Formal Algorithm Description (26.1.7.2) - Shortest Paths in Weighted Graphs

Practise this section

8 questions

Flashcard drill
2 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
2 questions · about 1 min · pass mark 70%. Hints available.
Sign up to start the quiz

6 sample questions

Question 1.
What is a weighted graph?
Show hintHide hint
Think about graphs with varying edge costs.
Question 2.
What does Dijkstra's Algorithm do?
Show hintHide hint
Recall the fire spreading analogy.
3Question 3.
What is the primary objective of Dijkstra's Algorithm?
- To find the longest path
- To find the shortest path from a single source
- To connect all vertices
Show hintHide hint
Focus on the term 'shortest path'.
4Question 4.
True or False: Dijkstra's Algorithm can handle graphs with negative edge weights.
- True
- False
Show hintHide hint
Remember how weights work in the algorithm.
Question 5.
Given a graph with vertices A, B, C, and D, and edges with weights between them, find the shortest path from A to D using Dijkstra's algorithm.
Show hintHide hint
Don't forget to update the neighbors' costs after visiting a vertex.
Question 6.
Explain why Dijkstra's algorithm fails with negatively weighted edges, and provide an example.
Show hintHide hint
Consider paths that could 'get shorter' after visiting them.

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