Advanced Algorithms, End Term
May 2024 term, 1 Sept 2024, Set QDB1
At each iteration, pick the remaining request with the fewest number of conflicts with other remaining requests (breaking ties arbitrarily).
At each iteration, pick the remaining request with the earliest start time.
At each iteration, pick the remaining request with the earliest finish time.
At each iteration, pick the remaining request which requires the least time (i.e., has the smallest value of ti — si) (breaking ties arbitrarily).
Sign in to report a problem with this question.
You cannot change your answers after submitting.
The palette shows the status of every question. Pick a number to go straight to it.
Figure from the original question paper Figure from the original question paper Figure from the original question paper
