OSG202-TL3

Question #6 (1 point) Five batch jobs A through E, arrive at a computer center at almost the same time. They have estimated running times of 8, 6, 2, 10, and 4 minutes. Determine the average turnaround time for SJF (Shortest job first) scheduling. Ignore process switching overhead. A.14 minutes B.8 minutes C.6 minutes D.18.8 minutes

B

Question #21 (1 point) Some systems increase the priority of jobs that have been in the system for an unusually long time to expedite their exit, which is known as ____.? a,Lagging b,Bumping c,Aging d,Accelerated priority

C

Question #29 (1 point) Which one cannot be able to solve the race condition? a, TSL b, Shared memory c, Semaphore d, Monitor

C

Question #35 (1 point) Assume that four jobs A-D require the CPU cycles listed below. Using the Shortest Job First algorithm, the ____ job is run first. Arrival time: 4 1 0 2 Job: A B C D CPU cycle: 5 2 6 4 A B C D

C

Question #8 (1 point) Which of the following is a preemptive scheduling algorithm A.FCFS B.Shortest Job First C.Round Robin D.None of the other choices

C

Question #12 (1 point) .What is Software proposal in the solution of Mutual exclusion with Busy waiting? A.Message passing B.Monitors C.Peterson's Solution D.All of the other choices

D

Question #13 (1 point) Which of the following is appropriate to release page table and pages? A.Process creation B.Process execution C.Page fault time D.Process termination time

D

Question #2 (1 point) Five batch jobs A through E, arrive at a computer center at almost the same time. They have estimated running times of 8, 6, 2, 10, and 4 minutes. . Determine the average waiting time for FCFS scheduling. Ignore process switching overhead. A.17 minutes B.18 minutes C.18.8 minutes D.12,8 minutes

D

Question #22 (1 point) Which of the following is true about Atomic action on semaphores? a,Checking the value b,Changing the value c,Possibly going to sleep d,All of the other choices

D

Question #4 (1 point) Which of the following statements about semaphores is true? A.P and V (Down and Up) operations should be indivisible operations B.If several processes attempt a P(S) operation simultaneously, only one process should be allowed to proceed. C.A semaphore implementation should guarantee that processes do not suffer indefinite postponement. D.All of the other choices

D

Question #5(1 point). _____ is the act of allowing only one process to have access to a dedicated resource A.No preemption B.Circular wait C.Resource holding D.Mutual exclusion

D

Question #19 (1 point) Which of the following conditions of semaphore variable "s" implies a busy critical region? a, s > 0 b, s < 0 c, s = 0 d, None of the other choices

c

Question #26 (1 point) Which of the following statements is true about hardware solution to the critical region problem? a, Disable Interrupts b, Monitors c, Semaphore d, None of the other choices

a

Question #32 (1 point) A entry of the Process table is called: a,Process management block b,Process control block c,Process check block d,All of the other choices

B

Question #25 (1 point) What is the purpose of CPU scheduling algorithms? a, Pick one of the ready processes to run next b, Put to sleep and wake up processes in an efficient manner c, Allocate memory to the processes in a fair and efficient way d, None of the other choices

A

Question #34 (1 point) Semaphores that are initialized to 1 and used for two or more processes to ensure only one can enter its critical section at the same time are called: a, Binary semaphores b, Integer semaphores c, Counter semaphores d, None of the other choices

A

Question #27 (1 point) What happens when a thread calls Down (S) when it wants to enter its critical section, where S is a binary semaphore set to 1? a, The thread is allowed to enter its critical section and S is decremented. b, The thread is blocked and added to a queue of waiting threads. c, The semaphore is set to 2. d, None of the other choices

A

Question #3 (1 point) Which is not a goal of a scheduling algorithm for all systems? A.Response time B.Policy enforcement C.Balance D.Fairness

A

Question #11 (1 point) In order to implement mutual exclusion on a critical resource for competing processes, only one program at a time should be allowed: A.In the critical region of the program B.To perform message passing C.To exhibit cooperation D.None of the other choices

A

Question #1 (1 point) Which of the following is correct about Shortest Job First scheduling algorithm? A. Avoid Starvation B.Minimize average waiting time C.Avoid Starvation and Minimize average waiting time D.None of the other choices

B

Question #1 5(1 point) Which of the following is not a CPU scheduling criterion? A.CPU utilization B.Burst time C.Throughput D.Response time

B

Question #16 (1 point) Five batch jobs A through E, arrive at a computer center at almost the same time. They have estimated running times of 8, 6, 2, 10, and 4 minutes. Determine the average waiting time for SJF (Shortest job first) scheduling. Ignore process switching overhead. A.14 minutes B.8 minutes C.6 minutes D.18.8 minutes

B

Question #17 (1 point) Which of the following synchronization mechanisms does not rely on busy-waiting? A.Lock variables B.Strict alternation C.Peterson's algorithm D.Semaphores

B

Question #20 (1 point) The first-come, first-served (FCFS) algorithm is fine for most ____ systems a,Interactive b,Batch c,Real time d,Multiuser

B

Question #30 (1 point) How many level of scheduling are used in computer a,1 b,2 c,3 d,4

B

Question #18 (1 point) What is the purpose of process synchronization? Let different users run different processes independently Avoid race condition Avoid deadlock None of the other choices

b

Question #28 (1 point) Which of the following environments preemption is essential? Batch Interactive Real time None of the other choices

d