C Tutorial

C Tutorial C Language Environment Setup Execution flow of C program C printf and Scanf C Data type C Token Variable in C Operators in C Comments in C Escape Sequence in C C – Storage Classes C Decision control statement Loop Statement in C Break, continue and goto statement in C Type Casting in C Function in C Recursion in C String in C C Array Pointer in C Dynamic memory allocation C –Structure Nested Structure in C Union in C File Handling in C C pre-processor Static Function In C Sizeof In C Selection Sort In C Scope Of Variables In C Runtime Vs Compile Time In C Random Access Lseek In C Queue Implementation In C Pseudo Code In C Prototype In C Pointer To Pointer In C Pointer Arithmetic In C Passing Array To Function In C Null Character In C Merge Sort In C Macros In C Library Functions In C Memory Leak In C Int In C Goto And Labels In C Fibonacci Series In C Fflush In C Derived Data Types In C Data Types In C Const Vs Volatile In C Character Set In C Character Class Tests In C Calloc In C C Pointers Arrays In C Include In C Clrscr In C C Vs Java String Literals In C Types Of Pointers In C Variables In C Volatile In C Why C Is A Middle Level Language Infix To Postfix Program In C Ceil function in C LCM of two numbers in C Quick sort in C Static in C function pointer as argument in C Top Array Keywords in C Add two numbers using the function in C Armstrong program in C using function Array, Declaring Arrays and Array Initialization Limitations of Inline Function in C Merge and Merge sort with example in C Do-While Loop in C For Loop in C While-Loop in C Difference between while and do-while loop in C Array Of Structures in C Data Structures And Algorithms in C Types Of Structures In C How to Avoid Structure Padding in C Use of Structure in C Do WHILE LOOP in C Programming Examples For Loop in C Programming Examples Entry Control Loop in C Exit control loop in C Infinite loop in C Nested loop in C pow() function in C String Handling functions in C Prime Number code in C Factorial Program in C using For Loop Factorial Program in C Using While Loop Fibonacci Series in C Using For Loop Fibonacci series in C using while loop Prime Number Program in C using for Loop While Loop in C programming examples Built-in functions in C Assert() Function C vs Java Strings Call Back Function in Embedded C Else If Ladder fgets() function Ftell() Function getc() function getch() function gets() function Heap Sort Nested if-else statement Pi() Function Positioning of file Write() function abs() function in C Attributes in C C program to find factorial of a number using Recursion Ferror() in c fopen() function in C Fibonacci series program in C using Recursion Formatted Input and output function in C Snake Game in C User Defined Functions in C Beep() function in C Cbrt() function in C Hook() function in C Isalnum() function in C C Program to find the Roots of a Quadratic Equation C Switch Statements Difference between rand() and srand() function in C Difference between while and for loop in C Doubly Linked list in C Example of Iteration in C How to use atoi() function in C How to use floor() function in C How to use sine() function in C How to use Typedef Struct in C Integer Promotions in C C Program Swap Numbers in cyclic order Using Call by Reference C Program to Find Largest Number Using Dynamic Memory Allocation C Program to Find the Largest Number using Ternary Operator C/C++ Program to Find the Size of int, float, double and char Find the Largest Three Distinct Elements in an Array using C/C++ Loop Questions in C Modulus on Negative Numbers in C Multiplication table program in C using For loop Nested Loops in C Programming Examples C Program for Mean and Median of an Unsorted Array Results of Comparison Operations in C and C++ Reverse a Stack using Recursion in C Simple hash() function in C strcat() Function in C Sum of N numbers in C using For loop Use of free() function in C Write a program that produces different results in C and C++ C Function Argument and Return Values Keywords in C Bank management system in C Calendar application in C Floor() Function in C Free() Function in C How to delete a file in C How to move a text in C Remove an element from an array in C Unformatted input() and output() function in C What are linker and loader in C SJF Scheduling Program in C Socket Programming in C Structure in C Tower of Hanoi in C Union Program in C Variable Declaration in C What is Linked List in C While Loop Syntax in C fork() in C GCD program in C Branching Statements in C Comma Operator in C Control statement in C Double Specifier in C How to create a binary file in C Long int in C Palindrome Number in C Pure Virtual Function in C Run Time Polymorphism in C Types of Array in C Types of Function in C What is a buffer in C What is required in each C Program Associativity of Operators in C Bit Stuffing Program in C Actual and Formal Parameters Addition of two Numbers in C Advantages of function in C Arithmetic Progression Program in C Binomial Coefficient Program in C Difference between Array and List in C Diffie-Hellman Algorithm in C How to convert a number to words in C How to convert a string to hexadecimal in C Difference between If and Switch Statement in C C and C++ Binary Files C program that does not Suspend when Ctrl+Z is Pressed Different ways to Declare the Variable as Constant in C Range of Int in C C Program to find the size of a File FIFO Example in the C Language For loop in C Programming GCD program of two numbers in C GPA Calculator in C How to Calculate Time Complexity in C How to include graphics.h in C How to measure time taken by a function in C How to return a Pointer from a Function in C What is the main in C Addition of Matrix in C Booleans in C C Program for Extended Euclidean algorithms C Program of Fencing the Ground Ceil and Floor in C Compound Interest Program in C Displaying Array in C Distance Vector Routing Protocol Program in c Dos.h Header File in C Language DSA Program in C Explain the two-way selection in C Fee Management System in C File Operations in C Malloc function in C Multiplication Table in C Simple Programs in C Language tolower() Function in C Type Conversion in the C Why does sizeof(x++) not Increment x in C Advantages of Dynamic Memory Allocation in C Armstrong Number in C Assignment Operator Program in C Banker’s Algorithm in C Binary Search in C with Best and Worst Time Complexity Caesar Cipher Program in C Call by Value and Call by Reference in C Conditional Operator in C CRC Program in C Deadlock Detection Program in C Decimal to Binary in C Difference between If Else and Nested If Else in C Difference between Pre-increment and Post-increment in C Difference between Scope and Lifetime in C Evaluation of Arithmetic Expression in C Explain the Increment and Decrement Operators in C Fseek Function in C Functions in C How to Find Square Free Numbers in C Length of an Array Function in C OpenGL in C Projects on C language in 2023 Purpose of a Function Prototype in C Stdio.h in C Two-Dimensional array in C What is String Comparison in C

