20.2 - Greedy Strategies
Enroll to start learning
You’ve not yet enrolled in this course. Please enroll for free to listen to audio lessons, classroom podcasts and take practice test.
Practice Questions
Test your understanding with targeted questions
Define what a 'greedy algorithm' is.
💡 Hint: Think about how it relates to local choices.
What is 'lateness' in job scheduling?
💡 Hint: Consider how this relates to deadlines.
4 more questions available
Interactive Quizzes
Quick quizzes to reinforce your learning
What is the primary goal of minimizing lateness in job scheduling?
💡 Hint: Consider what it means to arrive before deadlines.
True or False: The shortest job first strategy is guaranteed to minimize lateness.
💡 Hint: Think of how choices impact overall outcomes.
Get performance evaluation
Challenge Problems
Push your limits with advanced challenges
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.
💡 Hint: Pay attention to how each job’s completion time relates to its deadline.
Create a counterexample where the slack-first strategy leads to higher lateness than the deadline-first method.
💡 Hint: Analyze job lengths and deadlines closely.
Get performance evaluation
Reference links
Supplementary resources to enhance your learning experience.