Practice Using Dfs For Strongly Connected Components (22.5.2)

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 is a strongly connected component?
Show hintHide hint
Think about connectivity in subgraphs.
Question 2.
What does DFS stand for?
Show hintHide hint
Focus on how we traverse through graphs.
3Question 3.
What defines a strongly connected component?
- A subset of vertices that can reach each other
- A subset of vertices that cannot reach each other
Show hintHide hint
It’s about how vertices relate to each other.
4Question 4.
True or False: Only back edges in a directed graph can indicate the presence of a cycle.
- True
- False
Show hintHide hint
Think of the direction of edges in cycles.
Question 5.
Given a directed graph with certain edges, use DFS to identify and list all strongly connected components.
Show hintHide hint
Pay special attention to back edges.
Question 6.
Design an algorithm that employs DFS to count the number of strongly connected components in a graph.
Show hintHide hint
One count for each new SCC discovered!

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