Classtest-3

Operating Systems

Roll- Time: 20 mins. Marks: 20

1. Which of the following is not in connection with preemptive scheduling when a process
switches from:
a) running to waiting state (b) running to ready state (c) waiting to ready state
2. Which of the following scheduler selects one of the processes in the ready queue to be
executed whenever the CPU becomes idle a) long-term scheduler b) mid-term scheduler c)
short-term scheduler.
3. Which of the following is not in connection with dispatcher a) switching context b)
switching to user mode c) scheduling
4. The main disadvantage of basic semaphore definition is
a) blocking b) busy waiting c) spinlock
5. Name three requirements for a solution to the critical section problem

a) -------------- (b) ----------------- (c) ------------------

6. Maintaining data ----------- requires synchronization of cooperating processes.
a) consistency (b) inconsistency (c) recovery.
7. In Multilevel-queue scheduling foreground processes use.
a) RR scheduling (b) FCFS scheduling (c) SJFS scheduling.
8. The amount of time a process takes from when a request was submitted until the first result is
produced.
a) waiting time (b) response time (c) turnaround time.
9. A process that is blocked, waiting on a semaphore S, should be restarted when some other
process executes a :
a) signal() operation (b) wait() operation (c) wakeup() operation.
10. ________________ is the time it takes for the dispatcher to stop one process and start another
running.
11. A major problem with SJF scheduling is starvation a) True b) false
12. Which of the following scheduling algorithms allows a process to move between queues a)
multilevel queue scheduling b) multilevel feedback queue scheduling c) priority scheduling
13 Write two variations of Reader-Writer problem a) b)
14. Name three process synchronization tools.

a) ----------------- (b) -------------------- (c) ----------------------.

15. Name four section of a typical process:

a) -------------- (b) ------------------ (c) ------------------- (d) --------------------

16. Concurrent access to shared data may result in data.
a) consistency (b) inconsistency (c) recovery.
17. In multilevel feedback scheduling each queen has its own scheduling algorithm.
a) True (b) False.
18. Aging is used in:
a) SJFS scheduling (b) round robin scheduling (c) priority scheduling.
19. The amount of time to execute a particular process is called.
a) Waiting time (b) response time (c) turnaround time.
20. ………… conditions are prevented by requiring that critical regions be protected by locks.
a) progress (b) waiting (c) race.