MODULE -2

1. Describe different state of a process.

2. Explain AT, BT, CT, WT, TAT.
3. Different between process and thread.
4. Define context switching.
5. Explain the important of Process Control Block.
6. Justify that round robin algorithm is more efficient then other
algorithm.
7. FCFS & SJF scheduling math.
8. Compare kernel level threads and user level threads.
9. Different between Pre-emptive and non pre-emptive.

1. Scheduling algorithm that priodies allocating the CPU to the

process that make the initial CPU request –
a. FCFS b. SJF c. Priority d. none of the above
2. Pre-emptive shortest fast job first scheduling is ocationally
indicate –
a. SJF b. Earlyest dead time first
c. High response ratio d. Shortest remaining time next
3. Scheduling algorithm which gives minimum average waiting
time-
a. Round robin b. SJF c. priority d. FCFS
4. Which one represent CPU scheduling algorithm in operating
system-
a. Priority b. RR
c. SJF d. All of the above
5. Which are of priority scheduling algorithm –
a. CPU is allocating to the process with highest priority
b. CPU is allocating to the process with lowest priority
c. Equal priority process can’t rescheduling
d. None of the above
6. Algorithm where time quantum is mentioned-
a. Round Robin
b. SJF
c. FCFS
d.Priority

7. Scheduling is implemented in ordered to –

a. If the CPU more ideal b. Increase CPU utilization
c. Decrease CPU utilization d. None of the above

8. Which of the following cases involve non-pre emptive scheduling

–
a. When a process switches from running state to the ready state
b. When a process switches from waiting state to the ready state
c. when a process switches from running state to the waiting state
d. All of the above
9.If the kernel operator with a single thread indicate the current
option for the behaviour of any user level thread executing a
blogging system point-
a. Causes the entire process to run along with the other thread
b. Causes the thread to block with the other threads running
c. Causes the entire process to block even if other thread are
available to run
d. None of the above

10. Which module gives control of the CPU to the process selected
by the short term scheduler –
a. Dispatch b. Interrupt c. Scheduler d. None of the above
11. Identify which algorithm are classify into different group –
a. SJF b. RR c. Priority
d. Multilevel group scheduling
12.Scheduling is applied for –
a. Increase CPU utilization
b. Decrease CPU utilization
c. Keep the CPU more ideal
d. None

13.SJF algorithm is simply priority algorithm where the priority is

good with-
a. The predicted next CPU burst
b. The invert of the predicted next CPU burst
c. The current CPU burst
d. Anything the user one