Home / CSE MCQs / OS MCQs :: CPU Scheduling - Operating System

CSE MCQs :: OS MCQs

  1. Scheduling is done so as to :
  2. A.
    increase the turnaround time
    B.
    decrease the turnaround time
    C.
    keep the turnaround time same
    D.
    there is no relation between scheduling and turnaround time

  3. Waiting time is :
  4. A.
    the total time in the blocked and waiting queues
    B.
    the total time spent in the ready queue
    C.
    the total time spent in the running queue
    D.
    the total time from the completion till the submission of a process

  5. Scheduling is done so as to :
  6. A.
    increase the waiting time
    B.
    keep the waiting time the same
    C.
    decrease the waiting time
    D.
    None of these

  7. Response time is :
  8. A.
    the total time taken from the submission time till the completion time
    B.
    the total time taken from the submission time till the first response is produced
    C.
    the total time taken from submission time till the response is output
    D.
    None of these

  9. Scheduling is done so as to :
  10. A.
    increase the response time
    B.
    keep the response time the same
    C.
    decrease the response time
    D.
    None of these

  11. Round robin scheduling falls under the category of :
  12. A.
    Non preemptive scheduling
    B.
    Preemptive scheduling
    C.
    None of these

  13. With round robin scheduling algorithm in a time shared system,
  14. A.
    using very large time slices converts it into First come First served scheduling algorithm
    B.
    using very small time slices converts it into First come First served scheduling algorithm
    C.
    using extremely small time slices increases performance
    D.
    using very small time slices converts it into Shortest Job First algorithm

  15. The portion of the process scheduler in an operating system that dispatches processes is concerned with :
  16. A.
    assigning ready processes to CPU
    B.
    assigning ready processes to waiting queue
    C.
    assigning running processes to blocked queue
    D.
    All of these

  17. Complex scheduling algorithms :
  18. A.
    are very appropriate for very large computers
    B.
    use minimal resources
    C.
    use many resources
    D.
    All of these

  19. The FIFO algorithm :
  20. A.
    first executes the job that came in last in the queue
    B.
    first executes the job that came in first in the queue
    C.
    first executes the job that needs minimal processor
    D.
    first executes the job that has maximum processor needs