Forums Assignment Help What are the different Dynamic Storage-Allocation methods?

Viewing 2 posts - 1 through 2 (of 2 total)
  • Author
    Posts
  • #1003
    ahwriter
    Participant

    What are the different Dynamic Storage-Allocation methods?

    #9567
    Aakanksha
    Participant

    How to satisfy a request of size n from a list of free holes?

    First-fit: Allocate the first hole that is big enough.

    Best-fit: Allocate the smallest hole that is big enough; must search entire list, unless ordered by size. It produces the smallest leftover hole.

    Worst-fit: Allocate the largest hole; must also search entire list. Produces the largest left over hole. First-fit and best-fit are better than worst-fit in terms of speed and storage utilization.

Viewing 2 posts - 1 through 2 (of 2 total)
  • You must be logged in to reply to this topic.