OPERATING SYSTM’s ALGORITHM (In LINUX OS) - FIRST COME FIRST SERVE SCHEDULING



FIRST COME FIRST SERVE SCHEDULING


PROGRAM:

#include<stdio.h>
struct fcfs
{
int at,st,ct,tt;
}f[10];
main()
{
int no;
int i,d;
printf(“\nEnter the number of jobs”);
scanf(“%d”,&no);
for(i=0;i<no;i++)
{
            printf(“\nEnter the arrival time for job %d”,i+1);
            scanf(“%d”,&f[i].at);
            printf(“\nEnter the service time for job %d”,i+1);
            scanf(“%d”,&f[i].st);
}
f[-1].ct=0;
for(i=0;i<no;i++)
{
            if(f[i-1].ct<f[i].at)
            {
                        d=f[i].at-f[i-1].ct;
f[i].ct=f[i-1].ct+f[i].st+d;
f[i].tt=f[i].ct-f[i].at;
                        }
else
{
                                    f[i].ct=f[i-1].ct+f[i].st;
                                    f[i].tt=f[i].ct+f[i].at;
                        }
                        printf(“\nJob %d\n”,i+1);
                        printf(“Arrival time = %d\n”,f[i].at);
            printf(“Service time = %d\n”,f[i].st);
                        printf(“Compilation time = %d\n”,f[i].ct);
                        printf(“Turnaround time = %d\n”,f[i].tt);
            }
}


OUTPUT:

Enter the number of jobs 3
Enter the arrival time for job 1 15
Enter the service time for job 1 10
Enter the arrival time for job 2 25
Enter the service time for job 2 20
Enter the arrival time for job 3 35
Enter the service time for job 3 30

Job 1
Arrival time = 15
Service time = 10
Compilation time = 25
Turnaround time = 10

Job 2
Arrival time = 25
Service time = 20
Compilation time = 45
Turnaround time = 70


Job 3
Arrival time = 35
Service time = 30
Compilation time = 75
Turnaround time = 110

Comments

Post a Comment

Popular posts from this blog

TRAVELING SALESMAN USING BRANCH AND BOUND TECHNIQUE

Image
The Traveling Salesman Problem (TSP) is a classic problem in computer science and optimization theory. The problem is defined as follows: given a set of cities and the distances between them, find the shortest possible path that visits each city exactly once and returns to the starting city. The Branch and Bound technique is an algorithmic paradigm for solving combinatorial optimization problems. The basic idea is to explore the search space by dividing it into smaller subproblems, and then pruning branches of the search tree that can be shown to lead to suboptimal solutions. The branch and bound algorithm for the TSP works by starting with an initial lower bound on the length of the optimal tour, and then exploring the search space by systematically building up partial tours and computing lower bounds on their completion. Sample C code for solving the Traveling Salesman Problem(TSP) using the branch and bound technique: #include <stdio.h> #include <stdlib.h> #include &
Read more

BOOKS DETAILS USING C STRUCTURE

              To write a c program to create a collection of books using array of structure and performs the following operatons. (i)                  Searching a book with title and author name. (ii)                Sort the book based on title. /*BOOKS DETAILS*/ #include<stdio.h> #include<conio.h> #include<string.h> struct books { char book[20]; char author[20]; int price; }; int main() { int i,ch,j,n,flag=1; struct books l[10]; struct books t[1]; char sbook[20],saut[20]; clrscr(); do{ clrscr(); printf("\n\t\tBOOK LIST\n\nMAIN MENU\n\n"); printf("\n1.creation\n2.search by title & author\n"); printf("3.sort by title\n4.exit\n"); printf("\nEnter your choice:"); scanf("%d",&ch); switch(ch) { case 1: clrscr(); printf("\nEnter number of booklist:"); scanf("%d",&n); for(i=1;i<=n;i+
Read more

TRAVELING SALESMAN USING BRANCH AND BOUND TECHNIQUE

TRAVELING SALESMAN USING BRANCH AND     BOUND TECHNIQUE  #include<iostream.h> #include<conio.h> int main() { int i,j,k,n,min,g[20][20],c[20][20],s,s1[20][1],s2,lb; clrscr(); cout<<"\n TRAVELLING SALESMAN PROBLEM"; cout<<"\n Input number of cities:"; cin>>n; for(i=1;i<=n;i++) { for(j=1;j<=n;j++) { c[i][j]=0; }} for(i=1;i<=n;i++) { for(j=1;j<=n;j++) { if(i==j) continue; else{ cout<<"input"<<i<<"to"<<j<<"cost:"; cin>>c[i][j]; } } } for(i=2;i<=n;i++) { g[i][0]=c[i][1]; } for(i=2;i<=n;i++) { for(j=2;j<=n;j++) { if(i!=j) g[i][j]=c[i][j]+g[j][0]; } } for(i=2;i<=n;i++) { for(j=2;j<=n;j++) { if(i!=j) break; } } for(k=2;k<=n;k++){ if(i!=k && j!=k){ if((c[i][j]+g[i][k])<(c[i][k]+g[k][j])) { g[i][j]=c[i][j]+g[j][k]; s1[i][j]=j; } else { g[i][1]=c[i][k]+g[k][j];
Read more