Practice Naive Vs. Incremental Computation (25.1.6)

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 Directed Acyclic Graph (DAG)?
Show hintHide hint
Think about arrows and paths.
Question 2.
What does topological sorting accomplish?
Show hintHide hint
Consider task dependencies.
3Question 3.
What defines a Directed Acyclic Graph (DAG)?
- Has cycles
- No cycles
- Is undirected
Show hintHide hint
Focus on the acyclic part.
4Question 4.
Topological sorting arranges vertices in what manner?
- True
- False
Show hintHide hint
Think about the prerequisite relationships.
Question 5.
Given a set of tasks with dependencies listed as pairs (A, B) meaning A must be done before B, design a DAG and determine the longest path.
Show hintHide hint
Map out tasks visually.
Question 6.
You have a set of 10 courses with specified prerequisites. How would you use the longest path concept to determine the course load a student would have each semester?
Show hintHide hint
Using a graph drawing can help clarify dependencies.

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