Register

UGC NET CSE | June 2016 | Part 2 | Question: 40

• recategorized by
2,158 views
6 votes
6 votes

A scheduling Algorithm assigns priority proportional to the waiting time of a process. Every process starts with priority zero (lowest priority). The scheduler reevaluates the process priority for every 'T' time units and declares next process to be scheduled. If teh process have no I/O operations and all arrive at time zero, then the schduler implements ___ criteria

  1. Priority scheduling
  2. Rond Robin Scheduling
  3. Shortest Job First
  4. FCFS
• recategorized by
User Avatar

2 Answers

Best answer
3 votes
3 votes
The scheduling algorithm works as Round Robin algorithm with quantum time equals to t. After a process's turn comes and it has executed for t units, its waiting time becomes least and its turn comes again after every other process has got the chance for t units.

B is answer
• selected by
User Avatar
2 votes
2 votes
As per question 10 cpu-bound processes arrives @ same time at time 0 so waiting time is same for all processes so same priority also as per question.

So here Round Robin with Time Quantum="T"
User Avatar
Voting & Accepting an answer helps improve the community
Answer:
← PreviousNext →
← Previous in categoryNext in category →

Related questions

5 votes
5 votes
2 answers
1
go_editor asked Aug 16, 2016
19,950 views
UGC NET CSE | June 2016 | Part 2 | Question: 38
If the Disk head is located initially at track 32, find the number of disk moves required with FCFS scheduling criteria if the disk queue of I/O blocks requests are 98, 37, 14, 124, 65, 67 320 322 321 319
If the Disk head is located initially at track 32, find the number of disk moves required with FCFS scheduling criteria if the disk queue of I/O blocks requests are 98, 3...
User Avatar
3 votes
3 votes
2 answers
2
go_editor asked Aug 16, 2016
4,124 views
UGC NET CSE | June 2016 | Part 2 | Question: 37
Suppose there are $4$ processes in execution with $12$ instances of a Resource $R$ ... allocation, is system safe? If so, what is the safe sequence? No Yes, $P_1P_2P_3P_4$ Yes, $P_4P_3P_1P_2$ Yes, $P_2P_1P_3P_4$
Suppose there are $4$ processes in execution with $12$ instances of a Resource $R$ in a system.The maximum need of each process and current allocation are given below :$\...
User Avatar
3 votes
3 votes
1 answer
3
go_editor asked Aug 16, 2016
8,082 views
UGC NET CSE | June 2016 | Part 2 | Question: 36
Consider the reference string: 0 1 2 3 0 1 4 0 1 2 3 4 If FIFO page replacement algorithm is used, then the number of page faults with three page frames and four page frames are ____ and ___ respectively. 10, 9 9, 9 10, 10 9, 10
Consider the reference string:0 1 2 3 0 1 4 0 1 2 3 4If FIFO page replacement algorithm is used, then the number of page faults with three page frames and four page frame...
User Avatar
Link Copied!