Bissoy.com
Doctors Medicines MCQs Q&A

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? Correct Answer Shortest remaining time first

As all the processes are arriving at the using shortest remaining time first algorithm, we can decrease the number of processes in the queue as soon as possible thus total waiting time will decrease and so will average.

Related Questions

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?
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 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?  
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)
Consider the following statements about process state transitions for a system using preemptive scheduling. I. A running process can move to ready state. II. A ready process can move to running state. III. A blocked process can move to running state. IV. A blocked process can move to ready state. Which of the above statements are TRUE?
In a company there are 252 engineers, in which the ratio of the number of electronics engineers and computer engineers is 2 ∶ 1. The ratio of the number of electronics engineers and computer engineers becomes 1 ∶ 1 after recruitment of some more computer engineers. The average age of all the engineers is now 22 years and the average age of the computer engineers is 2 years less than the average age of electronics engineers. (A) The average age (in years) of electronics engineers is 21 (B) The average age (in years) of computer engineers is 21 (C) The average age (in years) of electronics engineers is 23 (D) The average age (in years) of electronics engineers is 25 (E) The average age (in years) of computer engineers is 23 Choose the correct answer from the options given below: 
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  
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 ?