Bissoy.com
Doctors Medicines MCQs Q&A

Suppose a system contains n processes and system uses the round-robin algorithm for CPU scheduling then which data structure is best suited ready queue of the processes  

Suppose a system contains n processes and system uses the round-robin algorithm for CPU scheduling then which data structure is best suited ready queue of the processes   Correct Answer circular queue

The correct answer is "option 3".

CONCEPT:

The circular queue is best known for the Round Robin CPU scheduling algorithm.

A circular Queue is a linear data structure based on the FIFO principle and the last position of the queue is connected back to the first position.

In Round Robin scheduling, when the timer goes off the process then swapped out & goes to the end of the ready queue.

Hence, the correct answer is "option 3".

Circular Queue

Additional Information

1. Queue is a linear data structure used to store data on the basis of the FIFO (First In First Out) principle.

2. Stack is a linear data structure based on the LIFO (Last In First Out) principle.

3. A tree is a non-linear data structure that store data in hierarchical form.

4. LIFO means the data entered last in the data structure will be removed first. 

5. FIFO means the data entered first in the data structure will be removed first. 

Related Questions

A double-ended queue supports operations like adding and removing items from both the sides of the queue. They support four operations like addFront(adding item to top of the queue), addRear(adding item to the bottom of the queue), removeFront(removing item from the top of the queue) and removeRear(removing item from the bottom of the queue). You are given only stacks to implement this data structure. You can implement only push and pop operations. What’s the time complexity of performing addFront and addRear? (Assume ‘m’ to be the size of the stack and ‘n’ to be the number of elements)
A Double-ended queue supports operations such as adding and removing items from both the sides of the queue. They support four operations like addFront(adding item to top of the queue), addRear(adding item to the bottom of the queue), removeFront(removing item from the top of the queue) and removeRear(removing item from the bottom of the queue). You are given only stacks to implement this data structure. You can implement only push and pop operations. What are the total number of stacks required for this operation?(you can reuse the stack)
One of the Scheduling method is also known as Shortest-­next­-CPU­-burst algorithm, because scheduling through this method depends on the length of the next CPU burst of a process rather than its total length. Which of the following scheduling method is being discussed here?
Consider an arbitrary set of CPU-bound processes with unequal CPU burst lengths submitted at the same time to a computer system. Which one of the following process scheduling algorithms would minimize the average waiting time in the ready queue?
Consider an arbitrary set of CPU – bound processes with unequal CPU burst lengths submitted at the same time to a computer system. Which one of the following process scheduling algorithms would minimize the average waiting time in the ready queue?
Consider four processes P, Q, R, and S scheduled on a CPU as per round-robin algorithm with a time quantum of 4 units. The processes arrive in the order P, Q, R, S, all at time t = 0. There is exactly one context switch from S to Q, exactly one context switch from R to Q, and exactly two context switches from Q to R. There is no context switch from S to P. Switching to a ready process after the termination of another process is also considered a context switch. Which one of the following is NOT possible as CPU burst time (in time units) of these processes?  
The admission ticket for an Art Gallery bears a password which is changed after every clock hour based on set of words Chosen for each day. The following is an illustration of the code and steps of rearrangement for subsequent clock hours. The Time is 9 a.m. to 3 p.m. Day’s first password: First Batch – 9 a.m. to 10 a.m. is not ready cloth simple harmony burning Second Batch – 10 a.m. to 11 a.m. ready not is cloth burning harmony simple Third Batch – 11 a.m. to 12 noon cloth is not ready simple harmony burning Fourth Batch – 12 noon to 1 p.m. not is cloth ready burning harmony simple Fifth Batch – 1 p.m. to 2 p.m. ready cloth is not simple harmony burning and so on. If the password for 11 a.m. to 12 noon was –“soap shy miss pen yet the she”, what was the password for the First Batch?
The admission ticket for an exhibition bears a password which is changed after every clock hour based on set of words chosen for each day. The following is an illustration of the code and steps of rearrangement for subsequent clock hours. The time is 9 a.m. to 3 p.m. Day's first password : First Batch ----- 9 a.m. to 10 a.m. is not ready cloth simple harmony burning Second Batch ----- 10 a.m. to 11 a.m. ready not is cloth burning harmony simple Third Batch ----- 11 a.m. to 12 noon cloth is not ready simple harmony burning Fourth Batch ----- 12 noon to 1 p.m. not is cloth ready burning harmony simple Fifth Batch ----- 1 p.m. to 2 p.m. ready cloth is not simple harmony burning and so on. If the password for 11 a.m. to 12 noon was --- "soap shy miss pen yet the she", what was the password for the first batch ?
You install and run a third-party 32-bit application named Application on your Windows 2000 Server computer. After several days, the application stops responding. You open Task Manager and find that the CPU usage is at 100 percent. The normal range of CPU usage on the server is from 20 percent to 30 percent You end the application. However, you see that the CPU on the server is still at 100 percent. Task Manager shows no other applications running. You then examine the Processes page in Task Manager and confirm that the Application.exe process is no longer running. You want to return the CPU usage to its normal range. What should you do?
What happens if we apply the below operations on an input sequence? i. construct a cartesian tree for input sequence ii. put the root element of above tree in a priority queue iii. if( priority queue is not empty) then iv. search and delete minimum value in priority queue v. add that to output vi. add cartesian tree children of above node to priority queue