GATE | GATE 2017 MOCK II | Question 53
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 46
- GATE | GATE MOCK 2017 | Question 43
- GATE | GATE MOCK 2017 | Question 42
- GATE | GATE 2017 MOCK II | Question 14
- GATE | GATE 2017 MOCK II | Question 15
- GATE | GATE 2017 MOCK II | Question 16
- GATE | GATE MOCK 2017 | Question 41
- GATE | GATE 2017 MOCK II | Question 13
- GATE | GATE MOCK 2017 | Question 45
- GATE | GATE MOCK 2017 | Question 44
- GATE | GATE 2017 MOCK II | Question 11
- GATE | GATE 2017 MOCK II | Question 12
- GATE | GATE MOCK 2017 | Question 40
- GATE | GATE 2017 MOCK II | Question 26
- GATE | GATE 2017 MOCK II | Question 27
- Must Do Coding Questions for Companies like Amazon, Microsoft, Adobe, ...
- Find the integers that doesnot ends with T1 or T2 when squared and added X
- Program to Encrypt a String using ! and @
- Compare two strings considering only alphanumeric characters
- Maximum non-attacking Knights that can be placed on an N*M Chessboard