Exam 3: Planning and Scheduling

What is the minimum time to complete 12 independent tasks on four processors when the sum of all the times of the 12 tasks is 60 minutes?

Given the order-requirement digraph below (with time given in minutes) and the priority list T₁, T₂, T ₃, T₄, T₅, T₆, T₇, T₈, apply the list-processing algorithm to construct a schedule using two processors. How much time does the resulting schedule require?

Choose the packing that results from the use of the next-fit (NF) bin-packing algorithm to pack data files with the following sizes onto compact discs that can hold no more than 700 MB. 100 MB, 500 MB, 250 MB, 350 MB, 400 MB, 250 MB, 450 MB, 200 MB, 50 MB

Use the order requirement digraph below (with time given in minutes) and the priority list T₁, T₂, T₃, T₄, T₅, T₆, T₇, T₈ to answer the following Questions -Apply the critical-path scheduling algorithm to construct a schedule using three processors.

What is the minimum time required to complete 12 independent tasks on three processors when the sum of all the times of the 12 tasks is 60 minutes?

Which of the following is a correct vertex coloring of the given graph? (Capital letters indicate which color the vertex is colored.)

Find the chromatic number of the graph below:

Find the chromatic number of the graph below.