PyQdeck LogoPyQdeckSubjectsSyllabusBlog
Back to the 2022 paper

Module 2: Processes & Scheduling

20222m

Which scheduling policy is most suitable for a time shared operating system:

(i) Shortest job first
(ii) Round Robin
(iii) FCFS
(iv) Elevator

Search GoogleAsk AI
Worked SolutionAI Assisted

Answer: (ii) Round Robin

Time-shared (multiprogrammed, interactive) OS needs to give each ready process a short CPU burst in turn so users get prompt response.

  • Round Robin (RR) — preemptive, each process gets a fixed time quantum (e.g., 10-100ms); ideal for time-sharing due to fairness and low response time.
  • SJF / FCFS — non-preemptive, can cause starvation / convoy effect, not suitable for interactive response.
  • Elevator (SCAN) — disk scheduling, not CPU scheduling.

Similar questions

Operating SystemWhich disk scheduling algorithm services requests in the order they arrive? (i) SCAN (ii) SSTF (iii) FCFS (iv) C-SCAN20252mOperating SystemWhich scheduler selects processes from the ready queue and allocates the CPU? (i) Long-term scheduler (ii) Medium-term scheduler (iii) Short-term scheduler (iv) Batch scheduler20252mOPERATING SYSTEMFive batch jobs, A through E, arrive at a computer center at essentially the same time. They have an estimated running time of 15, 9, 3, 6 and 12 minutes, respectively. Their (externally defined) priorities are 6, 3, 7, 9 and 4, respectively, with a lower value corresponding to a higher priority. For each of the following scheduling algorithms, determine the waiting time for each process and the average waiting for all jobs. Ignore process switching overhead. Explain how you arrived at your answers. In the last three cases, assume that only one job at a time runs until it finishes and that all jobs are completely processor bound: (a) Priority scheduling (b) FCFS (run in order 15, 9, 3, 6 and 12) (c) Shortest job first202214mOPERATING SYSTEMWhich of the following is also called job scheduler? (i) DMA controller (ii) Short-term scheduler (iii) CPU scheduler (iv) Long-term scheduler20242m
NextA process executes the following segment of code: ``c for (i = 1; i <= n; i++) fork(); `` The number of new processes created is: (i) n (ii) (n(n+1))/2 (iii) 2^n - 1 (iv) 2^n
Official AppAndroid App

PYQDeck for Android

Solve BEU previous-year exam papers anywhere, anytime. Fast search, offline paper viewing, and step-by-step solutions designed specifically for your phone.

Get on Google Play