Explore topic-wise InterviewSolutions in .

This section includes InterviewSolutions, each offering curated multiple-choice questions to sharpen your knowledge and support exam preparation. Choose a topic below to get started.

1.

The most optimal scheduling algorithm is :(A) First come first serve (FCFS)(B) Shortest Job First (SJF)(C) Round Robin (RR)(D) None of the above

Answer»
Discussion
2.

Which of the following is FALSE about SJF (Shortest Job First Scheduling)?S1: It causes minimum average waiting timeS2: It can cause starvation(A) Only S1(B) Only S2(C) Both S1 and S2(D) Neither S1 nor S2

Answer»
Discussion
3.

Consider three processes (process id 0, 1, 2 respectively) with compute time bursts 2, 4 and 8 time units. All processes arrive at time zero. Consider the longest remaining time first (LRTF) scheduling algorithm. In LRTF ties are broken by giving priority to the process with the lowest process id. The average turn around time is:(A) 13 units(B) 14 units(C) 15 units(D) 16 units

Answer» None
Discussion
4.

If the quantum time of round robin algorithm is very large, then it is equivalent to:(A) First in first out(B) Shortest Job Next(C) Lottery scheduling(D) None of the above

Answer»
Discussion
5.

Consider three CPU-intensive processes, which require 10, 20 and 30 time units and arrive at times 0, 2 and 6, respectively. How many context switches are needed if the operating system implements a shortest remaining time first scheduling algorithm? Do not count the context switches at time zero and at the end.(A) 1(B) 2(C) 3(D) 4

Answer»
Discussion