Scribd Logo
Upload

Welcome to Scribd!

  • MiddleExam 01

    Uploaded by

    Nguyen Duc Tai
    9 views1 page
    The document describes a scheduling simulation with 6 processes (J1-J6) that have different arrival times and CPU burst times. It asks the reader to calculate the waiting times and average waiting time for each scheduling algorithm based on the last 2 digits of their student ID: 1) FCFS and Round Robin with a time quantum of 3 2) SJF and Round Robin with a time quantum of 4 3) Priority (non-preemptive) and Round Robin with a time quantum of 5

    Original Description:

    Original Title

    MiddleExam-01

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document describes a scheduling simulation with 6 processes (J1-J6) that have different arrival times and CPU burst times. It asks the reader to calculate the waiting times and average waiting time for each scheduling algorithm based on the last 2 digits of their student ID: 1) FCFS and Round Robin with a time quantum of 3 2) SJF and Round Robin with a time quantum of 4 3) Priority (non-preemptive) and Round Robin with a time quantum of 5

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pdf or txt
    9 views1 page

    MiddleExam 01

    Uploaded by

    Nguyen Duc Tai
    The document describes a scheduling simulation with 6 processes (J1-J6) that have different arrival times and CPU burst times. It asks the reader to calculate the waiting times and average waiting time for each scheduling algorithm based on the last 2 digits of their student ID: 1) FCFS and Round Robin with a time quantum of 3 2) SJF and Round Robin with a time quantum of 4 3) Priority (non-preemptive) and Round Robin with a time quantum of 5

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pdf or txt
    of 1

    June 7, 2020 - HCMC UT

    Middle Exam
    Operating System - Exercise

    Assume that you have following processes, with all information as needed for CPU
    Scheduler. For every scheduling algorithms, determine the waiting times for each process and the
    average waiting times.
    Job Arrival Time CPU Burst Priority

    J1 0 5 2
    J2 3 6 2
    J3 4 8 1
    J4 10 7 3
    J5 12 3 1
    J6 15 4 3

    Please solve one (1) and only one of these following questions:
    1. FCFS and Round Robin with q = 3.
    2. SJF and Roung Robin with q = 4.
    3. Priority (Non-preemptive) and Round Robin with q = 5.

    IMPORTANT
    Here is how you choose the question: Using last 2 digits of your Student ID
    modular (mod - chia lấy phần dư) 3, and then + 1. The result is the question the
    you have to solve.
    Example: your last 2 digits is 23
    —> 23 mod 3 = 2, then 2 + 1 = 3 —> hence, you HAVE TO choose question 3.

    OPERATING SYSTEM MIDDLE EXAM 1

    You might also like