Practice Greedy Strategies (20.2) - Greedy Algorithms: Minimizing Lateness

Practice: Greedy Strategies

Lesson 20.2Greedy Algorithms: Minimizing Lateness

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.
Define what a 'greedy algorithm' is.
Show hintHide hint
Think about how it relates to local choices.
Question 2.
What is 'lateness' in job scheduling?
Show hintHide hint
Consider how this relates to deadlines.
3Question 3.
What is the primary goal of minimizing lateness in job scheduling?
- To complete all jobs as quickly as possible
- To reduce maximum lateness across all jobs
- To prioritize the longest jobs
Show hintHide hint
Consider what it means to arrive before deadlines.
4Question 4.
True or False: The shortest job first strategy is guaranteed to minimize lateness.
- True
- False
Show hintHide hint
Think of how choices impact overall outcomes.
Question 5.
Consider three jobs: Job A (3 hours, deadline 9), Job B (5 hours, deadline 5), and Job C (2 hours, deadline 7). Arrange them using the deadline-first approach and calculate the maximum lateness.
Show hintHide hint
Pay attention to how each job’s completion time relates to its deadline.
Question 6.
Create a counterexample where the slack-first strategy leads to higher lateness than the deadline-first method.
Show hintHide hint
Analyze job lengths and deadlines closely.

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