Practice Connected Components (22.2) - Applications of BFS and DFS - Design & Analysis of Algorithms

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 connected component in a graph?
Show hintHide hint
Think about the paths between vertices.
Question 2.
Which algorithm would you use to find connected components?
Show hintHide hint
These are fundamental algorithms for graph traversal.
3Question 3.
What defines a connected component?
- A single vertex
- Maximal set of vertices with paths between them
- Any collection of vertices
Show hintHide hint
Think about the connections in a cluster of vertices.
4Question 4.
True or False: A tree graph is always a connected graph.
- True
- False
Show hintHide hint
Recall the definition of a tree.
Question 5.
Given a graph represented by an adjacency list, determine the connected components and count them.
Show hintHide hint
Keep an array for visited nodes.
Question 6.
Design a directed graph with vertices and edges that ensure it has at least one strongly connected component but also some non-strongly connected nodes.
Show hintHide hint
Think about how cycles permit bidirectional reach.

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