A process residing in main memory and ready and waiting for execution, is kept on
Ready Queue
In an operating system, a process goes through various states during its lifetime. These states typically include New, Ready, Running, Waiting (or Blocked), and Terminated. The question asks about a process that is "residing in main memory and ready and waiting for execution". Let's break down what this means and where such a process is held.
A process is an instance of a program in execution. It requires resources like CPU time, memory, files, and I/O devices to complete its task.
When a program is loaded into memory to become a process, it enters the Ready state. From the Ready state, it can transition to the Running state when the operating system's scheduler selects it for execution on the CPU. If a Running process needs to wait for an event (like I/O completion), it moves to the Waiting state. Once the event occurs, it moves back to the Ready state. When a process finishes execution, it moves to the Terminated state.
Operating systems use various queues to manage processes based on their current state.
| Queue Type | Processes Held | State of Processes | Location of Processes |
|---|---|---|---|
| Job Queue | All processes in the system | Various (typically before admission) | Usually secondary storage (disk) |
| Ready Queue | Processes ready for CPU execution | Ready | Main memory |
| Wait Queue (Device Queue) | Processes waiting for an event/device | Waiting (Blocked) | Main memory |
The question specifies a process that is "residing in main memory and ready and waiting for execution". Let's look at the options:
Therefore, a process residing in main memory and ready and waiting for execution is kept on the Ready Queue.
| Term | Description |
|---|---|
| Process | An executing instance of a program. |
| Main Memory | The primary storage area where programs and data are held for active use. |
| Ready State | A state where a process is in main memory, ready to run, and waiting for the CPU. |
| Ready Queue | A queue holding processes in the Ready state. |
| Waiting State | A state where a process is waiting for an event (e.g., I/O). |
| Wait Queue | A queue holding processes in the Waiting state. |
The operating system component responsible for selecting which process from the ready queue should be executed next is called the scheduler. The dispatcher is the module that gives control of the CPU to the process selected by the scheduler. This involves context switching, which is saving the state of the old process and loading the saved state of the new process. The management of processes through these queues and states is a fundamental part of operating system process management and scheduling.
Consider the following four processes with the arrival time and length of CPU burst given in milliseconds :
| Process | Arrival Time | Burst Time |
| P 1 | 0 | 8 |
| P 2 | 1 | 4 |
| P 3 | 2 | 9 |
| P 4 | 3 | 5 |
The average waiting time for preemptive SJF scheduling algorithm is
Consider the following set of processes and the length of CPU burst time given in milliseconds:
Process | CPU Burst time (ms) |
P 1 | 5 |
P 2 | 7 |
P 3 | 6 |
P 4 | 4 |
Assume that processes being scheduled with Round-Robin Scheduling Algorithm with Time Quantum 4ms. Then the waiting time for P 4is _________ ms.
Consider three intensive processes, which requires 10,20 and 30 units of time and arrive at times 0,2 and 6 respectively. how many context switches are needed if the operating system implements a shortest remaining time first scheduling algorithm? Do not count the context switches at time zero and at the end.
Which of the following CPU scheduling algorithms is/are supported by LINUX operating system?
Given CPU time slice of 2 ms and the following list of processes.
Process | Burst time (ms) | Arrival time (ms) |
p 1 | 3 | 0 |
p 2 | 4 | 2 |
p 3 | 5 | 5 |
Find average turnaround time and average waiting time using round-robin CPU scheduling?