Dynamic Memory Allocation


Dynamic memory allocation in programming refers to the ability to allocate memory for variables or data structures during the runtime of a program. Unlike static memory allocation, where memory is assigned at compile time, dynamic memory allocation allows the program to request and release memory as needed while the program is running.

In languages like C, C++, and similar low-level languages, dynamic memory allocation is often performed using functions provided by the standard library, such as malloc, calloc, realloc, and free in the <stdlib.h> header.

Here's an overview of these functions with examples:

malloc (Memory Allocation):
Stands for "memory allocation."
Allocates a specified number of bytes of memory.
Returns a pointer to the first byte of the allocated memory.

#include <stdlib.h>
main()
{
int *arr;
int size = 5;

arr = (int*)malloc(size * sizeof(int));

if (arr == NULL) {
    // Memory allocation failed
    printf("Memory allocation failed.\n");
} else {
    // Memory allocation successful
    // Use the 'arr' pointer to access the allocated memory
    // Don't forget to free the memory when done
    free(arr);
}
}

calloc (Contiguous Allocation):
Stands for "contiguous allocation."
Allocates a specified number of blocks of memory, each with a specified number of bytes.
Initializes the allocated memory to zero.

#include <stdlib.h>
main()
{
int *arr;
int size = 5;

arr = (int*)calloc(size, sizeof(int));

if (arr == NULL) {
    // Memory allocation failed
    printf("Memory allocation failed.\n");
} else {
    // Memory allocation successful
    // Use the 'arr' pointer to access the allocated memory
    // Don't forget to free the memory when done
    free(arr);
}
}

realloc (Re-Allocation):
Stands for "re-allocation."
Changes the size of the previously allocated memory block.
Returns a pointer to the beginning of the reallocated memory block.

#include <stdlib.h>
main()
{
int *arr;
int size = 5;

arr = (int*)malloc(size * sizeof(int));

// Code to use the allocated memory

// Need more space
size = 10;
arr = (int*)realloc(arr, size * sizeof(int));

if (arr == NULL) {
    // Memory reallocation failed
    printf("Memory reallocation failed.\n");
} else {
    // Memory reallocation successful
    // Use the 'arr' pointer to access the reallocated memory
    // Don't forget to free the memory when done
    free(arr);
}
}

free:
Deallocates the memory previously allocated by malloc, calloc, or realloc.
It's essential to free dynamically allocated memory to prevent memory leaks.

#include <stdlib.h>
main()
{
int *arr;
int size = 5;

arr = (int*)malloc(size * sizeof(int));

// Code to use the allocated memory

// Free the allocated memory when done
free(arr);
}
Remember to check if memory allocation was successful by verifying if the returned pointer is NULL. Additionally, always free the allocated memory when it is no longer needed to avoid memory leaks in your program.

Dynamic memory allocation is particularly useful when the size of data structures is not known at compile time or when memory needs to be managed more flexibly. However, it requires careful handling to avoid memory leaks or accessing memory that has already been freed (dangling pointers). Memory allocated dynamically should be released using free when it's no longer needed to avoid memory leaks.

Comments

Post a Comment

Popular posts from this blog

Data Structures CST 201 KTU Third Semester Syllabus Notes and Solved Questions- Dr Binu V P 984739060

Dr BinuV P -About Me About The Course Syllabus Data Structures Lab CSL 201 ( Do the Programs to Understand the Concept Well) Model Question Paper CST 201 Data Structures University Question Papers CST 201 Data Structures Module-1 Basic Concepts of Data Structures 1.1 System Life Cycle 1.2 Algorithms , Performance Analysis  1.3 Space Complexity, Time Complexity  1.4 Asymptotic Analysis and Notations  1.5 Complexity Calculation of Simple Algorithms Module-2 Arrays and Searching  2.1 Polynomial representation using Arrays  2.2 Sparse matrix  2.3 Stacks  2.4 Queues 2.5 Circular Queues  2.6 Priority Queues 2.7 Double Ended Queues 2.8 Infix to  Postfix Conversion  2.9  Evaluation of Postfix Expression 2.10 Linear Search  2.11 Binary Search Module-3 Linked List and Memory Management 3.1 Linked List -Self Referential Structures  3.2 Dynamic Memory Allocation  3.3 Singly Linked List-Operations on Linked List 3.4 Doubly Linked List 3.5 Circular Linked List  3.6 Stack using Linked List  3.7 Queue
Read more

Stack

Image
A stack is a fundamental data structure in computer science and programming that follows the Last-In, First-Out (LIFO) principle . It is named "stack" because it resembles a stack of items, like a stack of plates or books, where you can only add or remove items from the top. Stacks are used for various purposes in programming and are essential in many algorithms and applications. Let's delve into the details of stacks: Key Operations:  A stack typically supports two primary operations: Push: This operation adds an element to the top of the stack. It is analogous to placing an item on top of the stack. Pop: This operation removes and returns the top element of the stack. It is like taking the top item off the stack. Additionally, stacks often provide the following operations: Peek (or Top): This operation retrieves the top element without removing it. It allows you to examine the top item without modifying the stack. IsEmpty: This operation checks if the stack is empty.
Read more

Quick Sort

Quick sort is a popular sorting algorithm that uses a divide-and-conquer strategy to efficiently sort an array or list. It works by selecting a "pivot" element from the array and partitioning the other elements into two sub-arrays, according to whether they are less than or greater than the pivot. The sub-arrays are then recursively sorted. Here's a detailed algorithm for the Quick Sort algorithm: Algorithm: Quick Sort 1.Choose a pivot element from the array. This can be done in various ways, such as selecting the first element, the last element, or a random element. The choice of the pivot can affect the algorithm's performance. 2,Partition the array into two sub-arrays:     Elements less than the pivot (left sub-array).     Elements greater than the pivot (right sub-array). 3.Recursively apply the Quick Sort algorithm to the left and right sub-arrays. 4.Combine the sorted left sub-array, pivot, and sorted right sub-array to obtain the final sorted ar
Read more