GATE CS 2018 - Operating System Daily Quiz- 2 (CPU Scheduling)

Attempt now to get your rank among 714 students!

Question 1

Consider the following processes, with the arrival time and the length of the CPU burst given in milliseconds. The scheduling algorithm used is preemptive shortest remaining time first.

The average turnaround time of these processes is _____ milliseconds.

• A3.45
• B5.34
• C8.25
• D9.34

Question 2

Consider an arbitrary set of CPU-bound processes with unequal CPU burst lengths submitted at the same time to a computer system. Which one of the following process scheduling algorithms would minimize the average waiting time in the ready queue?

• AShortest remaining time first
• BRound-robin with time quantum less than the shortest CPU burst
• CUniform random
• DHighest priority first with priority proportional to CPU burst length

Question 3

Consider the set of processes with arrival time (in milliseconds). CPU burst time (in milliseconds), and priority (0 is the highest priority) shown below. None of the processes have I/O burst time.

The average waiting time (in milliseconds) of all the processes using preemptive priority scheduling algorithm is ____.

• A15
• B19
• C25
• D29

Question 4

Which of the following statements are true?
I. Shortest remaining time first scheduling may cause starvation
II. Preemptive scheduling may cause starvation
III. Round robin is better than FCFS in terms of response time

• AI only
• BI and III only
• CII and III only
• DI, II and III

Question 5

A scheduling algorithm assigns priority proportional to the waiting time of a process. Every process starts with priority zero (the lowest priority). The scheduler re-evaluates the process priorities every T time units and decides the next process to schedule. Which one of the following is TRUE if the processes have no I/O operations and all arrive at time zero?

• AThis algorithm is equivalent to the first-come-first-serve algorithm.
• BThis algorithm is equivalent to the round-robin algorithm.
• CThis algorithm is equivalent to the shortest-job-first algorithm.
• DThis algorithm is equivalent to the shortest-remaining-time-first algorithm.

• 714 attempts
• 2 upvotes
• 14 comments