Scribd Logo
Upload

Welcome to Scribd!

  • Quiz 2 in MITF 201: Amalicdem@dmmmsu - Edu.ph

    Uploaded by

    Likhamor Quezon
    14 views1 page
    This document contains instructions for a quiz asking students to simulate process scheduling algorithms including FCFS, SJN, NPP, PP, SRTF, and RR for a set of processes. Students are to create a ready queue, Gantt chart, and compute average turnaround time, waiting time, CPU efficiency and throughput for each algorithm using the given processes and submit their work by email by the specified due date and time.

    Original Description:

    Advance Operating System Quiz

    Original Title

    Quiz-2-in-MITF-201

    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
    This document contains instructions for a quiz asking students to simulate process scheduling algorithms including FCFS, SJN, NPP, PP, SRTF, and RR for a set of processes. Students are to create a ready queue, Gantt chart, and compute average turnaround time, waiting time, CPU efficiency and throughput for each algorithm using the given processes and submit their work by email by the specified due date and time.

    Copyright:

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

    Quiz 2 in MITF 201: Amalicdem@dmmmsu - Edu.ph

    Uploaded by

    Likhamor Quezon
    This document contains instructions for a quiz asking students to simulate process scheduling algorithms including FCFS, SJN, NPP, PP, SRTF, and RR for a set of processes. Students are to create a ready queue, Gantt chart, and compute average turnaround time, waiting time, CPU efficiency and throughput for each algorithm using the given processes and submit their work by email by the specified due date and time.

    Copyright:

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

    Quiz 2 in MITF 201

    Instruction: Using this data set, simulate the process execution by creating the
    Ready Queue and Gantt Chart and computing the Average Turnaround Time and
    Average Waiting for each Non-preemptive and pre-emptive algorithm (FCFS,
    SJN, NPP, PP, SRTF, RR QT = 4) of the following. Likewise, compute for the
    CPU Efficiency and Throughput.

    Note: Please use clean yellow paper or coupon bond (front pages only) and
    scan or take a clear picture for submission in my email
    amalicdem@dmmmsu.edu.ph until 9:08am October 10, 2020 only.

    Process Arrival Time Burst Time Priority


    (H=1;L=3)
    P1 0 7 3
    P2 4 5 3

    P3 5 3 1

    P4 16 6 2
    P5 18 2 3
    P6 21 6 1
    P7 24 4 2

    You might also like