Suppose you have the following project digraph. (The numbers in parentheses represent hours.)
Consider the following timeline using two processors.
A. This is the timeline one gets using the decreasing-time algorithm.
B. This timeline is an optimal schedule.
C. This timeline is an illegal schedule.
D. This is the timeline one gets using the critical-path algorithm.
E. none of these
Answer: C
You might also like to view...
Determine if the geometric series converges or diverges. If it converges, find its sum.1 + (-4) + (-4)2 + (-4)3 + (-4)4 + . . .
A. diverges B. converges, 16 C. converges, 4 D. converges, 40
Identify the numerator and denominator.
A. Numerator 29
Denominator 23
B. Numerator 1
Denominator 
C. Numerator 23
Denominator 29
D. Numerator 
Denominator 1
List all possible rational zeros given by the Rational Zeros Theorem. Do not check to see which actually are zeros.
?
?
A. ?
B. ?
C. ?
D. ?
E. ?
Simplify.
A. 0 B. -3 C. ±3 D. 3