Related Questions

In priority scheduling algorithm, when a process arrives at the ready queue, its priority is compared with the priority of ____________
If a higher priority process arrives and wants service, the memory manager can swap out the lower priority process to execute the higher priority process. When the higher priority process finishes, the lower priority process is swapped back in and continues execution. This variant of swapping is sometimes called?
What happens if we apply the below operations on an input sequence? i. construct a cartesian tree for input sequence ii. put the root element of above tree in a priority queue iii. if( priority queue is not empty) then iv. search and delete minimum value in priority queue v. add that to output vi. add cartesian tree children of above node to priority queue
With either equal or proportional algorithm, a high priority process is treated ___________ a low priority process.
Which scheduling algorithm is an optimal scheduling policy for mono-processor system?
An SJF algorithm is simply a priority algorithm where the priority is ____________
How does a host on an Ethernet LAN know when to transmit after a collision has occurred?
1. In a CSMA/CD collision domain, multiple stations can successfully transmit data simultaneously.
2. In a CSMA/CD collision domain, stations must wait until the media is not in use before transmitting.
3. You can improve the CSMA/CD network by adding more hubs.
4. After a collision, the station that detected the collision has first priority to resend the lost data.
5. After a collision, all stations run a random backoff algorithm. When the backoff delay period has expired, all stations have equal priority to transmit data.
Choose one of the disadvantages of the priority scheduling algorithm?
In priority scheduling algorithm ____________
The ____________ scheduling algorithm schedules periodic tasks using a static priority policy with preemption.