Operating System - Lab Programs For Students of Anna University of Technology - Roy Brothers1

9/22/2017 Operating System | Lab Programs for Students of Anna University of Technology - Roy Brothers
Simulation of Producer Consumer Problem
/* Producer Consumer problem */
#include<iostream.h>
#include<conio.h>
#include<stdlib.h>
#define max 5
class que
int v[max],c[max];
int f,r,g,cc,pc,n;
public:
que()
f=r=-1;
n=0;
g=0;
pc=0;
cc=0;
void push()
int x,ch2;
while(1)
cout<<Enter the Value to Produce:;
cin>>x;
if(f==-1)
f=0;
cc++;
https://labprograms.wordpress.com/category/operating-system/page/3/ 1/29
v[++r]=x;
n++;
else if((f==0)&&(r==max-1)||f-r==1)
cout<<\n Buffer is Full\n;
else if((r==max-1)&&(f!=0))
r=-1;v[++r]=x;
n++;
cc++;
else
cc++;
v[++r]=x;
n++;
cout<<Do U Want to Continue(1/2):;
cin>>ch2;
if(ch2==2)
break;
void pop()
int i=0;
int ch1=1;
while(1)
if(n==0)
cout<<\n Buffer is Empty\n;
break;
if((f==max)&&(r!=max-1))
f=-1;
else
cout<<\n Consumer Is Consuming The Items\n;
pc++;
c[g++]=v[f++];
n;
cout<<\n Do U Want to Continue(1/2):\n;
cin>>ch1;
if(ch1==2)
break;
void dis()
int i=0;
if(n==0)
cout<<\nConsumer is in Idle No item to consume.\n;
else
if(f<=r)
cout<<\n The Buffer has:\n;
for(i=f;i<=r;i++)
cout<<v[i]<<\t;
else
for(i=0;i<=r;i++)
cout<<v[i]<<\t;
for(i=f;i<max;i++)
cout<<v[i]<<\t;
};
void main()
que d;
int ch1;
char o,ch;
clrscr();
cout<<\t\t\tPRODUCER CONSUMER PRObLEM\n;
do
cout<<\nTHE OPERATIONS ARE\n;
cout<<\n1.PRODUCER WRITE\n2.CONSUMER GET\n3.BUFFER\n4.Exit\n;
cout<<\n Enter ur OPERATION:;
cin>>ch1;
switch(ch1)
case 1:
d.push();
break;
case 2:
d.pop();
break;
case 3:
d.dis();
break;
default:
cout<<Exit.;
exit(0);
}while(ch1!=4);
getch();
August 13, 2009

Categories: Operating System . Tags: CPP, OS . Author: Roy Antony Arnold .
Comments: Comments Off
Implementation of Dekkers Algorithm
//Dekkers Algorithm
# include <stdio.h>
# include<pthread.h>
# include<cursors.h>
int turn=0, flag[2]={0,0},bal=0;
void longdelay()
long int t1,t2;
for(t1=0;t1<64000;t1++);
for(t2=0;t2<64000;t2++);
void shortdelay()
int t3,t4;
for(t3=0;t3<32000;t3++)
for(t4=0;t4<32000;t4++)
void test(int i)
int j,k,m,p,q,r,c;
j=1-i;
for(k=0;k<3;k++)
flag[i]=1;
while(flag[j])
if (turn==j)
flag[i]=0;
printf(Iam waiting:%d,i);
while(turn==j);
flag[i]=1;
longdelay();
printf(Iam entering %d,i);
c=bal;
/*critical section*/
printf(\n process: %d,l);
printf(flag[%d]=%d, flag[%d]=%d,i,flag[i],j,flag[j]);
printf(turn=%d\n,turn);
bal=c+1000;
printf(the balance is %d,bal);
turn=j;
flag[i]=0;
printf(Iam exiting: %d,i);
shortdelay();
int main()
pthread_t t1,t2;
pthread_creat(&t,NULL,(void*)&test,(void*)0);
printf(After creation of first thread..);
pthread_creat(&t2,NULL,(void*)&test,(void*)1);
pthread_join(t1,NULL);
pthread_join(t2,NULL);
sleep(s);
printf(Parent terminated:%d,bal);
return(0);
August 13, 2009

