Operating systems

1.

Which of the following is not a condition for a deadlock?

a. Starvation
b. Mutual Exclusion
c. Hold-And-Wait
d. No pre-emption

2.

Which of the following scheduler(s) puts the process in the ready queue?

a. Long term scheduler

b. Medium term scheduler
c. Both a and b
d. None of the above

3.

If there are n fork() statements written one after the other, how many total number of
child process will be created?

a. 2n-1
b. 2n -1
c. 2n + 1
d. 2n
4.

Process Arrival time Time Units Required

P1 0 7
P2 2 5
P3 5 6

For the above processes, using the Round-Robin algorithm with a quantum size of 3,
which of the following is a correct order of execution?

a. P2, P1, P3
b. P1, P2, P3
c. P3, P1, P2
d. P2, P3, P1

5.

How to make round robin scheduler work like a first come first serve scheduler?

a. Set the time quantum to 1.

b. Set the time quantum to infinity.
c. Set the priority with each process.
d. Round robin cannot be converted to first come first serve scheduler.