![]() ![]() This approach is used hen several blocks are freed or allocated simultaneously (if contiguous memory allocation is used) The first n-1 out of these are free while nth block contains addresses of another n free blocks.Į.g., Block 2 contains address of next 5 free blocks (3, 4, 5, 9, 10) out of which blocks 3, 4, 5 and 9 are free while block 10 contains the address of next five free blocks. Store addresses of n free blocks in the first free block ![]() Traversal is not easy and requires more time.in the above example, the pointer will point to first free block i.e., 2, Block 2 will contain the pointer to next free block i.e., 3 and so on Traverse each block to find out the next free block.Į.g. ![]()
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |