Q 11[GATE 2023 – MSQ]
Which algorithms can cause starvation?
(a) FIFO (b) RR (c) Priority (d) SJF
Ans: (c) Priority and (d) SJF
Reason: FIFO and RR are starvation free. Priority me low priority wala kabhi execute nahi ho sakta agar high priority wale aate rahe. SJF bhi ek tarah ka priority hai isliye usme bhi starvation hota hai.
Q 12 [GATE 2022]
Four processes P,Q,R,S with TQ=4. Conditions: S->Q once, R->Q once, Q->R twice, no S->P.
Ans: (D) P=3, Q=7, R=7, S=3 NOT Possible.
Q13. [GATE 2025] Which is TRUE for Priority Scheduling?
(a) Can cause deadlock (b) Is always non-preemptive (c) Lower priority can starve (d) No relation with SJF
Ans: (c) Lower priority can starve, SJF is special case of Priority.
Q14. [GATE 2025] Two processors M1 priority P1>P3>P2>P4, M2 priority P2>P3>P4>P1. Burst P1=20,P2=16,P3=25,P4=10. Avg waiting?
Ans: 9ms. M1->P1(0-20), M2->P2(0-16), M2->P3(16-41), M1->P4(20-30). Waiting 0,0,16,20 = 36/4=9.
Q15. [GATE 2020] P1=8, P2=7, P3=2, P4=4, TQ=4. Difference between SJF and RR avg TAT?
Ans: 5.25ms
SJF avg = 10.5, RR avg = 15.75
Q16. [GATE 2020] P1=8, P2=7, P3=2, P4=4, TQ=4. Difference between SJF and RR avg TAT?
Ans: 5.25ms
SJF avg = 10.5, RR avg = 15.75
Q17. [GATE 2022] P,Q,R,S RR TQ=4. Conditions S->Q 1, R->Q 1, Q->R 2, No S->P. Which NOT possible? P=4,Q=10,R=6,S=2 etc
Ans: (D) P=3, Q=7, R=7, S=3 NOT possible.
Q18. [GATE 2023 MSQ] Which scheduling can cause Starvation?
(a) FIFO (b) RR (c) Priority (d) SJFAnswer: (c) Priority and (d) SJF
Q19. [GATE 2021] Which statements are TRUE?
(a) Scheduling maximizes utilization & minimizes throughput (b) TAT = Waiting+Execution (c) RR doesn’t need burst time (d) Preemptive needs hardware supportAnswer: (b), (c), (d) are TRUE
Solution: (a) is false because throughput maximize karna hota hai minimize nahi.
20. [GATE 2020] Burst Times 16, 20, 10. Find minimum Average Waiting Time in Non-Preemptive?Answer: 12 ms
Solution: Shortest Job First gives min waiting. Order 10->16->20. WT1=0, WT2=10, WT3=26. Avg = 36/3 = 12ms.
Lorem ipsum dolor sit amet, consectetur adipiscing elit. Ut elit tellus, luctus nec ullamcorper mattis, pulvinar dapibus leo.