Consider the below plots representing the order in which the requests are serviced by different disk scheduling algorithms.
Match the above plots with the corresponding disk scheduling algorithm.
(1) - C-SCAN, (2) - FCFS, (3) - SCAN, (4) - C-LOOK
(1) - C-LOOK, (2) - FCFS, (3) - SCAN, (4) - C-SCAN
(1) - SCAN, (2) - C-SCAN, (3) - C-LOOK, (4) - FCFS
(1) - C-LOOK, (2) - C-SCAN, (3) - FCFS, (4) - SCAN
Consider the following program. Assume execlp succeeds.
Which output order is guaranteed?
parent done appears before hello
hello appears before parent done
Only parent done appears
The order is non-deterministic
Consider the following resource-allocation situation.
• Process P1 holds resource R1 and waits for R2. • Process P2 holds resource R2 and waits for R3. • Process P3 holds resource R3 and waits for R1. • None of the processes releases its currently held resource until it acquires the requested one.
Which deadlock condition is most directly exhibited by the waiting pattern above?
Mutual exclusion
Preemption
Circular wait
Time sharing
Sign in with Google — it is free — to see every question with its answer and explanation, practise it in learning mode, or take it as a timed mock test.
The IIT Madras BS Operating Systems (Operating Systems) End Term paper sat on 10 May 2026, in the January 2026 term, set 1: 20 questions for 50 marks in 180 minutes. The first 3 questions are below. Sign in with Google — it is free — to see the whole paper with its answers and explanations, in learning mode or as a timed mock test.
| Feature | Operating Systems End Term 10 May 2026 Set 1 at a glance |
|---|---|
| Term | January 2026 term |
| Subject | Operating Systems |
| Course code | BSCS4022 |
| Questions | 20 |
| Marks | 50 |
| Duration | 180 min |
| MCQ | 12 |
| MSQ | 3 |
| Numerical | 5 |
| Official paper | OS 10 May 26 |
| Negative marking | No negative marking. |
| Updated |
