Practice Exchange Argument (20.6) - Greedy 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 lateness in terms of job scheduling.
Show hintHide hint
Think about how we measure if a job is late.
Question 2.
What is a greedy algorithm?
Show hintHide hint
Consider how you would decide what to schedule first.
3Question 3.
What term describes the difference between finish time and deadline?
- Lateness
- Idle Time
- Completion Time
Show hintHide hint
Focus on what it means for a job to be completed late.
4Question 4.
True or False: A job can be done late but still be optimal.
- True
- False
Show hintHide hint
Consider the definition of optimal in relation to deadlines.
Question 5.
Consider a scenario with jobs that all have the same processing time but different deadlines. How would you schedule them, and why?
Show hintHide hint
Think about what happens if they don't follow the deadlines.
Question 6.
If you have multiple jobs that can be completed in parallel with a single resource, how would minimal lateness change?
Show hintHide hint
Consider how job dependencies affect order.

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