Practice Example Of Bfs Execution (20.3.4) - Breadth First Search (BFS)

Practice: Example of BFS Execution

Lesson 20.3.4Breadth First Search (BFS)

Practise this section

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

6 sample questions

Question 1.
What does BFS stand for?
Show hintHide hint
Think about how the search explores the graph.
Question 2.
How do we keep track of vertices that have been visited in BFS?
Show hintHide hint
Consider whether we need to revisit vertices.
3Question 3.
What is the main advantage of using a queue in BFS?
- To store vertices in a last-in
- first-out manner
- To manage which vertices to explore next in a first-in
- first-out manner
- To ignore vertices that have been visited
Show hintHide hint
Think about how BFS needs to manage the order of exploration.
4Question 4.
The time complexity of BFS using an adjacency matrix is?
- O(n)
- O(n^2)
- O(n + m)
Show hintHide hint
Consider how many entries are in the matrix for n vertices.
Question 5.
Given the following graph composed of vertices and edges, write a BFS algorithm that starts with vertex 1 and outputs the order of vertices visited.
Show hintHide hint
Consider how neighbors are added to the queue.
Question 6.
Design a graph with 10 vertices and at least 8 edges such that BFS starting from vertex 1 visits vertices in the order of 1, 2, 3, 4, 5, .... Write what this order reveals about the graph's structure.
Show hintHide hint
Visualize how each vertex connects and ensures every next vertex is reached during exploration.

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