31. Memory Layouts : C

Memory Layouts

What is Dynamic memory? 

Dynamic memory allotment is the course of designation of memory space at the run time. We utilize the idea of dynamic memory allotment to diminish the wastage of memory, and it is the ideal method of memory portion. 

Static	Dynamic
Allocation before execution	Allocation at run time
Non-reusable memory	Reusable memory
Less optimal way	More optimal way

Memory Allocation in C - It can be separated into four fragments. 

• Code - It makes out of all the text fragments of our program. 

• Variables - By This, we mean both worldwide and static factors. Worldwide factors can be utilized anyplace in the program, while static has its limits inside the capacity. The variable section is additionally partitioned into two portions, contingent upon the information they can store. 
• Information section - It stores introduced information i.e., information whose worth is as of now given. 
• Bss fragment - It stores uninitialized information i.e., information whose variable is instated as it were. 

• Stack - 
• It is a LIFO information structure. Its size increments when the program pushes ahead. 
• At first, the stack resembles a can in which the last passage to be embedded will be the first to get out. That is the reason it is known as LIFO information structure i.e., rearward in first out. 
• Assume that we push a capacity An into the stack. Capacity A will begin executing. Presently the capacity An is calling one more Function B during its execution. Capacity B will be driven into the stack, and the program will begin executing B. Presently, assuming B is calling another capacity C, the program will drive C into the stack and will begin its execution. Presently, after C has been executed totally, the program will pop C from the stack as it was the final remaining one in and begin executing B. At the point when B has been executed totally, it will be jumped out, and A will begin executing until the stack becomes vacant. 

• Stack Overflow - When a stack gets depleted because of awful programming abilities or some legitimate blunder, the peculiarity is known as Stack Overflow. 

• Heap - 
• It is a tree-based information structure. Its size increments when we dispense memory powerfully. To utilize the store information structure, we need to make a pointer in our primary capacity that will highlight some memory blocks in a load. The inconvenience of utilizing a store is that the memory won't get liberated naturally when the pointer gets overwritten.