Categories: Operating System . Tags: C, OS . Author: Roy Antony Arnold .
Program for Bankers Algorithm
/*Implementation of Bankers Algorithm*/
#include<stdio.h>
#include<conio.h>
struct process
int all[6],max[6],need[6],finished,request[6];
}p[10];
int avail[6],sseq[10],ss=0,check1=0,check2=0,n,pid,work[6];
int nor,nori;
void main()
int safeseq(void);
int ch,i=0,j=0,k,pid,ch1;
int violationcheck=0,waitcheck=0;
do
clrscr();
printf(\n\n\t 1. Input);
printf(\n\n\t 2. New Request);
printf(\n\n\t 3. Safe State or Not);
printf(\n\n\t 4. print);
printf(\n\n\t 5. Exit);
printf(\n\n\t Enter ur choice : );
scanf(%d,&ch);
switch(ch)
case 1:
printf(\n\n\t Enter number of processes : );
scanf(%d,&n);
printf(\n\n\t Enter the Number of Resources : );
scanf(%d,&nor);
printf(\n\n\t Enter the Available Resouces : );
for(j=0;j<n;j++)
for(k=0;k<nor;k++)
if(j==0)
printf(\n\n\t For Resource type %d : ,k);
scanf(%d,&avail[k]);
p[j].max[k]=0;
p[j].all[k]=0;
p[j].need[k]=0;
p[j].finished=0;
p[j].request[k]=0;
for(i=0;i<n;i++)
printf(\n\n\t Enter Max and Allocated resources for P%d : ,i);

for(j=0;j<nor;j++)
printf(\n\n\t Enter the Max of resource %d : ,j);
scanf(%d,&p[i].max[j]);
printf(\n\n\t Allocation of resource %d : ,j);
scanf(%d,&p[i].all[j]);
if(p[i].all[j]>p[i].max[j])
printf(\n\n\t Allocation should be less < or == max);
j;
else
p[i].need[j]=p[i].max[j]-p[i].all[j];
avail[j]=avail[j]-p[i].all[j];
break;
case 2:
violationcheck=0;
waitcheck=0;
printf(\n\n\t Requesting process id : );
scanf(%d,&pid);
for(j=0;j<nor;j++)
printf(\n\n\t Number of Request for resource %d : ,j);

scanf(%d,&p[pid].request[j]);
if(p[pid].request[j]>p[pid].need[j])
violationcheck=1;
if(p[pid].request[j]>avail[j])
waitcheck=1;
if (violationcheck==1)
printf(\n\n\t The Process Exceeds its Max Need: Terminated);
else if(waitcheck==1)
printf(\n\n\t Lack of Resourcess : Process State Wait);
else
for(j=0;j<nor;j++)
avail[j]=avail[j]-p[pid].request[j];
p[pid].all[j]=p[pid].all[j]+p[pid].request[j];
p[pid].need[j]=p[pid].need[j]-p[pid].request[j];
ch1=safeseq();
if(ch1==0)
printf(\n\n\t Granting leads to Unsafe state : );
printf(\n\n\t Request Denied );
for(j=0;j<nor;j++)
avail[j]=avail[j]+p[pid].request[j];
p[pid].all[j]=p[pid].all[j]-p[pid].request[j];
p[pid].need[j]=p[pid].need[j]+p[pid].request[j];
else if(ch1==1)
printf(\n\n\t Request Committed );
break;
case 3:
if(safeseq()==1)
printf(\n\n\t The System is in safe state );
else
printf(\n\n\t The System is Not in safe state );
break;
case 4:
printf(\n\n\t Number of processes : %d,n);
printf(\n\n\t Number of Resources : %d,nor);
printf(\n\n\t Pid \t Max \t Allocated \t Need );
for(i=0;i<n;i++)
printf(\n\n\t P%d : ,i);
for(j=0;j<nor;j++)
printf( %d ,p[i].max[j]);
printf(\t);
for(j=0;j<nor;j++)
printf( %d ,p[i].all[j]);
printf(\t);
for(j=0;j<nor;j++)
printf( %d ,p[i].need[j]);
printf(\n\n\t Available : );
for(i=0;i<nor;i++)
printf( %d ,avail[i]);
break;
case 5:
break;
getch();
}while(ch!=5);
int safeseq()
int i,j,k;
ss=0;
for(j=0;j<nor;j++)
work[j]=avail[j];
for(j=0;j<n;j++)
p[j].finished=0;
for(int tk=0;tk<nor;tk++)
for(j=0;j<n;j++)
if(p[j].finished==0)
check1=0;
for(k=0;k<nor;k++)
if(p[j].need[k]<=work[k])
check1++;
if(check1==nor)
for(k=0;k<nor;k++)
work[k]=work[k]+p[j].all[k];
p[j].finished=1;
sseq[ss]=j;
ss++;
}
check2=0;
for(i=0;i<n;i++)
if(p[i].finished==1)
check2++;
printf(\n\n\t);
if(check2>=n)
printf(\n\n\t The system is in safe state);
for(int tj=0;tj<n;tj++)
printf(P%d, ,sseq[tj]);
return 1;
else
printf(\n\n\t The system is Not in safe state);
return 0;
July 31, 2009

