Operating Systems Quiz

Operating Systems Quiz 

1. The systems which allows only one process execution at a time, are called

a) uniprogramming systems

b) uniprocessing systems

c) unitasking systems

d) none of the mentioned

2.  What is the ready state of a process?

a) when process is scheduled to run after some execution

b) when process is unable to run until some task has been completed

c) when process is using the CPU

d) none of the mentioned

3. A set of processes is deadlock if

a) each process is blocked and will remain so forever

b) each process is terminated

c) all processes are trying to kill each other

d) none of the mentioned

4. The address of the next instruction to be executed by the current process is

provided by the

a) CPU registers

b) Program counter

c) Process stack

d) Pipe

5. The processes that are residing in main memory and are ready and waiting to

execute are kept on a list called

a) job queue

b) ready queue

c) execution queue

d) process queue

6.  In priority scheduling algorithm

a) CPU is allocated to the process with highest priority

b) CPU is allocated to the process with lowest priority

c) Equal priority processes cannot be scheduled

d) none of the mentioned

7. The interval from the time of submission of a process to the time of completion

is termed as

a) waiting time

b) turnaround time

c) response time

d) throughput

8.  Response time is :

a) the total time taken from the submission time till the completion time

b) the total time taken from the submission time till the first response is produced

c) the total time taken from submission time till the response is output

d) none of the mentioned

9. A process is selected from the ______ queue by the ________ scheduler, to be

executed.

a) blocked, short term

b) wait, long term

c) ready, short term

d) ready, long term

10. In the following cases non – preemptive scheduling occurs :

a) When a process switches from the running state to the ready state

b) When a process goes from the running state to the waiting state

c) When a process switches from the waiting state to the ready state

d) All of the mentioned

11. There are 10 different processes running on a workstation. Idle processes are

waiting for an input event in the input queue. Busy processes are scheduled with

the Round-Robin timesharing method. Which out of the following quantum times

is the best value for small response times, if the processes have a short runtime,

e.g. less than 10ms?

a) tQ = 15ms

b) tQ = 40ms

c) tQ = 45ms

d) tQ = 50ms

12.  Which of the following algorithms tends to minimize the process flow time?

a) First come First served

b) Shortest Job First

c) Earliest Deadline First

d) Longest Job First

13. The most optimal scheduling algorithm is:

a) FCFS – First come First served

b) SJF – Shortest Job First

c) RR – Round Robin

d) None of the mentioned

14. Consider the following set of processes, the length of the CPU burst time given

in milliseconds :

Process Burst time

P1 6

P2 8

P3 7

P4 3

Assuming the above process is scheduled with the SJF scheduling algorithm:

a) the waiting time for process P1 is 3ms

b) The waiting time for process P1 is 0ms

c) The waiting time for process P1 is 16ms

d) The waiting time for process P1 is 9ms

15. One of the disadvantages of the priority scheduling algorithm is that :

a) it schedules in a very complex manner

b) its scheduling takes up a lot of time

c) it can lead to some low priority process waiting indefinitely for the CPU

d) none of the mentioned

Answer: 

1) a

2) b

3) a

4) b

5) b

6) a

7) b

8) b

9) c

10) b

11) a

12) b

13) b

14) a

15) c

#OperatingSystemQuiz