Consider all the processes are arriving at large time intervals. Let t be the time interval between two processes Pi and Pi+1 for any i and service time of Pi is Si. If t > Si for every i then, what should be the strategy to schedule the processes ?
(A) FCFS
(B) Shortest Job First
(C) Round Robin
(D) Shortest Remaining Time First
Answer: (A)
Explanation:
If t>Si then all the processes are serviced in FCFS based because when the next process arrives the previous process is already completed.
Quiz of this Question
Recommended Posts:
- GATE | GATE MOCK 2017 | Question 1
- GATE | GATE MOCK 2017 | Question 2
- GATE | GATE MOCK 2017 | Question 3
- GATE | GATE MOCK 2017 | Question 4
- GATE | GATE MOCK 2017 | Question 5
- GATE | GATE MOCK 2017 | Question 6
- GATE | GATE MOCK 2017 | Question 7
- GATE | GATE MOCK 2017 | Question 8
- GATE | GATE MOCK 2017 | Question 9
- GATE | GATE MOCK 2017 | Question 10
- GATE | GATE MOCK 2017 | Question 11
- GATE | GATE MOCK 2017 | Question 12
- GATE | GATE MOCK 2017 | Question 13
- GATE | GATE MOCK 2017 | Question 14
- GATE | GATE MOCK 2017 | Question 15
- GATE | GATE MOCK 2017 | Question 16
- GATE | GATE MOCK 2017 | Question 17
- GATE | GATE MOCK 2017 | Question 18
- GATE | GATE MOCK 2017 | Question 19
- GATE | GATE MOCK 2017 | Question 20
