Practice Design And Analysis Of Algorithms (21.1)

Practise this section

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

6 sample questions

Question 1.
What does DFS stand for?
Show hintHide hint
Think about how it explores graphs.
Question 2.
What is the primary strategy of DFS?
Show hintHide hint
Consider how it contrasts with BFS.
3Question 3.
What does DFS explore first?
- All nodes at the same level
- The deepest node available
- The shortest path
Show hintHide hint
Remember the keyword 'Depth'.
4Question 4.
True or False: DFS guarantees the shortest path in a graph.
- True
- False
Show hintHide hint
Think about how the two strategies differ.
Question 5.
Given a directed graph, how would you modify DFS to count the number of strongly connected components?
Show hintHide hint
Think about how connections are established backwards.
Question 6.
Implement a DFS algorithm that returns the path taken from the starting vertex to a target vertex.
Show hintHide hint
How would you track the path taken during recursion?

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