Multiple Choice
Assume that four jobs,A-D,are in the READY queue at Time 0 and require the CPU cycles listed below.Using the SJN algorithm,the ____ job is run first. Job: A B C D
CPU cycle: 5 2 6 4
A) A
B) B
C) C
D) D
Correct Answer:
Verified
Correct Answer:
Verified
Related Questions
Q2: Some systems use a strategy known as
Q3: A(n)_ is created by a process,and it
Q4: The first-come,first-served (FCFS)algorithm is fine for most
Q5: No movement between queues is a very
Q6: The transition from _ can be initiated
Q8: A job's state moves from HOLD to
Q9: If one job monopolizes the system,the extent
Q10: _ requires that the processor be allocated
Q11: _ is a dynamic-priority preemptive scheduling algorithm
Q12: Each thread in a process is represented