What is Waiting time?

Related MCQs

• There are 10 different processes running on a workstation. Idle processes are waiting for an input event in the input queue. Busy processes are scheduled with the Round- Robin time sharing method. Which out of the following quantum times is the best value for small response times, if the processes have a short runtime, e.g. less than 10ms?
• Which of the following scheduling algorithms gives minimum average waiting time?
• Bounded waiting implies that there exists a bound on the number of times a process is allowed to enter its critical section
• If the number of cycles spent busy – waiting is not excessive, then                          
• The interval from the time of submission of a process to the time of completion is termed as                          
• If the memory access time is denoted by ‘ma’ and ‘p’ is the probability of a page fault (0 <= p <= 1). Then the effective access time for a demand paged memory is
• In a time-sharing operating system, when the time slot given to a process is completed, the process goes from the running state to the:
• If the displayed system time and dateis wrong, you can reset it using
• Which of the following is an example of a real time operating system?
• Which of the following does not support more than one program at a time?