SJF Scheduling Program in C

The SJF (shortest job first) or the shortest job next is the programming scheduling in the C. It is one of the CPU scheduling programming. The SJF is defined as the scheduling process or the scheduling policy in the algorithm that prescribes the waiting time process into the execution time next.

There are Two types of SJF are there:

  • Non-Preemptive SJF
  • Pre-emptive SJF

These are the algorithms are serialized in the order which has the minimum or least average Time.

The SJF can be considered in three aspects:

  1. Burst Time
  2. Average TAT (Turn Around Time)
  3. Average WT (Waiting Time)

Characteristics of the SJF Scheduling in C

  • The first advantage of the shortest job first is it calculate the minimum average of the waiting time from all of the scheduling processed algorithms.
  • It is one of the Greedy algorithms.
  • It can be ready for the CPU process that can wait with the low priority due to it runs indefinitely.
  • The shortest First job can be used in the specialized scenario where it estimates the accurate running time.

Algorithm for the SJF

  • Firstly, we have to sort all the processes with respective to its arrival time.
  • After that we have to select the processes which have the minimum arrival and burst time.
  • The processes after the completion we have to sort the processes that will wait for completing the previous processes and we have to select the processes which having the least Burst time value.

Let's take an Example for SJF (shortest job First)

    Processes    Burst Time
P1          5
P2          8
P3          2
P4          7

1. The process P1 second because it has the burst time value as 5 which is greater than P3 and less than the P2 and P4.

Then the waiting time of the P1 will be consider as 2 (I.e., P1 = 2).

