Practice Classifying Non-tree Edges (22.4.2.2)

Practise this section

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

6 sample questions

Question 1.
Define a tree edge.
Show hintHide hint
Think about the edges used during BFS or DFS.
Question 2.
What is a cycle in a graph?
Show hintHide hint
Consider the structure of a loop in a path.
3Question 3.
What is a tree edge in graph traversal?
- An edge that connects any two nodes.
- An edge used to visit a vertex.
- An edge not used in traversal.
Show hintHide hint
Think about the edges that allow you to explore new vertices.
4Question 4.
Does a directed graph have cycles if a back edge exists?
- True
- False
Show hintHide hint
Recall the definition of a back edge presented in class.
Question 5.
Given a directed graph defined by edges: (1, 2), (2, 3), (3, 1), (4, 5), and (5, 4), identify the cycles present.
Show hintHide hint
Look for edges that link back to previously visited nodes.
Question 6.
Using a BFS algorithm, identify if the graph contains cycles and classify the edges in a graph presenting: (A, B), (B, C), (C, A), (D, E).
Show hintHide hint
Trace the graph traversal to see if any nodes revisit earlier nodes.

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