Scribd Logo
Upload

Welcome to Scribd!

  • 16 views

    Process Control Management

    Uploaded by

    saciidcabdulaahi063

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd

    Process Control Management

    Uploaded by

    saciidcabdulaahi063
    16 views1 page

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Download as docx, pdf, or txt
    16 views1 page

    Process Control Management

    Uploaded by

    saciidcabdulaahi063

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Download as docx, pdf, or txt
    You are on page 1of 1

    Section A

    1. A process may be defined as :


    a) A set of instructions to be executed by a computer
    b) A program in execution
    c) A piece of hardware that executes a set of instructions
    d) The main procedure of a program

    2. A starvation-free job scheduling policy guarantees that no job waits indefinitely for service.
    Which of the following job-scheduling policies is starvation-free
    a) Round-robin
    b) Priority queuing
    c) Shortest job first
    d) Youngest job first
    e) None of the above

    Section B

    1. Differentiate between preemptive and non-preemptive scheduling.

    2. Consider a workload with 5 jobs that each compute for an identical amount of time, x, and that
    perform no I/O. To minimize the average waiting time of the jobs, should a FCFS scheduler or
    a RR scheduler be used?
    3. Consider the following set of processes that arrive at time 0 with the length of CPU-burst time
    given in milliseconds (ms).

    Process Burst Time (ms)

    P1 6

    P2 8

    P3 7

    P4 3

    i. Draw Gant charts to illustrate the execution of these processes using the following
    algorithm and find out the average waiting time for each of them.
    a. First-Come-First-Served(FCFS),
    b. Shortest-Job-First(SJF)

    ii. What is the average waiting time if the processes arrive in the order P2,P3,P1,P4 using
    the FCFS?

    You might also like