1) Allocation of the memory at the run time ( i.e. during the execution of the program ) is known as Dynamic memory allocation.
2) Advantage of this is that memory can be allocated any time during the execution of the program as per the requirement which is not possible in static memory allocation .
3) Unlike array it saves the wastage of memory because if allocated memory not required it may be released.
4) Dynamic memory allocation can be handle by standard library function of memory management which are given below:-
(i) Malloc():- It is used to allocated requested bytes of memory during the program and return the void pointer .
Syntax:- If the required size of memory is not available then it return NULL.
Example:- (int *) malloc (10 * sizeof( int) )
(ii) Calloc():- It takes two argument first for number of blocks and second for size of each block and allocates the memory accordingly .It initialize the each bytes to zero and returns the void pointer to the first byte of the allocated memory .
If the required size of memory is unavailable then it return NULL.
Syntax:-
(iii) free():-
It releases the already allocated memory.
Syntax:- free( Ptr_name )
(iv) realloc():- realloc function is use to resize the already allocated memory dynamically . It is used when we want to increase or reduce the size of already allocated memory.
Recommended Post:
Key points:-
- How to set limit in the floating value in python
- What is boolean data type
- How to print any character without using format specifier
- How to check that given number is power of 2 or not
- How to fix limit in double and floating numbers after dot (.) in c++
- How to print a double or floating point number in scientific notation and fixed notation
- How to take input a string in c
- How to reduce the execution time of program in c++.
Cracking the coding interview:-
Array and string:-
Tree and graph:-
Hackerearth Problems:-
- Very Cool numbers | Hacker earth solution
- Vowel Recognition | Hackerearth practice problem solution
- Birthday party | Hacker earth solution
- Most frequent | hacker earth problem solution
- program to find symetric difference of two sets
- cost of balloons | Hacker earth problem solution
- Chacha o chacha | hacker earth problem solution
- jadu and dna | hacker earth solution
- Bricks game | hacker earth problem
- Anti-Palindrome strings | hacker earth solution
- connected components in the graph | hacker earth data structure
- odd one out || hacker earth problem solution
- Minimum addition | Hackerearth Practice problem
- The magical mountain | Hackerearth Practice problem
- The first overtake | Hackerearth Practice problem
Hackerrank Problems:-
- Playing With Characters | Hackerrank practice problem solution
- Sum and Difference of Two Numbers | hackerrank practice problem solution
- Functions in C | hackerrank practice problem solution
- Pointers in C | hackerrank practice problem solution
- Conditional Statements in C | Hackerrank practice problem solution
- For Loop in C | hackerrank practice problem solution
- Sum of Digits of a Five Digit Number | hackerrank practice problem solution
- 1D Arrays in C | hackerrank practice problem solution
- Array Reversal | hackerrank practice problem solution
- Printing Tokens | hackerrank practice problem solution
- Digit Frequency | hackerrank practice problem solution
- Calculate the Nth term | hackerrank practice problem solution
Data structure:-
- Program to find cycle in the graph
- Implementation of singly link list
- Implementation of queue by using link list
- Algorithm of quick sort
- stack by using link list
- program to find preorder post order and inorder of the binary search tree
- Minimum weight of spanning tree
- Preorder, inorder and post order traversal of the tree
MCQs:-
0 Comments