41. PRODUCER CONSUMER PROBLEM USING SEMAPHORE

//PRODUCER CONSUMER PROBLEM

#include<stdio.h>

#include<sys/types.h>

#include<sys/sem.h>

#include<stdlib.h>

#include<sys/shm.h>

#include<errno.h>

#include<sys/ipc.h>

void sem_acq(int);

void sem_rel(int);

int main()

{          int mutex,empty,full,shmid, n;

pid_t ret;

int in=-1,out=-1;

char *buffer;

char c[2];

25. BANKER'S ALGORITHM

//BANKER’S ALGORITHM
import java.util.*;
class Bankersalgorithm
{
void disp(int m,int n,int alloc[][],int max[][],int avble[],int need[][])
{
char res[]={'A','B','C','D','E','F','G','H','I','J'};
int i,j;
System.out.println("\n\tALLOCATION\tMAX\tNEED\tAVAILABLE");
System.out.println("\n\t\t");
for(i=0;i<4;i++)
{
for(j=0;j<m;j++)
System.out.print(" "+res[j]);
System.out.print("\t\t");
}

24. DYNAMIC PARTITIONING IN JAVA

import java.util.*;
class Dynamic
{
public static void main(String args[])
{
Scanner sc=new Scanner(System.in);
int mem,np,i,j,mp;
System.out.println("Enter the available memory:");
mem=sc.nextInt();
System.out.println("Enter no of processes:");
np=sc.nextInt();
i=0;
do

23. UNEQUAL FIXED PARTITIONING IN JAVA

import java.util.*;
class Variable
{
public static void main(String args[])
{
Scanner sc=new Scanner(System.in);
int size=0,nb,np,tfrag=0,i,temp=0,count,j,tnb,flag;
int psize[]=new int[10];
int frag[]=new int[10];
int bsize[]=new int[10];
int tempbsize[]=new int[10];
int btemp[]=new int[10];
int bno[]=new int[10];

22. EQUAL FIXED PARTITIONING IN JAVA

import java.util.*;
class FIXP
{
public static void main(String args[])
{
Scanner sc=new Scanner(System.in);
int size,bsize,nb,np,tfrag=0,i;
int psize[]=new int[10];
int frag[]=new int[10];
System.out.println("Enter the available memory:");
size=sc.nextInt();
System.out.println("Enter the memory size for fixed blocks:");
bsize=sc.nextInt();
nb=size/bsize;

12. SRT SCHEDULING IN JAVA

import java.util.*;
public class SRT {
public static void main(String args[]){
int table1[][] = new int[5][6];
int table2[][] = new int[5][6];
int total = 0;
boolean con[] = new boolean[5];
boolean fin[] = new boolean[5];
boolean lowest[] = new boolean[5];
Scanner sc = new Scanner(System.in);
for(int a=0;a<5;a++){

11. SJF SCHEDULING IN JAVA

import java.util.*;
class SJF
{
public static void main(String args[])
{
Scanner sc=new Scanner(System.in);
int pno[]=new int[10];
int bt[]=new int[10];
int wt[]=new int[10];
int tt[]=new int[10];
int tempwt[]=new int[10];
int tempno[]=new int[12];//stores process no temporary
int temp[]=new int[12];//represent Gantt chart
int n,i,j,ptr,t,t2;

10.FCFS SCHEDULING IN JAVA

import java.util.*;
class FCFS
{
public static void main(String args[])
{
Scanner in=new Scanner(System.in);
int p;
float t1=0,t2=0;
System.out.println("Enter number of processes");
p=in.nextInt();
int bt[]=new int[p];