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;