Question

Programming language

Q2. For each of the Storage Binding approaches below give a short description Storage Binding Static Stack-Dynamic Explicit Heap-Dynamic mic Implicit Heap Dyna

Answer 1

Before we go to detailed explanation of storage binding techniques, let us have some knowledge on terminology used to explain the storage binding techniques.

Run-time: It is the time when program is executed.

Compile-time:It is the time when program is compiled. For example object file is created and linking and loading is done.

Memory complexity is a measure to analyse algorithm and programming techniques.

There are various kinds of storage management techniques like

Static Allocation:

In Static storage allocation technique, memory is allocated at the time of compilation and the every variable location is fixed and no changes to the memory allocation is made while compile time.

In this allocation and binding were done at compile time.

In fortran static storage allocation was implemented, where all parameters are passed by reference and no parameters are passed by value.

As the storage is considered as important factor of run-time of programme, initially static storage allocation method was chosen.

Stack – Dynamic allocation:

In dynamic allocation memory is allocated at run time. In this technique a stack of memory is maintained and the allocation is done in stack and deallocation is like pop technique in stack.

If a function was called all the memory of the function is allocated on the stack and it is called the activation record. This kinda of storage consists of return values and address space allocated.

This is in c and c++ of static arrays.

Allocation is operated by the top pointer of the stack and deallocation is popping by modifying the top pointer.

Flexibility is the main advantage of this techniques

It costs high and dynamic type binding must be implemented by the interpreters which consume the more execution time.

This was first introduced in 1960 and algol 60 introduced by peter naur.

Explicit Heap dynamic allocation:

In this it consists of highly disorganized heap and the variable allocated and de-allocated at compile time.

Only a system call or sub program can create the explicit heap dynamic variable .

The organization of cells is highly disorganized.

Allocation and deallocation of heap is only done through reference or pointer variables.

Tress or linked lists are implemented using explicit heap dynamic variable.

It has disadvantage in difficulty in handling pointers and reference of variables.

It costs high and the space complexity can never be estimated as it is dynamic.

Implicit Heap-dyanmic Variables:

These are bounded to the heap and it has high flexibility where assigned values are bounded to heap storage.

These are adapted accordingly where attributes of the variable are bound .

It has the highest rate of flexibility.

Disadvantage is range maintenance like in array and error detection is difficult.