The portion of the process scheduler in an operating system that dispatches processes is concerned with ____________, a) assigning ready processes to CPU, b) assigning ready processes to waiting queue, c) assigning running processes to blocked queue, d) all of the mentioned, The strategy of making processes that are logically runnable to be temporarily suspended is called ____________, a) Non preemptive scheduling, b) Preemptive scheduling, c) Shortest job first, d) First come First served, Orders are processed in the sequence they arrive if _______ rule sequences the jobs., a) earliest due date, b) slack time remaining, c) first come, first served, d) critical ratio, Which of the following algorithms tends to minimize the process flow time?, a) First come First served, b) Shortest Job First, c) Earliest Deadline First, d) Longest Job First, Which of the following statements are true? (GATE 2010) I. Shortest remaining time first scheduling may cause starvation III. Round robin is better than FCFS in terms of response time II. Preemptive scheduling may cause starvation III. Round robin is better than FCFS in terms of response time, a) I only, b) II only, c) I and II , d) None of the above, Round robin scheduling falls under the category of ____________, a) Non-preemptive scheduling, b) Preemptive scheduling, c) All of the mentioned, d) None of the mentioned, An SJF algorithm is simply a priority algorithm where the priority is ____________, a) the predicted next CPU burst, b) the inverse of the predicted next CPU burst, c) the current CPU burst, d) anything the user wants, What is ‘Aging’?, a) keeping track of cache contents, b) keeping track of what pages are currently residing in memory, c) keeping track of how many times a given page is referenced, d) increasing the priority of jobs to ensure termination in a finite time, Which of the following scheduling algorithms gives minimum average waiting time?, a) FCFS, b) SJF, c) Round – robin, d) Priority, The interval from the time of submission of a process to the time of completion is termed as ____________, a) waiting time, b) turnaround time, c) response time, d) throughput.
0%
CPU Scheduling Algorithms
Jaa
Jaa
Jaa
tekijä
Arunam
Muokkaa sisältöä
Tulosta
Upota
Lisää
Tehtäviä
Tulostaulu
Näytä enemmän
Näytä vähemmän
Tämä tulostaulu on tällä hetkellä yksityinen. Jos haluat tehdä siitä julkisen, valitse
Jaa
.
Tehtävän omistaja on poistanut tämän tulostaulun käytöstä.
Tämä tulostaulu on poistettu käytöstä, koska vaihtoehdot eroavat tehtävän omistajan vaihtoehtoista.
Palauta Optiot
Monivalinta
on avoin malli. Se ei luo tulostaululle pisteitä.
SIsäänkirjautuminen vaaditaan
Visuaalinen tyyli
Fontit
Tilaus vaaditaan
Vaihtoehdot
Vaihda mallia
Näytä kaikki
Saat lisää muotoiluasetuksia pelin aikana.
)
Avoimet tulokset
Kopioi linkki
QR-koodi
Poista
Säilytetäänkö automaattisesti tallennettu tehtävä
?