Enrol to start learning
Reading is open to everyone. Enrolling is free, and it is what unlocks the audio lessons, practice tests and progress tracking.
25.1.6. Naive vs. Incremental Computation
This section
Practice test
10 questions on this section. Wrong answers show you what to read again.
Sign up to take itWhole chapter
Revision test
Mixed questions from across the chapter. Your answers get marked.
Sign up to take itQuick
Flashcard drill
2 cards from this lesson. Good the night before a test.
Try these first
- 1.
What is a Directed Acyclic Graph (DAG)?
Hint
Think about arrows and paths.
- 2.
What does topological sorting accomplish?
Hint
Consider task dependencies.
- 3.
What defines a Directed Acyclic Graph (DAG)?
- Has cycles
- No cycles
- Is undirected
Hint
Focus on the acyclic part.
- 4.
Topological sorting arranges vertices in what manner?
- True
- False
Hint
Think about the prerequisite relationships.
- 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.
Hint
Map out tasks visually.
- 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?
Hint
Using a graph drawing can help clarify dependencies.
Exercises
Total Questions
2
Estimated Time
4 min
Passing Score
70%
Instructions
- Read each question carefully
- You can use hints if you need help
- Complete all questions before submitting
4 more questions available
Enrol freeQuiz
Total Questions
2
Estimated Time
4 min
Passing Score
70%
Instructions
- Read each question carefully
- You can use hints if you need help
- Complete all questions before submitting
Get your answers marked and your progress tracked
Enrol freeChallenge Problems
Total Questions
2
Estimated Time
4 min
Passing Score
70%
Instructions
- Read each question carefully
- You can use hints if you need help
- Complete all questions before submitting