linked list - Counting memory blocks -

This is a question of homework from the compiler design course. I just need to explain some parts of the question.

It is claimed that the returning block to the standard memory manager will require a lot of administration

in that context on which to block it Keep the number of busy records, and why to return that block? Refers to speaking about related lists.

Answers have been answered in response to this question:

How can you find this counter from the pointer to the record and how do you get the indicator by which to return the block for?

Coming from a background, can someone explain to me:

1. What is a block?
2. What does the counter do?
3. Have a busy record?

Provides the context of such documents that are due to what happens during this counting phase. Diagrams will be helpful.

Thank you.

I think it can help if I change some words, better way To explain what I'm guessing.

If you have a page of memory, then we can say that a page is 8k in size. This is the minimum size assigned by the memory manager.

You have 10 requests per 100 bytes, so there are 1000 bytes at different locations on the page.

The counter is 10, but how do you know what is actually free, or has already been allocated, because 10 can not be compliant with requests because there are already other requests made gone.

, we have 10 busy records.

Now, you will need to come up with your own answers in the answer sheet, but hopefully it can be simple by looking at an example.