recategorized by
2,336 views

1 Answer

Best answer
3 votes
3 votes

In  Round robbbin , a queue is maintained which stores the input as it comes in FIFO order

Its different from FIFO because of pre emption  

When does premption occur

a time quantum is allocated( a specific time say 10 sec for a process, then even if the process is not completed, the next process in queue enters for execution and the remainingg of this executed process is also added in the queue

so the process enters in FIFO with premption

ANSWER = FIFO

selected by

Related questions

0 votes
0 votes
2 answers
1
1 votes
1 votes
1 answer
2
rishu_darkshadow asked Sep 17, 2017
4,594 views
A program is located in the smallest available hole in the memory is _________(A) best – fit(B) first – bit(C) worst – fit(D) buddy
1 votes
1 votes
1 answer
3
rishu_darkshadow asked Sep 17, 2017
1,042 views
A semaphore count of negative n means (s = – n) that the queue contains ________ waiting processes.(A) n + 1(B) n(C) n – 1(D) 0
0 votes
0 votes
1 answer
4
rishu_darkshadow asked Sep 17, 2017
542 views
A page fault(A) is an error specific page.(B) is an access to the page not currently in memory.(C) occur when a page program occur in a page memory.(D) page used in the p...