Skip to main content

Dynamic Memory Allocation in C programming


             The process of allocating and freeing memory at run time is known as Dynamic Memory Allocation. This conserves the memory required by the program and returns this valuable resource to the system once the use of reserved space is utilized.
         Since an array name is actually a pointer to the first element within the array, it is possible to define the array as a pointer variable rather than as a conventional array. While defining conventional array, system reserves fixed block of memory at the beginning of program execution which is inefficient but this does not occur if the array is represented in terms of a pointer variable. The use of a pointer variable to represent an array requires some type of initial memory assignment before the array elements are processed. This is known as DMA.
                There are four library functions malloc(), calloc(), free() and realloc() for memory management. These functions are defined within header file stdlib.h and alloc.h .They are described as follow.


 i) malloc()
       It allocates requested size of bytes and returns a pointer to the first byte of the allocated space. Its syntax is as
      ptr=(data_type*) malloc(size_of_block);
   Here, ptr is a pointer of type data_type. The malloc() returns a pointer to an area of memory with size size_of_block.
  An example:
              x=(int*) malloc(100*sizeof(int));
A memory space equivalent to “100 times the size of a integer (i.e. 100*2bytes =200 bytes ” bytes is reserved and the address of the first byte of the memory allocated  is assigned to the pointer x of type int.

ii) calloc()
        It allocates space for an array of elements, initializes them to zero and then returns a pointer to the memory. The function calloc()  allocates multiple blocks of storage, each of the same size and then sets all bytes to zero. Thus, it is normally used for requesting memory space at run time for storing derived data types such as arrays and structure. Its syntax is
         ptr=(data_type*) calloc(no_of_blocks, size_of_each_block);
An example:
              x=(int*) calloc(5, 10*sizeof(int));
The above statement allocates contiguous space for 5 blocks, each of size 20 bytes i.e. we can store 5 arrays, each of 10 elements of integer types.

iii) free();
    This built-in function frees previously allocated space. The memory dynamically allocated is not returned to the system until the programmer returns the memory explicitly. This can be done using free() function. Thus, this function is used to release the space when it is not required. Its syntax is
      free(ptr);
Here, ptr is a pointer to a memory block which has already been created by malloc() or calloc() function.

iv) realloc();

      This function is used to modify the size of previously allocated space. Sometimes, the previously allocated memory is not sufficient and we need additional space and sometime the allocated memory is much larger than necessary. In both situations, we can change the memory size already allocated with the help of function realloc(). Its syntax is as
    If the original allocation id done by the statement
             ptr=malloc(size);
  then, reallocation of space may be done by the statement
              ptr=realloc(ptr,newsize);
    This function allocates a new memory space of size newsize to the pointer variable ptr and returns a pointer to the first byte of the new memory block.

An example related to realloc()
        
   #include<stdlib.h>
void main()
 {
 char *name;
 name=(char*)malloc(10);
 strcpy(name,"Ram Datta");
 printf("\n Name=%s",name);
 name=(char*)realloc(name,20);
 strcpy(name,"Bhatta Ram Datta abc ");
 printf("\n Name=%s",name);
 getch();
 }

Another Example: 
                   Write a program to read number of students and their marks and display the average of entered marks. Use array as pointer instead of conventional array to represent marks of different students.       
#include<stdlib.h>
     void main( )
           {
            int s,i;
            float *p,sum=0,avg;
            clrscr();
            printf("\nHow many students are there?\n");
            scanf("%d",&s);
            printf("\n Enter marks of each students\n");
            p=(float*)malloc(s*sizeof(float));
              for(i=0;i<s;i++)
                {
                  scanf("%f",p+i);
                  sum+=*(p+i);
                }
              avg=sum/s;
            printf("\n The average marks is\t%f",avg);
            free(p);
            getch();
       }

Comments

Popular posts from this blog

Object Oriented Programming

Object Oriented Programming Programming paradigm that represents the concept of "objects" that have data fields (attributes that describe the object) and associated procedures known as methods Programming methodology based on objects, instead of just functions and procedures Focuses on data rather than process As individual objects can be modified without affecting other aspects of the program, it is easier for programmers to structure and organize software programs Easier to update and change programs written in object-oriented languages Simula was the first object oriented programming language Eg: C++, Java, etc. Features of OOPS Objects Referred as instance of class Basic run-time entities in an object-oriented system a person, a place, a bank account, a table of data, etc can be an object They occupy space in memory that keeps its state  Each object contains data and code to manipulate the data  Classes Blue print or prototype  which defi

How structure elements are stored?

  The elements of a structure are always stored in contiguous memory locations. This can be illustrated as void main() {     struct student      {      int roll;      float marks;      char remarks;   };   struct student st={200,60.5,'P'};   printf("\nAddress of roll=%u",&st.roll);   printf("\nAddress of marks=%u",&st.marks);   printf("\nAddress of remarks=%u",&st.remarks);   getch(); } Output: Address of roll=65518 Address of marks=65520 Address of remarks=65524                  st.roll               st.marks                          st.remarks 200 60.5 ‘P’               65518             65520                               65524           

How containership is different than inheritance ?

               Inheritance is the mechanism of deriving properties of one class into another. While containership is mechanism in which one class contain objects of other classes as its member.                     class alpha{_ _ _ _ _ };                     class beta{_ _ _ _ _ };                      class gamma                      {                         alpha a;                         beta b;                       _ _ _ _ _ };            All objects of gamma class will contain the objects a and b, this kind of relationship is called containership or nesting.