Sail E0 Webinar

MCQs

Total Questions : 36 | Page 2 of 4 pages
Question 11. Round robin scheduling falls under the category of :
  1.    Non preemptive scheduling
  2.    Preemptive scheduling
  3.    None of these
 Discuss Question
Answer: Option B. -> Preemptive scheduling


None.


Question 12. The FIFO algorithm :
  1.    first executes the job that came in last in the queue
  2.    first executes the job that came in first in the queue
  3.    first executes the job that needs minimal processor
  4.    first executes the job that has maximum processor needs
 Discuss Question
Answer: Option B. -> first executes the job that came in first in the queue


None.


Question 13. Complex scheduling algorithms :
  1.    are very appropriate for very large computers
  2.    use minimal resources
  3.    use many resources
  4.    All of these
 Discuss Question
Answer: Option A. -> are very appropriate for very large computers


Large computers are overloaded with greater number of processes.


Question 14. With round robin scheduling algorithm in a time shared system,
  1.    using very large time slices converts it into First come First served scheduling algorithm
  2.    using very small time slices converts it into First come First served scheduling algorithm
  3.    using extremely small time slices increases performance
  4.    using very small time slices converts it into Shortest Job First algorithm
 Discuss Question
Answer: Option A. -> using very large time slices converts it into First come First served scheduling algorithm


All the processes will be able to get completed.


Question 15. The portion of the process scheduler in an operating system that dispatches processes is concerned with :
  1.    assigning ready processes to CPU
  2.    assigning ready processes to waiting queue
  3.    assigning running processes to blocked queue
  4.    All of these
 Discuss Question
Answer: Option A. -> assigning ready processes to CPU


None.


Question 16. Under multiprogramming, turnaround time for short jobs is usually ________ and that for long jobs is slightly ___________.
  1.    Lengthened; Shortened
  2.    Shortened; Lengthened
  3.    Shortened; Shortened
  4.    hortened; Unchanged
 Discuss Question
Answer: Option B. -> Shortened; Lengthened


None.


Question 17. Which module gives control of the CPU to the process selected by the short-term scheduler?
  1.    dispatcher
  2.    interrupt
  3.    scheduler
  4.    none of the mentioned
 Discuss Question
Answer: Option A. -> dispatcher


None.


Question 18. The interval from the time of submission of a process to the time of completion is termed as:
  1.    waiting time
  2.    turnaround time
  3.    response time
  4.    throughput
 Discuss Question
Answer: Option B. -> turnaround time


None.


Question 19. In priority scheduling algorithm:
  1.    CPU is allocated to the process with highest priority
  2.    CPU is allocated to the process with lowest priority
  3.    equal priority processes can not be scheduled
  4.    none of the mentioned
 Discuss Question
Answer: Option A. -> CPU is allocated to the process with highest priority


None.


Question 20. The processes that are residing in main memory and are ready and waiting to execute are kept on a list called:
  1.    job queue
  2.    ready queue
  3.    execution queue
  4.    process queue
 Discuss Question
Answer: Option B. -> ready queue


None.


Latest Videos

Latest Test Papers