Q6.1. Study materials related with these allocations and list a couple of advantages and disadvantages for each of these types of allocation. Provide your answers in the following table. The following provides a list of items (key words/phrases, short sentences) with each starting with an item list number. Use these numbers as your answers by placing the item list numbers on the right columns. (The items may not be used repeatedly). 1. efficiency: direct addressing, no run-time overhead for allocation & deallocation. 2. Inefficient, because all attributes are dynamic. - Loss of error detection by compiler. 3. Overhead of allocation and deallocation. - Subprograms cannot be history sensitive. 4. history-sensitive: maintain values between successive function calls. 5. lack of flexibility (no recursion). 6. Inefficient references (indirect addressing). 7. Allows recursion. 8. Enable the specification and construction of dynamic structures (linked lists & trees) that grow and shrink during the execution. 9. Unreliable: difficult to use pointers & references correctly. 10. Storage cannot be shared among variables. 11. Conserves storage. 12. Flexibility. 13. Inefficient: heap management is costly and complicated. Advantages Disadvantages Memory allocations Static allocation Stack-based allocation Heap-based allocation 4