MCQs based on Operating system

Rajnish Tripathi 13:57

Operating system MCQs:-

What does the term "process" refer to in computing? A) A program that is being executed B) A set of instructions waiting to be executed C) A collection of files on a computer D) An input device used for computing

Answer: A

What is the purpose of process scheduling? A) To ensure that every process is executed at the same time B) To keep the CPU as busy as possible C) To prevent processes from executing on the same CPU D) To allocate memory to each process

Answer: B

Which scheduling algorithm schedules processes according to their arrival times? A) Shortest Job First B) Round Robin Scheduling C) Priority Based Scheduling D) First Come First Serve

Answer: D

Which scheduling algorithm gives priority to processes with the shortest burst time? A) Shortest Job First B) Round Robin Scheduling C) Priority Based Scheduling D) First Come First Serve

Answer: A

What is the formula for calculating the response ratio in the Highest Response Ratio Next (HRRN) scheduling algorithm? A) Waiting Time / Burst Time B) Burst Time / Waiting Time C) (Waiting Time + Burst Time) / Burst Time D) (Burst Time - Waiting Time) / Waiting Time

Answer: C

What is the main disadvantage of the First Come First Serve (FCFS) scheduling algorithm? A) It can cause long waiting times B) It is too complex to implement C) It does not allocate CPU time fairly D) It can cause starvation

Answer: A

What is the main advantage of the Shortest Job First (SJF) scheduling algorithm? A) It is optimal in terms of average waiting time B) It is simple to implement C) It ensures fair allocation of CPU time D) It avoids starvation

Answer: A

Which scheduling algorithm allows processes to move in between queues? A) Multilevel Queue Scheduling B) Shortest Remaining Time First C) Multi level Feedback Queue Scheduling D) Highest Response Ratio Next

Answer: C

What happens when the time quantum for Round Robin scheduling is very large? A) It behaves the same as the FCFS scheduling algorithm B) It behaves the same as the SJF scheduling algorithm C) It behaves the same as the Priority Based scheduling algorithm D) It behaves the same as the Shortest Remaining Time First algorithm

Answer: A

What is the formula for calculating waiting time in process scheduling? A) Turn Around Time - Burst Time B) Burst Time - Turn Around Time C) Turn Around Time + Burst Time D) Turn Around Time / Burst Time

Answer: A

Pre 👈 👉 Next

Similar posts:-