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

CSE MCQs :: OS MCQs

  1. The strategy of making processes that are logically runnable to be temporarily suspended is called :
  2. A.
    Non preemptive scheduling
    B.
    Preemptive scheduling
    C.
    Shortest job first
    D.
    First come First served

    View Answer

    Workspace

    Discuss Discuss in Forum


  3. Scheduling is :
  4. A.
    allowing a job to use the processor
    B.
    making proper use of processor
    C.
    Both a and b
    D.
    None of these

    View Answer

    Workspace

    Discuss Discuss in Forum


  5. There are 10 different processes running on a workstation. Idle processes are waiting for an input event in the input queue. Busy processes are scheduled with the Round-Robin time sharing method. Which out of the following quantum times is the best value for small response times, if the processes have a short run-time, e.g. less than 10ms ?
  6. A.
    tQ = 15ms
    B.
    tQ = 40ms
    C.
    tQ = 45ms
    D.
    tQ = 50ms

    View Answer

    Workspace

    Discuss Discuss in Forum


  7. Orders are processed in the sequence they arrive if _______ rule sequences the jobs.
  8. A.
    earliest due date
    B.
    slack time remaining
    C.
    first come, first served
    D.
    critical ratio

    View Answer

    Workspace

    Discuss Discuss in Forum


  9. Which of the following algorithms tends to minimize the process flow time ?
  10. A.
    First come First served
    B.
    Shortest Job First
    C.
    Earliest Deadline First
    D.
    Longest Job First

    View Answer

    Workspace

    Discuss Discuss in Forum


  11. Under multiprogramming, turnaround time for short jobs is usually ________ and that for long jobs is slightly ___________.
  12. A.
    Lengthened; Shortened
    B.
    Shortened; Lengthened
    C.
    Shortened; Shortened
    D.
    hortened; Unchanged

    View Answer

    Workspace

    Discuss Discuss in Forum