CPU Scheduling Algorithms FCFS, SJF and Round Robin
//CPU Scheduling algorithms
//FCFS, Round Robin and Shortest Job First
#include<conio.h>
#include<stdio.h>
class cpuschedule
int n,bu[20];
float twt,awt,wt[20],tat[20];
public:
void Getdata();
void fcfs();
void sjf();
void roundrobin();
};
//Getting no of processes and Burst time
void cpuschedule::Getdata()
int i;
cout<<Enter the no of processes:;
cin>>n;
for(i=1;i<=n;i++)
cout<<\nEnter The BurstTime for Process p<<i<<=;
cin>>bu[i];
//First come First served Algorithm
void cpuschedule::fcfs()
int i,b[10];
float sum=0.0;
twt=0.0;
for(i=1;i<=n;i++)
b[i]=bu[i];
cout<<\nBurst time for process p<<i<<=;
cout<<b[i];
wt[1]=0;
for(i=2;i<=n;i++)
wt[i]=b[i-1]+wt[i-1];
for(i=1;i<=n;i++)
twt=twt+wt[i];
tat[i]=b[i]+wt[i];
sum+=tat[i];
awt=twt/n;
sum=sum/n;
cout<<\nTotal Waiting Time=<<twt;
cout<<\nAverage Waiting Time=<<awt;
cout<<\nAverage Turnaround time=<<sum;
//Shortest job First Algorithm
void cpuschedule::sjf()
int i,j,temp,b[10];
float sum=0.0;
twt=0.0;
for(i=1;i<=n;i++)
b[i]=bu[i];
cout<<b[i];
for(i=n;i>=1;i)
for(j=2;j<=n;j++)
if(b[j-1]>b[j])
temp=b[j-1];
b[j-1]=b[j];
b[j]=temp;
}
wt[1]=0;
for(i=2;i<=n;i++)
wt[i]=b[i-1]+wt[i-1];
for(i=1;i<=n;i++)
twt=twt+wt[i];
tat[i]=b[i]+wt[i];
sum+=tat[i];
awt=twt/n;
sum=sum/n;
cout<<\nAverage turnaround time=<<sum;
//Round Robin Algorithm
void cpuschedule::roundrobin()
int i,j,tq,k,b[10],Rrobin[10][10],count[10];
int max=0;
int m;
float sum=0.0;
twt=0.0;
for(i=1;i<=n;i++)
b[i]=bu[i];
cout<<b[i];
if(max<b[i])
max=b[i];
wt[i]=0;
cout<<\nEnter the Time Quantum=;
cin>>tq;
//TO find the dimension of the Round robin array
m=max/tq+1;
//initializing Round robin array
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
Rrobin[i][j]=0;
//placing value in the Rrobin array
i=1;
while(i<=n)
j=1;
while(b[i]>0)
if(b[i]>=tq)
b[i]=b[i]-tq;
Rrobin[i][j]=tq;
j++;
else
Rrobin[i][j]=b[i];
b[i]=0;
j++;
count[i]=j-1;
i++;
cout<<Display;
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
cout<<\nRr[<<i<<,<<j<<]=<<Rrobin[i][j];
cout<< ;
cout<<\ncount=<<count[i];
for(j=1;j<=n;j++)
for(i=1;i<=count[j];i++)
if(i==count[j])
for(k=1;k<j;k++)
if(k!=j)
wt[j]+=Rrobin[k][i];
else
for(k=1;k<=n;k++)
if(k!=j)
wt[j]+=Rrobin[k][i];
for(i=1;i<=n;i++)
cout<<\nWaiting Time for process P<<i<<=<<wt[i];
//calculating Average Weighting Time
for(i=1;i<=n;i++)
twt=twt+wt[i];
tat[i]=b[i]+wt[i];
sum+=tat[i];
awt=twt/n;
sum=sum/n;
void main()
int ch=0,cho;
cpuschedule c;
clrscr();
do
switch(ch)
case 0:
cout<<\n0.MENU;
cout<<\n1.Getting BurstTime;
cout<<\n2.FirstComeFirstServed;
cout<<\n3.ShortestJobFirst;
cout<<\n4.RoundRobin;
cout<<\n5.EXIT;
break;
case 1:
c.Getdata();
break;
case 2:
cout<<FIRST COME FIRST SERVED SCHEDULING;
c.fcfs();
break;
case 3:
cout<<SHORTEST JOB FIRST SCHEDULING;
c.sjf();
break;
case 4:
cout<<ROUND ROBIN SCHEDULING;
c.roundrobin();
break;
case 5:
break;
cout<<\nEnter your choice:;
cin>>ch;
getch();
}while(ch<5);
July 24, 2009

