OPERATING SYSTM’s ALGORITHM (In LINUX OS) - DINING PHILOSOPHERS PROBLEM


DINING PHILOSOPHERS PROBLEM



PROGRAM:

#include<stdio.h>
int i,j,pn,ch,k,l;
char state[5];
int thinking=0;
int hungry=1;
int eating=2;
main()
{
do
{
printf(“\nEnter the choice\n”);
printf(“1.Pick up\n2.Put down\n3.Exit\n”);
scanf(“%d”,&ch);
switch(ch)
{
case 1:
printf(“Enter the philosopher number”);
scanf(“%d”,&pn);
pickup(pn);
break;
case 2:
printf(“Enter the philosopher number”);
scanf(“%d”,&pn);
putdown(pn);
break;
}
} while(ch!=3);
}


int pickup(int i)
{
state[i]=hungry;
test(i);
if(state[i]!=eating)
printf(“Philosopher %d has to wait\n’,i);
}
int putdown(int k)
{
state[k]=thinking;
test((k+4)%5);
test((k+1)%5);
}
int test(int l)
{
if(state[(l+4)%5]!=eating&&state[l]==hungry&&state[(l+1)%5!=eating)
{
state[l]=eating;
printf(“Philosopher  %d can eat\n”,l);
}
}


OUTPUT:

Enter the choice
1.Pick up
2.Put down
3.Exit
1
Enter the philosopher number 1
Philosopher 1can eat
Enter the choice
1.Pick up
2.Put down
3.Exit
1
Enter the philosopher number 3
Philosopher 3 has to wait
Enter the choice
1.Pick up
2.Put down
3.Exit
2
Enter the philosopher number 2
Philosopher 3 can eat
Enter the choice
1.Pick up
2.Put down
3.Exit

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

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

OPERATING SYSTM’s ALGORITHM (In LINUX OS) - FIRST FIT, BEST FIT, WORST FIT ALGORITHM

FIRST FIT, BEST FIT, WORST FIT ALGORITHM PROGRAM: #include<stdio.h> int mem[20],proc[20],bp[20],bm[20],cm[20],cp[20],ms,ps,i,j,ch,y; main() {             printf(“\nEnter the number of memory segments”);             scanf(“%d”,&ms);             printf(“\nEnter the memory segment”);             for(i=0;i<ms;i++)             {                         scanf(“%d”,&mem[i]);                         bm[...
Read more