OS quiz 3

Round Robin Scheduling is most suitable for

• Batch OS

• Hard RTOS

• Soft RTOS

• Time Sharing OS

The number of process that are completed by a System per time unit is called

• Process output

• Turnaround time

• Throughput

• Response time

In priority scheduling algorithm, when a process arrives at the ready queue ,its priority is compared with the priority of

• all process in ready queue

• currently running process

• parent process

• process in new state

Which one of the following can not be scheduled by the kernel

• kernel level thread

• user level thread

• process

• none of the mentioned

When several processes access the same data concurrently and the outcome of the execution depends on the particular order in which the access takes place is called

• essential condition

• dynamic condition

• race condition

• critical condition

Process synchronization can be done on __________

• hardware level only

• software level only

• both hardware and software level

• none of the mentioned

A semaphore is a shared integer variable that can not

• be more than zero

• drop below zero

• that cannot be more than one

• None of these

Which of the following scheduling algorithm is used frequently in long-term scheduling

• SJF

• FCFS

• Priority scheduling

• Round Robin scheduling

Which of the following process can be affected by other processes during execution in the system?

• Child process

• parent process

• init process

• cooperating process

If there are 32 segments, each of size 1 K byte, then the logical address should have

• 32

• 15

• 10

• 16