2.  Secondly, the process P2 will be executed as it consists of the greatest burst time of the value 8. which is greater than the P1, P3, P4.

Then the waiting time of the P2 will be considered as 14(P1+P3+P4).

3. Later on the P2, the Process P3 will be executed and it has the burst time value as 2, which is less than the P1, P2, P3. It will be executed First.

The waiting time for P3 = 0.

4. Then the Process P4 will be executed it has the Burst time value as 7 which is greater than the P1, P3 and less than the P2.

The waiting time for the process P4 will be considered as 7(P1+P3).

Computing the SJF using an example program.

  • The completion Time defined as the time calculated after the process completes the Execution part.
  • The Turn Around Time is the difference between Completion time and the Arrival time.

          TAT = (Completion – Arrival) Time.

  • Waiting Time will be calculated as the difference between the TAT (Turn Around Time) and the Burst Time.

  Waiting Time = (TAT – Burst Time).

Let’s see an example program for Non-preemptive SJF

#include <stdio.h>   // preprocessor
intmain()    // main function
intN[20][4]; // we are using matrix to store values
// Time, Average WT & Average TAT
inti, j, x, sum = 0, pos, temp;
float avgwt, avgtat; //  Average WT & Average TAT
printf("Enter the number of the processes: ");
scanf("%d", &x);
printf("Enter the Burst Time value:\n");
for (i = 0; i< x; i++)  // allocating values for processes
printf("Processes: ", i + 1);
scanf("%d", &N[i][1]);
N[i][0] = i + 1;
for (i = 0; i< x; i++) // soring the Burst Time value
pos = i;
for (j = i + 1; j < x; j++)
if (N[j][1] < N[pos][1])
pos = j;
temp = N[i][1];
N[i][1] = N[pos][1];
N[pos][1] = temp;

temp = N[i][0];
N[i][0] = N[pos][0];
N[pos][0] = temp;
N[0][2] = 0;
// Calculating the Waiting Times values in SJF
for (i = 1; i< x; i++)
N[i][2] = 0;
for (j = 0; j <i; j++)
N[i][2] += N[j][1];
sum += N[i][2];
avgwt = (float)sum / x;
sum = 0;
printf("processes	Burst Time	Waiting Time Turnaround Time\n");
for (i = 0; i< x; i++)  // calculating the TAT values and printing
N[i][3] = N[i][1] + N[i][2];
sum += N[i][3];
printf("processes	 %d	 %d	%d\n", N[i][0],
N[i][1], N[i][2], N[i][3]);
avgtat = (float)sum / x;
printf("\nAverage Waiting Time is calculated = %f", avgwt);
printf("\nAverage Turn Around Time is calculated= %f", avgtat);


SJF Scheduling Program in C

In the following programming we calculated the Average waiting time and the average Turnaround Time with respective to their jobs.

Let's see an example program for pre-emptive SJF scheduling in c:

#include <stdio.h>
intat[100], bt[100], temp[100];
inti, least, count = 0, time, n;
double wt = 0, tat = 0, end;
float averageWt, averageTat;
printf("\nEnter the Total Number of the Processes:");
scanf("%d", &n);
printf("nEnter the Details of the %d Processes\n", n);
for(i = 0; i< n; i++)
printf("\nEnter the Arrival Time of Processes:");
scanf("%d", &at[i]);
printf("Enter the Burst Time of Processes:");
scanf("%d", &bt[i]);
temp[i] = bt[i];
bt[99] = 10000;
for(time = 0; count != n; time++)
least = 99;
for(i = 0; i< n; i++)
if(at[i] <= time &&bt[i] <bt[least] &&bt[i] > 0)
least = i;
if(bt[least] == 0)
end = time + 1;
wt = wt + end - at[least] - temp[least];
tat = tat + end - at[least];
averageWt = wt / n;
averageTat = tat / n;
printf("\n The Average Waiting Time of Processes:%lfn", averageWt);
printf("\n The Average Turn Around Time of Processes:%lfn", averageTat);
return 0;


SJF Scheduling Program in C