Question 3.15

15. A radio announcer has 10 songs of various lengths to schedule into several segments. The announcer must identify the station at least once every 15 minutes, so the segments cannot be longer than 15 minutes. This job can be solved using the

  1. list-processing algorithm for independent tasks.
  2. critical-path scheduling algorithm.
  3. first-fit algorithm for bin packing.

15.

c