Scribd Logo
Upload

Welcome to Scribd!

  • Operating Systems Lab - CPU Scheduling

    Uploaded by

    Souradeep Gupta
    13 views1 page
    This document contains 4 questions asking to write C programs that simulate different CPU scheduling algorithms: FCFS, SJF, priority scheduling with a time quantum of 4 ms for 3 processes A, B, C, and priority-based scheduling. The programs are to calculate turnaround time and waiting time for the different scheduling approaches.

    Original Description:

    Original Title

    Untitled

    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 4 questions asking to write C programs that simulate different CPU scheduling algorithms: FCFS, SJF, priority scheduling with a time quantum of 4 ms for 3 processes A, B, C, and priority-based scheduling. The programs are to calculate turnaround time and waiting time for the different scheduling approaches.

    Copyright:

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

    Operating Systems Lab - CPU Scheduling

    Uploaded by

    Souradeep Gupta
    This document contains 4 questions asking to write C programs that simulate different CPU scheduling algorithms: FCFS, SJF, priority scheduling with a time quantum of 4 ms for 3 processes A, B, C, and priority-based scheduling. The programs are to calculate turnaround time and waiting time for the different scheduling approaches.

    Copyright:

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

    Operating systems Lab – CPU scheduling

    Q 1. Write a C program to simulate FCFS (First come First Serve) based CPU scheduling to find
    turnaround time and waiting time.
    Q 2. Write a C program to simulate SJF (Shortest Job First) based CPU scheduling to find turnaround
    time and waiting time.
    Q 3. Say that the system is running 3 jobs, A, B, and C, and that all of them are CPU-intensive (i.e.,
    each one does one infinitely long CPU burst). The system begins with A on the CPU at the beginning
    its time quantum while B and C are in the Ready Queue, in that order. Write a C program to simulate
    such CPU scheduling with the scheduler time quantum is equal to 4 ms to find turnaround time and
    waiting time for all three processes A, B, and C.
    Q 4. Write a C program to simulate Priority based CPU scheduling to find turnaround time and waiting
    time.

    You might also like