Practice Using Adjacency List (24.1.6) - Topological Ordering of Directed Acyclic Graphs (DAG)

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.
What is the in-degree of a vertex with no incoming edges?
Show hintHide hint
Think about the definition of in-degree.
Question 2.
How can we represent a DAG using an adjacency list?
Show hintHide hint
Visualize the connections between vertices.
3Question 3.
What does in-degree indicate for a vertex?
- Number of outgoing edges
- Number of incoming edges
- Total connections
Show hintHide hint
Think about where the edges are coming from.
4Question 4.
True or False: In a DAG, a vertex may have a cycle.
- True
- False
Show hintHide hint
Recall the properties of a DAG.
Question 5.
Create an adjacency list and calculate the in-degrees for a graph described by the edges: A -> B, A -> C, B -> C, B -> D, C -> E.
Show hintHide hint
Start by visualizing how each vertex connects.
Question 6.
Given a list of tasks and prerequisites, outline the steps to achieve a topological sort and provide the order of task completion.
Show hintHide hint
Keep track of tasks with no remaining prerequisites.

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