Fig.3 D 10

2. For the following questions, choose the correct statement and put the number into Table 1 on page 2 A. I) Fig. I means process R requests for resource A 2) Fig. 1 means process A requests for resource R. 3) Fig. 1 means resource R requests for process A. 4) Fig. I means process A is holding resource R. B. 1)Fig. 2 means process B is holding resource S 2) Fig. 2 means process S is holding resource B. 3) Fig. 2 means process B is waiting for resource S. 4) Fig. 2 means resource B is holding process S. Fig.1 Fig.2 40 8 C. Fig. 3 shows that there are four jobs in the queue. 50 20 Job A arrived first, and D last. The run times for the four jobs A, B, C, and D are 50, 20, 40, 10 seconds, respectively. When using first-come ront first-served scheduling algorithm, the average Fig. 3 turnaround time is 1)40 2)45 3) 75 4) 87 D. For the question in Fig.3, when using shortest job first scheduling algorithm, the average turnaround time ) 34.4 2) 44.1 3) 55.5 4) 64.8 For the question in Fig. 3, the round robin scheduling algorithm is used. Suppose the quantum is one second, no other jobs arrive, and the scheduler starts from the situation in Fig.3. After two seconds has passed, the job order in the queue is I)BCDA Consider a system with two users. User 1 has four processes, A, B, C, D, and user 2 has two processes,E and F. Each user has been promised 50% of CPU time. Supposed the round-robin scheduling is used. CPU time that each process of user 1 will use is 1) 12.5% For the question F (see above), the possible scheduling sequence is DABECDFABECDF. E. 2) CBDA 3) CDAB 4) DABC F. 2) 25% 3) 37.5% 4) 50% G. 2) ABCDEFABCDEF 4)AEBFCEDFAEBFCED 3JAEFBEFCEFDEF A system has five processes A, B, C, D, and E, three resources U, V, and W. Process A holds resource W and requests for resource U, Process B holds resource U and requests for resource V, Process C holds nothing and request for V. Process D holds nothing and requests for W, Process E holds resource V and H. requests for resource W.In this situation, 1) The system is not deadlocked