Recent questions tagged process-scheduling

How many states can a process be in ?$3$$4$$2$ $5$

A relationship between processes such that each has some part (critical section) which must not be executed while the critical section of another is being executed, is kn...

A scheduling Algorithm assigns priority proportional to the waiting time of a process. Every process starts with priority zero (lowest priority). The scheduler reevaluate...

Which of the following statements is not true for Multi Level Feedback Queue processor scheduling algorithm?Queues have different prioritiesEach queue may have different ...

Consider a system running ten I/O-bound tasks and one CPU-bound task. Assume that the I/O-bound tasks issue an I/O operation once for every millisecond of CPU computing a...

A CPU-scheduling algorithm determines an order for the execution of its scheduled processes. Given n processes to be scheduled on one processor, how many different schedu...

Match the following $:$$\begin{array}{} & \textbf{List – I} && \textbf{List – II} \\ & \textbf{Process state} && \textbf{Reason for transition}\\ & \textbf{transition} ...

Consider a uniprocessor system where new processes arrive at an average of five processes per minute and each process needs an average of $6$ seconds of service time. Wha...

The problem of indefinite blockage of low-priority jobs in general priority scheduling algorithm can be solved using:Parity bitAgingCompactionTimer

For the real time operating system, which of the following is the most suitable scheduling scheme?Round robinFirst come first servePre-emptiveRandom scheduling

Pre-emptive scheduling is the strategy of temporarily suspending a running processbefore the CPU time slice expiresto allow starving processes to runwhen it requires I/Ot...

Which of the following is not an optimization criterion in the design of a CPU scheduling algorithm?Minimum CPU utilizationMaximum throughputMinimum turnaround timeMinimu...

Match the following $:$$\begin{array}{clcl} & \textbf{List – I} && \textbf{List – II} \\ \text{a}. & \text{Multilevel feedback queue} & \text{i.} & \text{Time-slicing} \...

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 processst...

The following table shows the processes in the ready queue and time required for each process for completing its job.ProcessTime$P_1$10$P_2$5$P_3$20$P_4$8$P_5$15If round-...

Consider a set of 5 processes whose arrival time, CPU time needed and the priority are given below:Process PriorityArrival Time (in ms)CPU Time NeededPriorityP10105P2052P...

The correct matching of the following pairs is$\begin{array}{|l|l|l|l|} \hline \text{A.} & \text{Disk check} & \text{i.} & \text{Round robin} \\\hline \text{B.}& \text{B...

The performance of Round Robin algorithm depends heavily onsize of the processthe I/O bursts of the processthe CPU bursts of the processthe size of the time quantum

With Round-Robin CPU scheduling in a time shared systemusing very large time slices (quantas) degenerates into First-Come First served (FCFS) algorithm.using extremely sm...

Feedback queuesare very simple to implementdispatch tasks according to execution characteristicsare used to favour real time tasksrequire manual intervention to implement...

On a system using non-preemptive scheduling, processes with expected run times of 5, 18, 9 and 12 are in the ready queue. In what order should they be run to minimize wai...

Round Robin schedule is essentially the pre-emptive version ofFIFOShortest job firstShortest remaining timeLongest remaining time

Consider a job scheduling problem with 4 jobs $J_1, J_2, J_3$ and $J_4$ with corresponding deadlines: $(d_1, d_2, d_3, d_4) = (4, 2, 4, 2)$. Which of the following is not...