First Fit, Best Fit and Worst Fit Example
Vložit
- čas přidán 8. 09. 2024
- This video describes three methods of Contiguous Memory Allocation techniques. A numerical example is used to discuss First Fit, Best Fit and Worst Fit methods to find the optimal allocation method for the same.
P2 has to allocate in the 288 in the first fit but here not allocated why?
we do not allocate processes twice to memory partitions even though we will have memory partition that is sufficient enough to fit a process for the 2nd time
Good explanation mam thanks for this video
Nice explanation 😊
how to find suitable algorithm with minimum fragmentation.
6
Reply
Video is useful 👍
Great Explanation
you are a legend!
thank you icon
at 03:57 dont you think that the second hole had 288kb left and it was sufficient enough to store 112 kb of P3, why did it go to the 3rd hole instead of 2nd hole ????????
according to allocation methods, we cant allocate a hole to a process, we have to allocate memory partition to a process that is big enough to hold a process
Mam 288 kb kaise aaya direct 212 ko 500 m nahi put kar sakte kya
Very nice 👍
In first fit, why you put p3 in the third hole (200) position, when there is 288 unused free space is there in the second hole (500)??. It could fit the process and it comes first
I too have the samw doubt can u plz explain mam
according to allocation methods, we cant allocate a hole to a process, we have to allocate memory partition to a process that is big enough to hold a process
@@premaakkasaligar5800 That's for static allocation I think but for this partition Algorithms they deals with dynamic partitioning. Therefore the 288 should be used instead. That's what I think actually.
Same doubt
@@premaakkasaligar5800288 hole so must allocate
Tq madam 🥳👍