Scribd Logo
Upload

Welcome to Scribd!

  • 20 views

    Memory Management 21bce1856

    Uploaded by

    Manav Israni
    The document contains C code implementations of three memory allocation algorithms: First Fit, Best Fit, and Worst Fit. First Fit allocates processes to the first block that fits. Best Fit allocates to the block with the smallest remaining space. Worst Fit allocates to the block leaving the largest remaining fragment. Each algorithm includes code to input block and process sizes, perform allocation, and output allocation details.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd

    Memory Management 21bce1856

    Uploaded by

    Manav Israni
    20 views5 pages
    The document contains C code implementations of three memory allocation algorithms: First Fit, Best Fit, and Worst Fit. First Fit allocates processes to the first block that fits. Best Fit allocates to the block with the smallest remaining space. Worst Fit allocates to the block leaving the largest remaining fragment. Each algorithm includes code to input block and process sizes, perform allocation, and output allocation details.

    Original Title

    memory_management_21bce1856

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    The document contains C code implementations of three memory allocation algorithms: First Fit, Best Fit, and Worst Fit. First Fit allocates processes to the first block that fits. Best Fit allocates to the block with the smallest remaining space. Worst Fit allocates to the block leaving the largest remaining fragment. Each algorithm includes code to input block and process sizes, perform allocation, and output allocation details.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Download as docx, pdf, or txt
    20 views5 pages

    Memory Management 21bce1856

    Uploaded by

    Manav Israni
    The document contains C code implementations of three memory allocation algorithms: First Fit, Best Fit, and Worst Fit. First Fit allocates processes to the first block that fits. Best Fit allocates to the block with the smallest remaining space. Worst Fit allocates to the block leaving the largest remaining fragment. Each algorithm includes code to input block and process sizes, perform allocation, and output allocation details.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Download as docx, pdf, or txt
    You are on page 1of 5

    OS Lab Assignment

    Name: Manav Israni


    Reg no: 21BCE1856

    First Fit:
    #include<stdio.h>

    void main()
    {
    int bsize[10], psize[10], bno, pno, flags[10], allocation[10], i, j;

    for(i = 0; i < 10; i++)


    {
    flags[i] = 0;
    allocation[i] = -1;
    }
    printf("Enter no. of blocks: ");
    scanf("%d", &bno);
    printf("\nEnter size of each block: ");
    for(i = 0; i < bno; i++)
    scanf("%d", &bsize[i]);

    printf("\nEnter no. of processes: ");


    scanf("%d", &pno);
    printf("\nEnter size of each process: ");
    for(i = 0; i < pno; i++)
    scanf("%d", &psize[i]);
    for(i = 0; i < pno; i++) //allocation as per first fit
    for(j = 0; j < bno; j++)
    if(flags[j] == 0 && bsize[j] >= psize[i])
    {
    allocation[j] = i;
    flags[j] = 1;
    break;
    }
    //display allocation details
    printf("\nBlock no.\tsize\t\tprocess no.\t\tsize");
    for(i = 0; i < bno; i++)
    {
    printf("\n%d\t\t%d\t\t", i+1, bsize[i]);
    if(flags[i] == 1)
    printf("%d\t\t\t%d",allocation[i]+1,psize[allocation[i]]);
    else
    printf("Not allocated");
    }
    }
    Best Fit:
    #include<stdio.h>

    void main()
    {
    int fragment[20],b[20],p[20],i,j,nb,np,temp,lowest=9999;
    static int barray[20],parray[20];
    printf("\nEnter the number of blocks:");
    scanf("%d",&nb);
    printf("Enter the number of processes:");
    scanf("%d",&np);
    printf("\nEnter the size of the blocks:-\n");
    for(i=1;i<=nb;i++)
    {
    printf("Block no.%d:",i);
    scanf("%d",&b[i]);
    }
    printf("\nEnter the size of the processes :-\n");
    for(i=1;i<=np;i++)
    {
    printf("Process no.%d:",i);
    scanf("%d",&p[i]);
    }
    for(i=1;i<=np;i++)
    {
    for(j=1;j<=nb;j++)
    {
    if(barray[j]!=1)
    {
    temp=b[j]-p[i];
    if(temp>=0)
    if(lowest>temp)
    {
    parray[i]=j;
    lowest=temp;
    }
    }
    }
    fragment[i]=lowest;
    barray[parray[i]]=1;
    lowest=10000;
    }
    printf("\nProcess_no\tProcess_size\tBlock_no\tBlock_size\tFragment");
    for(i=1;i<=np && parray[i]!=0;i++)
    printf("\n%d\t\t%d\t\t%d\t\t%d\t\t%d",i,p[i],parray[i],b[parray[i]],fragment[i]);
    }

    Worst Fit:
    #include <stdio.h>
    #define MAX 25

    int main()
    {
    int frag[MAX],b[MAX],f[MAX],i,j,nb,nf,temp;
    static int bf[MAX],ff[MAX];

    printf("\nEnter the number of blocks:");


    scanf("%d",&nb);

    printf("Enter the number of processes:");


    scanf("%d",&nf);

    printf("\nEnter the size of the blocks:-\n");


    for(i=1;i<=nb;i++)
    {
    printf("Block %d:",i);
    scanf("%d",&b[i]);
    }

    printf("Enter the size of the processes :-\n");


    for(i=1;i<=nf;i++)
    {
    printf("File %d:",i);
    scanf("%d",&f[i]);
    }

    for(i=1;i<=nf;i++)
    {
    for(j=1;j<=nb;j++)
    {
    if(bf[j]!=1)
    {
    temp=b[j]-f[i];

    if(temp>=0)
    {
    ff[i]=j;
    break;
    }
    }
    }

    frag[i]=temp;
    bf[ff[i]]=1;

    printf("\nProcess_no:\tProcess_size :\tBlock_no:\tBlock_size:\tFragement");
    for(i=1;i<=nf;i++)
    printf("\n%d\t\t%d\t\t%d\t\t%d\t\t%d",i,f[i],ff[i],b[ff[i]],frag[i]);

    getchar();
    return 0;
    }

    You might also like