Categories: Operating System . Tags: CPP, OS . Author: Roy Antony Arnold . Comments: 8
Comments
CPU Scheduling
//CPU Scheduling algorithms
//FCFS, Round Robin and Shortest Job First
#include<conio.h>
#include<stdio.h>
class cpuschedule
int n,Bu[20];
float Twt,Awt,Wt[20],Tat[20];
public:
void Getdata();
void Fcfs();
void Sjf();
void RoundRobin();
};
//Getting no of processes and Burst time
void cpuschedule::Getdata()
int i;
cout<<Enter the no of processes:;
cin>>n;
for(i=1;i<=n;i++)
cout<<\nEnter The BurstTime for Process p<<i<<=;
cin>>Bu[i];
//First come First served Algorithm
void cpuschedule::Fcfs()
int i,B[10];
float sum=0.0;
Twt=0.0;
for(i=1;i<=n;i++)
B[i]=Bu[i];
cout<<B[i];
Wt[1]=0;
for(i=2;i<=n;i++)
Wt[i]=B[i-1]+Wt[i-1];
for(i=1;i<=n;i++)
Twt=Twt+Wt[i];
Tat[i]=B[i]+Wt[i];
sum+=Tat[i];
Awt=Twt/n;
sum=sum/n;
cout<<\nTotal Waiting Time=<<Twt;
cout<<\nAverage Waiting Time=<<Awt;
cout<<\nAverage Turnaround time=<<sum;
//Shortest job First Algorithm
void cpuschedule::Sjf()
int i,j,temp,B[10];
float sum=0.0;
Twt=0.0;
for(i=1;i<=n;i++)
B[i]=Bu[i];
cout<<B[i];
for(i=n;i>=1;i)
for(j=2;j<=n;j++)
if(B[j-1]>B[j])
temp=B[j-1];
B[j-1]=B[j];
B[j]=temp;
}
Wt[1]=0;
for(i=2;i<=n;i++)
Wt[i]=B[i-1]+Wt[i-1];
for(i=1;i<=n;i++)
Twt=Twt+Wt[i];
Tat[i]=B[i]+Wt[i];
sum+=Tat[i];
Awt=Twt/n;
sum=sum/n;
//Round Robin Algorithm
void cpuschedule::RoundRobin()
int i,j,tq,k,B[10],Rrobin[10][10],count[10];
int max=0;
int m;
float sum=0.0;
Twt=0.0;
for(i=1;i<=n;i++)
B[i]=Bu[i];
cout<<B[i];
if(max<B[i])
max=B[i];
Wt[i]=0;
cout<<\nEnter the Time Quantum=;

