Time Left - 15:00 mins

GATE 2023 Operating System Quiz 32

Attempt now to get your rank among 45 students!

Question 1

Consider the set of 3 processes whose arrival time and burst time are given below:

If the CPU scheduling policy is FCFS, calculate the idle time of the CPU.

Question 2

What is the role of short term scheduler?

Question 3

Which of the following scheduler may starve a process?

Question 4

Assume time quantum of RR scheduler is greater than longest CPU burst time of all processes.
Which of the following is correct?

Question 5

Consider the following set of processes that need to be scheduled on a single CPU. All the times are given in milliseconds.

Process Name

Arrival Time

Execution Time

A

0

6

B

3

2

C

5

4

D

7

6

E

10

3


Using the shortest remaining time first scheduling algorithm, the average process turnaround time (in m sec) is ________.

Question 6

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 unit 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?
  • 45 attempts
  • 0 upvotes
  • 0 comments
Sep 27GATE & PSU CS