Scribd Logo
Upload

Welcome to Scribd!

  • 12 views

    LAB No.11: Lab Tasks Task No.01: Assuming That All Processes Arrive in The Ready Queue at The Same

    Uploaded by

    dure
    This lab document outlines 3 CPU scheduling algorithms - First Come First Serve (FCFS), Shortest Job First (SJF), and Round Robin - to simulate and calculate the average turnaround time and waiting time of processes in a ready queue. It provides details on how to read the number of processes and their burst times, then simulate FCFS by serving processes in the order they arrive, SJF by serving the shortest job first, and Round Robin by allowing each process a time slice to run before preempting.

    Copyright:

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

    You might also like

    LAB No.11: Lab Tasks Task No.01: Assuming That All Processes Arrive in The Ready Queue at The Same

    Uploaded by

    dure
    12 views4 pages
    This lab document outlines 3 CPU scheduling algorithms - First Come First Serve (FCFS), Shortest Job First (SJF), and Round Robin - to simulate and calculate the average turnaround time and waiting time of processes in a ready queue. It provides details on how to read the number of processes and their burst times, then simulate FCFS by serving processes in the order they arrive, SJF by serving the shortest job first, and Round Robin by allowing each process a time slice to run before preempting.

    Original Description:

    Original Title

    LAB-NO-11.docx

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This lab document outlines 3 CPU scheduling algorithms - First Come First Serve (FCFS), Shortest Job First (SJF), and Round Robin - to simulate and calculate the average turnaround time and waiting time of processes in a ready queue. It provides details on how to read the number of processes and their burst times, then simulate FCFS by serving processes in the order they arrive, SJF by serving the shortest job first, and Round Robin by allowing each process a time slice to run before preempting.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as docx, pdf, or txt
    12 views4 pages

    LAB No.11: Lab Tasks Task No.01: Assuming That All Processes Arrive in The Ready Queue at The Same

    Uploaded by

    dure
    This lab document outlines 3 CPU scheduling algorithms - First Come First Serve (FCFS), Shortest Job First (SJF), and Round Robin - to simulate and calculate the average turnaround time and waiting time of processes in a ready queue. It provides details on how to read the number of processes and their burst times, then simulate FCFS by serving processes in the order they arrive, SJF by serving the shortest job first, and Round Robin by allowing each process a time slice to run before preempting.

    Copyright:

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

    LAB No.

    11
    Lab tasks

    Task no.01: Assuming that all processes arrive in the ready queue at the same
    time that is arrival time for all processes is 0. Read the number of
    processes/jobs in the ready queue and their respective burst/service times and
    then simulate the following CPU scheduling algorithms to find the average
    turnaround time and average waiting time.

    a. FCFS
    b. SJF
    c. Round Robin

    FIRST COME FIRST SERVE (FCFS)

    F16SW32
    ROUND ROBIN

    F16SW32
    F16SW32
    SHORTEST JOB FIRST (SJF)

    F16SW32

    You might also like