Scribd Logo
Upload

Welcome to Scribd!

  • Index: Sr. No. Experiment Title No. Date Sign

    Uploaded by

    Krunal Makwana
    4 views1 page
    This document contains an index of 10 experiments related to CPU scheduling algorithms. The experiments are writing programs to implement FCFS, SJF, calculating waiting and turnaround times for multiple processes, priority scheduling, creating a child process using fork(), non-preemptive FCFS scheduling, non-preemptive SJF scheduling, non-preemptive LJF scheduling, non-preemptive priority scheduling, and preemptive SRTF scheduling. The index lists the experiment titles and their corresponding page numbers but no other details.

    Original Description:

    Original Title

    osp

    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 an index of 10 experiments related to CPU scheduling algorithms. The experiments are writing programs to implement FCFS, SJF, calculating waiting and turnaround times for multiple processes, priority scheduling, creating a child process using fork(), non-preemptive FCFS scheduling, non-preemptive SJF scheduling, non-preemptive LJF scheduling, non-preemptive priority scheduling, and preemptive SRTF scheduling. The index lists the experiment titles and their corresponding page numbers but no other details.

    Copyright:

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

    Index: Sr. No. Experiment Title No. Date Sign

    Uploaded by

    Krunal Makwana
    This document contains an index of 10 experiments related to CPU scheduling algorithms. The experiments are writing programs to implement FCFS, SJF, calculating waiting and turnaround times for multiple processes, priority scheduling, creating a child process using fork(), non-preemptive FCFS scheduling, non-preemptive SJF scheduling, non-preemptive LJF scheduling, non-preemptive priority scheduling, and preemptive SRTF scheduling. The index lists the experiment titles and their corresponding page numbers but no other details.

    Copyright:

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

    INDEX

    Sr. Page
    No. Experiment Title No. Date Sign
    Write a program to implement First Come First Served (FCFS) job
    1 scheduling algorithm.

    Write a program to implement Shortest Job First (SJF) job scheduling


    2

    write a Program to calculate waiting time and turnaround time of


    3 multiple process

    Write a program to implement priority scheduling.


    4

    To write a program to create a child process using fork() system call.


    5
    To write a program demonstrating non-pre-emptive First Come First Serve
    6 job scheduling.

    To write a program demonstrating non-pre-emptive Shortest Job First


    7 scheduling.

    To write a program demonstrating non-pre-emptive Longest Job First


    8 scheduling.

    To write a program demonstrating non-pre-emptive Priority scheduling.


    9
    To write a program demonstrating pre-emptive Shortest Remaining Time
    10 First (SRTF) scheduling.

    You might also like