Answers.com > Wiki Answers > Categories > Technology > Computers > Computer Programming > What kind of data structure is required to implement the round-robin scheduling?

Other contributors have said "Round Robin Algorithm?" is the same question as "What kind of data structure is required to implement the round-robin scheduling?" If you believe that these are not asking the same thing and should be answered differently, click here

What kind of data structure is required to implement the round-robin scheduling?

In: Computer Programming [Edit categories]

Answer:

cicular queue :D
if you want to implement the round robin you need the data structure of circular queue so that when we give the time quantum for the processes then if that process is complete in that time period then its ok but if not then we have to put that process in the queue so that all other processes are also get the time to execute i.e. to remove starvation

Contributor:

Kunal21

First answer by ID2057608612. Last edit by Kunal21. Contributor trust: 0 [recommend contributor ]. Question popularity: 3 [recommend question].

[report abuse]

Can you answer these Computer Programming questions?

	What is the purpose of using SystemConfiguration?	Answer it!
	What is the role of the MTA in handling email?	Answer it!
	What the program written in assembly language is called the source program?	Answer it!
	What is the need of memory management?	Answer it!
	How do Viruses reach your computer?	Answer it!

Relevant answers:

What kind of data type is a structure?
A structure is not a data type. A structure is more of a collection if data types that can be referenced conveniently. Mainly we humans can keep on top of it, the computer does not care. struct foo {...
Advantages of Round Robin Scheduling?
It is the most simple scheduling algorithmn It is easy to implement in software If the processes are of varied length then it becomes slow.
What is round-robin scheduling?
The term round-robin often refers to something being done to many elements belonging to a group, one element at a time. It is the idea of the task being carried out "one element at a time" that is...
What is the program for round robin scheduling in c?
include<iostream.h> include<conio.h> include<dos.h> void main() { clrscr(); int bt[10],n,i,slot,totaltime=0; cout<<"enter the number of...
What is selfish round robin CPU scheduling?
A variant of round robin scheduling is called selfish round robin scheduling. In selfish round robin, there is a maximum limit on the number of processes that can be placed in the round-robin queue...