Java program for Safe Sequence (Banker's Algorithm).

- 
//Java program for safe sequence of Banker's algorithm.


import java.util.*;
class SafeAlgo
{
 public static void main(String args[])
 {
  Scanner sc=new Scanner(System.in);
  System.out.println("Enter number of processes:");
  int n=sc.nextInt();
  int p[]=new int[n];
  int flag[]=new int[n];
  System.out.println("Enter number of resource variables");
  int m=sc.nextInt();
  
  int max[][]=new int[n][m];
  int allo[][]=new int[n][m];
  int need[][]=new int[n][m];
  int avail[]=new int[m];
  for(int x=0;x<n;x++)
  {
   System.out.println("Enter process number:");
   p[x]=sc.nextInt();
   flag[x]=0;
   for(int y=0;y<m;y++)
   {
    System.out.println("Max -> P"+p[x]+" ->"+y+" :");
    max[x][y]=sc.nextInt();    
    
   }
   for(int y=0;y<m;y++)
   {
    System.out.println("Allocation -> P"+p[x]+" ->"+y+" :");
    allo[x][y]=sc.nextInt();
    need[x][y]=max[x][y]-allo[x][y];
   }
  }
  System.out.println("Enter available resources:");
  for(int y=0;y<m;y++)
   avail[y]=sc.nextInt();
  
  System.out.println("Process\tMax\tAllocation\tNeed");
  for(int x=0;x<n;x++)
  {
   System.out.print("P"+p[x]+"\t");
   for(int y=0;y<m;y++)
    System.out.print(max[x][y]+" ");
   System.out.print("\t");
   for(int y=0;y<m;y++)
    System.out.print(allo[x][y]+" ");
   System.out.print("\t\t");
   for(int y=0;y<m;y++)
    System.out.print(need[x][y]+" ");
   System.out.println();
  }
  
  int count=0;
  while(count<=n)
  {
   
    for(int x=0;x<n;x++)
    {
     if(flag[x]==0)
     {
     int f=0;
     for(int y=0;y<m;y++)
     {      
      if(avail[y]<need[x][y])
      {
       f=1;
       break;
      }
     }
       
     if(f==0)
     {
      flag[x]=1;
      for(int y=0;y<m;y++)
      {
       avail[y]+=allo[x][y];
      }
      System.out.println("P"+p[x]);
      count++;
     }
     }
    }
   }
  }
 }


































Comments











Post a Comment






























Popular posts from this blog









Priority Scheduling Algorithm Java Program.






-















 import java.util.Scanner;   public class priority{              public static void main(String args[]) {             Scanner s = new Scanner(System.in);               int x,n,p[],pp[],bt[],w[],t[],awt,atat,i;               p = new int[10];             pp = new int[10];             bt = new int[10];             w = new int[10];             t = new int[10];      //n is number of process    //p is process    //pp is process priority    //bt is process burst time    //w is wait time    // t is turnaround time    //awt is average waiting time    //atat is average turnaround time        System.out.print("Enter the number of process : ");    n = s.nextInt();     System.out.print("\n\t Enter burst time : time priorities \n");      for(i=0;i<n;i++)     {        System.out.print("\nProcess["+(i+1)+"]:");       bt[i] = s.nextInt();       pp[i] = s.nextInt();       p[i]=i+1;     }   //sorting on the basis of priority   for(i=0;i<n-1;i++)    {      for...








Read more










Implement UNIX system calls like ps, fork, join, exec family, and wait for process management (use shell script/ Java/ C programming). 






-















//A small example to show how to use execvp() function in C. We will have two .C files , EXEC.c and execDemo.c and we will replace the execDemo.c with EXEC.c by calling execvp() function in execDemo.c . //EXEC.c  #include<stdio.h>  #include<unistd.h>  int main()   {        int i;       printf("This  is EXEC.c, called by execvp() ");        printf("\n");       return 0;   }  Now,create an executable file of EXEC.c using command  gcc EXEC.c -o EXEC //execDemo.c #include<stdio.h> #include<stdlib.h>  #include<unistd.h>  int main()  {     //A null terminated array of character      //pointers       char *args[]={"./EXEC",NULL};       execvp(args[0],args);     /*All statements are ignored after execvp() call as this whole process(execDemo.c) is replaced by ...








Read more










Implement a class CppArray which is identical to a one-dimensional C++ array (i.e., the index set is a set of consecutive integers starting at 0) except for the following : 1. It performs range checking. 2.It allows one to be assigned to another array through the use of assignment operator. 3.It supports a function that returns the size of the array.






-















 #include<iostream> #include<math.h> using namespace std; class array {      int a[10],b[10],i,j,temp,n;           public:             void accept();             void display();             void range();             void sort();             void exchange();             int size(); }; void array::accept() {     cout<<"How many Elements you want to insert into the array=\n";     cin>>n;     cout<<"Enter the array Elements=\n";     for(i=0;i<n;i++)        {             cout<<...








Read more