cin>>tq;
//TO find the dimension of the Round robin array
m=max/tq+1;
//initializing Round robin array
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
Rrobin[i][j]=0;
//placing value in the Rrobin array
i=1;
while(i<=n)
j=1;
while(B[i]>0)
if(B[i]>=tq)
B[i]=B[i]-tq;
Rrobin[i][j]=tq;
j++;
else
Rrobin[i][j]=B[i];
B[i]=0;
j++;
count[i]=j-1;
i++;
cout<<Display;
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
cout<<\nRr[<<i<<,<<j<<]=<<Rrobin[i][j];
cout<< ;
cout<<\ncount=<<count[i];
for(j=1;j<=n;j++)
for(i=1;i<=count[j];i++)
if(i==count[j])
for(k=1;k<j;k++)
if(k!=j)
Wt[j]+=Rrobin[k][i];
else
for(k=1;k<=n;k++)
if(k!=j)
Wt[j]+=Rrobin[k][i];
for(i=1;i<=n;i++)
cout<<\nWaiting Time for process P<<i<<=<<Wt[i];
//calculating Average Weighting Time
for(i=1;i<=n;i++)
Twt=Twt+Wt[i];
Tat[i]=B[i]+Wt[i];
sum+=Tat[i];
Awt=Twt/n;
sum=sum/n;
void main()
int ch=0,cho;
cpuschedule c;
clrscr();
do
switch(ch)
case 0:
cout<<\n0.MENU;
cout<<\n1.Getting BurstTime;
cout<<\n2.FirstComeFirstServed;
cout<<\n3.ShortestJobFirst;
cout<<\n4.RoundRobin;
cout<<\n5.EXIT;
break;
case 1:
c.Getdata();
break;
case 2:
cout<<FIRST COME FIRST SERVED SCHEDULING;
c.Fcfs();
break;
case 3:
cout<<SHORTEST JOB FIRST SCHEDULING;

c.Sjf();
break;
case 4:
cout<<ROUND ROBIN SCHEDULING;
c.RoundRobin();
break;
case 5:
break;
cout<<\nEnter your choice:;
cin>>ch;
getch();
}while(ch<5);
Input & Output:
0.MENU
1.Getting BurstTime
2.FirstComeFirstServed
3.ShortestJobFirst
4.RoundRobin
5.EXIT
Enter your choice:1
Enter the no of processes:2
Enter The BurstTime for Process p1=7
Enter The BurstTime for Process p2=4
Enter your choice:2
FIRST COME FIRST SERVED SCHEDULING
Burst time for process p1=7
Total Waiting Time=7
Average Waiting Time=3.5
Average Turnaround time=9
Enter your choice:3
SHORTEST JOB FIRST SCHEDULING

Average Waiting Time=2
Average turnaround time=7.5
Enter your choice:4
SHORTEST JOB FIRST SCHEDULING
Average Waiting Time=2
Average turnaround time=7.5
Enter your choice:5
July 4, 2009
Note: September 2017

M T W T F S S
If you are unable to see the 1 2 3
full code, click on the title of 4 5 6 7 8 9 10
the post 11 12 13 14 15 16 17
18 19 20 21 22 23 24
Click on the Previous Page link
25 26 27 28 29 30
to see the older posts.
Nov
8086ADCAlgorithmC
Use Mozilla, Flock or Google
Chrome Browser for better
view Recent Comments
Recent Posts
bhuvana on OOAD Unit
1 Notes
MOTOROLA SCHOLAR
PROGRAM : 2011-12
Working with Database in VB6.0 Shanthi on Working with
DDL Commands
without using Data Control
OOAD Unit 1 Notes B.E.
CSE (Anna University of ssmadhu on C Program
Technology, Tirunelveli) using UNIX System
Government Funded Project

for Students Roy Antony
Arnold on Implementation
C code for Travelling Sales of LRU Page Rep
Person Problem Branch and
Bound Approach rishi on Bresenhams
C Code for Knapsack Problem algorithm
using Backtracking Approach
Implementation of Randomized Twitter Updates
Quick Sort
RT @kryes: ,
Working with DDL Commands
" "
Printer Troubleshooting
? The Failure
Floppy Disk Troubleshooting
of a System= Success of a
Reading RAM size in a POST
Master Illusionist Video
routine using BIOS services
! https://t.co
Counting no. of occurance of a
1 hour ago
Letter in an array
RT @Buddhan_talks:
Example for Simple Constructor
and Destructor
https://t.co/lu0Ni0dFuB1 hour a
Working with Dialog Boxes
go
Working with Tree View Control
RT @SoonaaPaanaa:

Algorithms Analog Digital

Communication Computer https://t.co/WDV
Graphics Computer Pzj6rnR1 hour ago
Networks C RT @cpimspeak: CPIM strongly
Programming Data
condemns the brutal Murder of
Structure DBMS Internet

Progressive Journalist Shantanu
Programming Java Bhowmik by IPFT goons who

are directly patronize
Programming MicroProcessor
1 hour ago
Security News_Students NotesRT @kryes: CTRL + ALT + DEL
System Oracle Special Syllabus

-
Software Visual Basic !valuewalk.com/2017/09/b
6.0 Visual ill-g :)
Programming ctrl alt del

