Skip to main content

Dynamic and Static Memory Allocation in C Programming


Memory is allocated to the respective data variables (of any type of data structure) in two manners that are dynamic and static.
The memory if it allocated to the variables declared, during the compilation process is called as a static memory allocation whereas the allocated to the variables, during the execution of the program is called as dynamic memory allocation.
Once the memory is allocated statically it cannot be altered during the execution of the program. So the programmer may need the memory that is to be allocated as per the request during the program execution. So there comes dynamic memory allocation. Dynamic memory allocation is possible only when pointers are used. A pointer variable is used to store the base address of dynamically allocated memory.

      void main()
          {
            int array[20];
            . . . . .
         }

In this case when the program is compiled, main memory is allocated to the array. So it is static memory allocation. Once the memory is allocated to “array”, it cannot be altered during execution. Here if the programmer wishes to store more numbers of elements in the array it is not possible. He can change the size of array, only before compilation. Now if he is decides the size of array as 50 and if he is stored only few elements then there is wastage of main memory. Usually if the elements that are to be stored in an array is not decided before compilation and it is decided during the execution of the program then the static memory allocation has a major drawback.


In the order to overcome the above-mentioned problem now programmer can request the required memory during the execution of program using pointer variable. It is dynamic memory allocation.
For example, consider the following program segment:-
      
void main()
          {
            int *arr, size;
            /* user can get size of the array during execution */
           arr= (int *) malloc (size of (int) * size);
            . . . .
         }

In this case the dynamic memory is allocated by the malloc function during the execution of program and the base is returned is stored in a pointer variable arr. With the help of arr now it is possible to refer as many elements as user wishes during the execution of the program. That is the major concept of dynamic memory allocation.

Comments

Popular posts from this blog

difference between structure and union in C Language

In c language article we will see the difference between union and structure. Both are the user define datatype in c language. See the table which is mentioned below: ASP.NET Video Tutorial Series Structure Union1.The keywordstruct is used to define a structure 1. The keyword union is used to define a union. 2. When a variable is associated with a structure, the compiler allocates the memory for each member. The size of structure is greater than or equal to the sum ofsizes of its members. The smaller members may end with unused slack bytes. 2. When a variable is associated with a union, thecompiler allocates thememory by considering the size of the largest memory. So, size of union is equal to the size of largest member. 3. Each member within a structure is assigned unique storage area of location. 3. Memory allocated is shared by individual members of union. 4. The address of each member will be in ascending order This indicates that memory for each member will start at different offset v…

Difference between Linear search and Binary Search in c language

SQL Video Channel : Download all SQL Video



Binary Search Linear Search Works only on sorted items. such as  1,2,3,4,5,6  etc
Works on sorted as well as unsorted items. 12,4,5,3,2,1 etc Very efficient if the items are sorted Very efficient if the items are less and present in the beginning of the list. such as Suppose your list items are : 12,3,4,5,1 and you want to search 12 number then you get beginning in the list. Works well with arrays and not on linked lists. Works with arrays and linked lists.
Number of comparisons are less More number of comparisons are required if the items are present in the later part of the array or its elements are more.

Memory representation of Linked List Data Structures in C Language

Memory representation of Linked List

             In memory the linked list is stored in scattered cells (locations).The memory for each node is allocated dynamically means as and when required. So the Linked List can increase as per the user wish and the size is not fixed, it can vary.

               Suppose first node of linked list is allocated with an address 1008. Its graphical representation looks like the figure shown below:


      Suppose next node is allocated at an address 506, so the list becomes,



  Suppose next node is allocated with an address with an address 10,s the list become,


The other way to represent the linked list is as shown below:




 In the above representation the data stored in the linked list is “INDIA”, the information part of each node contains one character. The external pointer root points to first node’s address 1005. The link part of the node containing information I contains 1007, the address of next node. The last node …