Recent questions tagged process-scheduling

In real-time operating systems, which of the following is the most suitable scheduling scheme?round-robinfirst-come-first-servedpreemptiverandom scheduling

Which of the following scheduling algorithms could result in starvation?PriorityRound RobinFCFSNone of the above

Process is in a ready state _______ .when process is scheduled to run after some executionwhen process is unable to run until some task has been completedwhen process is ...

Starvation can be avoided by which of the following statements:By using shortest job first resource allocation policy .By using first come first serve resources allocatio...

The degree of multi programming is controlled by:CPU SchedulerLong-term SchedulerContext SwitchingMedium term Scheduler

Consider three processes (process id $0,1,2$ respectively) with compute time bursts $2,4$ and $8$ time units. All processes arrive at time zero. Consider the Longest Rema...

Consider three processes, all arriving at time zero, with total execution time of $10,20$ and $30$ units, respectively. Each process spends the first $20\%$ of execution ...

Consider three CPU-intensive processes, which require $10,20$ and $30$ time units and arrive at times $0,2$ and $6$, respectively. How many context switches are needed if...

Which of the following process scheduling algorithm may lead to starvation?FIFORound RobinShortest Job NextNone of the option

A scheduling algorithm assigns priority proportional to the waiting time of a process. Every process starts with priority zero (the lowest priority). The scheduler re-eva...

Consider the following four processes with their corresponding arrival time and burst time:$$\begin{array}\\ \text{Process}&\text{Arrival time}&\text{Burst time(in ms)}\\...

____________ is one of pre-emptive scheduling algorithm.Shortest-Job-firstRound-robinPriority basedShortest-Job-next

A software to create a Job Queue is called ____________ .Linkage editorInterpreterDriverSpooler

In processor management, round robin method essentially uses the preemptive version of_____.$\text{FILO}$$\text{FIFO}$$\text{SJF}$Longest time first

Which is the correct definition of a valid process transition in an operating system ?Wake up : Ready $\rightarrow$ RunningDispatch: Ready $\rightarrow$ RunningBlock : Re...

Some of the criteria for calculation of priority of a process are:Processor utilization by an individual process.Weight assigned to a user or group of usersProcessor util...

Jobs keep arriving at a processor. A job can have an associated time length as well as a priority tag. New jobs may arrive while some earlier jobs are running. Some jobs ...

Three CPU-bound tasks, with execution times of $15,12$ and $5$ time units respectively arrive at times $0,t$ and $8$, respectively. If the operating system implements a s...

Which of the following algorithms defines time quantum?shortest job scheduling algorithmround robin scheduling algorithmpriority scheduling algorithmmultilevel queue sche...

A real-time system needs to handle two voice calls that each run every $6$ msec and consume $1$ msec of CPU time per burst, plus one video at $25$ frames/sec, with each f...

A soft real-time system has four periodic events with periods of $50, 100, 200,$ and $250$ msec each. Suppose that the four events require $35, 20, 10,$ and $x$ msec of C...

The aging algorithm with $a = 1/2$ is being used to predict run times. The previous four runs, from oldest to most recent, are $40, 20, 40,$ and $15$ msec. What is the pr...

Consider a real-time system with two voice calls of periodicity $5$ msec each with CPU time per call of $1$ msec, and one video stream of periodicity $33$ ms with CPU tim...

A process running on $CTSS$ needs $30$ quanta to complete. How many times must it be swapped in, including the very first time (before it has run at all)?