Pages
!
About Author 1 hour ago
Archives Email Subscription
November 2011 (1)
March 2011 (1) Enter your email address to

February 2011 (1) subscribe to this blog and
January 2011 (1) receive notifications of new
October 2010 (3) posts by email.
August 2010 (12) Join 89 other followers
February 2010 (2) Enter your email address
January 2010 (8) Get Notification
December 2009 (9) Create a free website or blog at
October 2009 (6) WordPress.com.
September 2009 (8)
August 2009 (43)
July 2009 (72)
Meta
Register
Log in
Entries RSS
Comments RSS
WordPress.com

Operating System - Lab Programs For Students of Anna University of Technology - Roy Brothers1

Hochgeladen von

Dokumentinformationen

Originaltitel

Copyright

Verfügbare Formate

Dieses Dokument teilen

Dokument teilen oder einbetten

Freigabeoptionen

Stufen Sie dieses Dokument als nützlich ein?

Sind diese Inhalte unangemessen?

Copyright:

Verfügbare Formate

Operating System - Lab Programs For Students of Anna University of Technology - Roy Brothers1

Hochgeladen von

Copyright:

Verfügbare Formate

9/22/2017 Operating System | Lab Programs for Students of Anna University of Technology - Roy Brothers

Simulation of Producer Consumer Problem

/* Producer Consumer problem */

cout<<Enter the Value to Produce:;

cout<<\n Buffer is Full\n;

cout<<Do U Want to Continue(1/2):;

cout<<\n Buffer is Empty\n;

cout<<\n Consumer Is Consuming The Items\n;

cout<<\n Do U Want to Continue(1/2):\n;

cout<<\nConsumer is in Idle No item to consume.\n;

cout<<\n The Buffer has:\n;

cout<<\t\t\tPRODUCER CONSUMER PRObLEM\n;

cout<<\nTHE OPERATIONS ARE\n;

cout<<\n1.PRODUCER WRITE\n2.CONSUMER GET\n3.BUFFER\n4.Exit\n;

cout<<\n Enter ur OPERATION:;

August 13, 2009

Implementation of Dekkers Algorithm

int turn=0, flag[2]={0,0},bal=0;

long int t1,t2;

printf(Iam entering %d,i);

printf(\n process: %d,l);

printf(the balance is %d,bal);

printf(Iam exiting: %d,i);

printf(After creation of first thread..);

August 13, 2009

Program for Bankers Algorithm

/*Implementation of Bankers Algorithm*/

printf(\n\n\t 2. New Request);

printf(\n\n\t 3. Safe State or Not);

printf(\n\n\t Enter ur choice : );

printf(\n\n\t Enter number of processes : );

printf(\n\n\t Enter the Number of Resources : );

printf(\n\n\t Enter the Available Resouces : );

printf(\n\n\t For Resource type %d : ,k);

printf(\n\n\t Enter Max and Allocated resources for P%d : ,i);

printf(\n\n\t Enter the Max of resource %d : ,j);

printf(\n\n\t Allocation of resource %d : ,j);

printf(\n\n\t Allocation should be less < or == max);

printf(\n\n\t Requesting process id : );

printf(\n\n\t Number of Request for resource %d : ,j);

printf(\n\n\t The Process Exceeds its Max Need: Terminated);

printf(\n\n\t Lack of Resourcess : Process State Wait);

printf(\n\n\t Granting leads to Unsafe state : );

printf(\n\n\t Request Denied );

printf(\n\n\t Request Committed );

printf(\n\n\t The System is in safe state );

printf(\n\n\t The System is Not in safe state );

printf(\n\n\t Number of processes : %d,n);

printf(\n\n\t Number of Resources : %d,nor);

printf(\n\n\t Pid \t Max \t Allocated \t Need );

printf(\n\n\t P%d : ,i);

printf(\n\n\t The system is in safe state);

printf(\n\n\t The system is Not in safe state);

July 31, 2009

CPU Scheduling Algorithms FCFS, SJF and Round Robin

//CPU Scheduling algorithms

//FCFS, Round Robin and Shortest Job First

//Getting no of processes and Burst time

cout<<Enter the no of processes:;

cout<<\nEnter The BurstTime for Process p<<i<<=;

//First come First served Algorithm

cout<<\nBurst time for process p<<i<<=;

cout<<\nTotal Waiting Time=<<twt;

/Implementation of Bankers Algorithm/