Practice Data Structures For Bfs (20.3.2) - Breadth First Search (BFS)

Practise this section

9 questions

Flashcard drill
5 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 an adjacency matrix represent?
Show hintHide hint
Think about how vertices are arranged in a grid.
Question 2.
What is the role of the visited array in BFS?
Show hintHide hint
Consider why we don’t want to revisit vertices.
3Question 3.
What does BFS stand for?
- Binary First Search
- Breadth First Search
- Normal First Search
Show hintHide hint
Focus on the term 'breadth' when thinking about exploration.
4Question 4.
True or False: BFS can be used to find the shortest path in an unweighted graph.
- True
- False
Show hintHide hint
Consider the meaning of 'shortest path' in this context.
Question 5.
Given a graph represented as an adjacency list, outline how you would implement BFS in Python, including edge cases.
Show hintHide hint
Think about how to handle special cases like isolated vertices.
Question 6.
Explain how you would modify the BFS algorithm to find the longest path in an unweighted graph.
Show hintHide hint
Consider the inverse nature of finding longest as opposed to shortest.

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