Practice Shortest Path Properties (20.5.1) - Breadth First Search (BFS)

Practise this section

10 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
4 questions · about 3 min · pass mark 70%. Hints available.
Sign up to start the quiz

6 sample questions

Question 1.
Define what a graph is.
Show hintHide hint
Think about what makes up a graph.
Question 2.
What does BFS stand for?
Show hintHide hint
Think about how the algorithm explores the graph.
3Question 3.
What is the function of the queue in BFS?
- To store visited vertices
- To manage vertices to explore next
- To calculate distances
Show hintHide hint
Think about the order of exploration.
4Question 4.
True or False: BFS can only be used in weighted graphs.
- True
- False
Show hintHide hint
Consider the properties of BFS.
Question 5.
Given a graph with weights, can you apply the BFS algorithm to find the shortest path? What modifications would you have to make?
Show hintHide hint
Consider what BFS generally assumes about edge distances.
Question 6.
If we add another component to the graph that is disconnected from the initial source, how would BFS react? What would be the result?
Show hintHide hint
Think about how BFS operates on connected vertices.

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