Practice Describing The Burning Process (26.1.7.1) - 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 what costs might represent in an application.
Question 2.
What does edge cost represent?
Show hintHide hint
Consider what expense could be related to transport.
3Question 3.
What does a weighted graph include?
- Only edges
- Edges with costs
- Vertices only
Show hintHide hint
Think about graphs used in transportation.
4Question 4.
True or False: A shortest path always has the fewest edges.
- True
- False
Show hintHide hint
Reflect on the burning analogy.
Question 5.
Consider a graph with vertices A, B, C, and D connected by edges with the following weights: A-B: 4, A-C: 2, C-B: 5, B-D: 1. Calculate the shortest path from A to D using Dijkstra's algorithm.
Show hintHide hint
Keep track of the lowest costs as you move through unvisited vertices.
Question 6.
You have a weighted graph where some edges are negative. What will happen when applying Dijkstra's Algorithm, and what alternative would you consider?
Show hintHide hint
Review the properties of the algorithms for different contexts.

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