Scribd Logo
Upload

Welcome to Scribd!

  • First Fit

    Uploaded by

    Srimathi tj
    20 views3 pages
    This C program implements the first-fit algorithm for memory allocation. It initializes 6 memory partitions with various sizes totaling 1500 KB and 5 processes with size requirements. It then iterates through the processes and finds the first partition that can accommodate each process' size, prints the allocation, and updates the remaining space in the partition. Any processes that do not fit in a partition are noted. Finally, it prints the final sizes of the partitions.

    Original Description:

    Original Title

    FIRST FIT

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This C program implements the first-fit algorithm for memory allocation. It initializes 6 memory partitions with various sizes totaling 1500 KB and 5 processes with size requirements. It then iterates through the processes and finds the first partition that can accommodate each process' size, prints the allocation, and updates the remaining space in the partition. Any processes that do not fit in a partition are noted. Finally, it prints the final sizes of the partitions.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    20 views3 pages

    First Fit

    Uploaded by

    Srimathi tj
    This C program implements the first-fit algorithm for memory allocation. It initializes 6 memory partitions with various sizes totaling 1500 KB and 5 processes with size requirements. It then iterates through the processes and finds the first partition that can accommodate each process' size, prints the allocation, and updates the remaining space in the partition. Any processes that do not fit in a partition are noted. Finally, it prints the final sizes of the partitions.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 3

    FIRST FIT

    #include <stdio.h>

    #define NUM_PARTITIONS 6

    int main()

    int partitions[NUM_PARTITIONS] = {300, 600, 350, 200, 750, 125};

    int num_processes = 5;

    int processes[] = {115, 500, 358, 200, 375};

    printf("Initial memory partitions:\n");

    for (int i = 0; i < NUM_PARTITIONS; i++)

    printf("%d KB ", partitions[i]);

    printf("\n");

    for (int i = 0; i < num_processes; i++)

    int j;

    for (j = 0; j < NUM_PARTITIONS; j++)

    if (processes[i] <= partitions[j])

    printf("Process %d (size %d KB) allocated to partition %d (size %d KB)\n",


    i + 1, processes[i], j + 1, partitions[j]);

    partitions[j] -= processes[i];

    break;

    if (j == NUM_PARTITIONS)

    printf("Process %d (size %d KB) cannot be allocated\n", i + 1, processes[i]);

    printf("Final memory partitions:\n");

    for (int i = 0; i < NUM_PARTITIONS; i++)

    printf("%d KB ", partitions[i]);

    printf("\n");

    return 0;

    }
    OUTPUT:

    You might also like