SlideShare una empresa de Scribd logo
1 de 19
ShajahanTS
shajahan007ts@gmail.com
www.facebook.com/username
twitter.com/username
in.linkedin.com/in/profilename
9544040194
Typing Speed:
Disclaimer: This presentation is prepared by
trainees of baabtra as a part of mentoring
program. This is not official document of baabtra
–Mentoring Partner
Baabtra-Mentoring Partner is the mentoring division of baabte System
Technologies Pvt . Ltd
 Stack is a special region of computer's memory that stores temporary
variables created by each function (including the main() function).The stack is a
"FILO" (first in, last out) data structure, that is managed and optimized by the
CPU quite closely. Every time a function declares a new variable, it is "pushed"
onto the stack.Then every time a function exits, all of the variables pushed
onto the stack by that function, are freed (that is to say, they are deleted).
Once a stack variable is freed, that region of memory becomes available for
other stack variables.
 the stack grows and shrinks as functions push and pop local
variables
 there is no need to manage the memory yourself, variables
are allocated and freed automatically
 the stack has size limits
 stack variables only exist while the function that created
them, is running
main()
{
Int a=10,b=20,c;
c=sum(a , b);
}
int sum(int a , int b)
{
int c;
c=a+b;
return c;
}
STACK
Main()
a=10
b=20
c ;
sum()
a =10
b=20
C=30
 The heap is a region of computer's memory that is not
managed automatically , and is not as tightly managed by
the CPU. It is a more region of memory .
 To allocate memory on the heap, you must
use malloc() or calloc(), which are built-in C functions.
Once you have allocated memory on the heap, you are
responsible for using free() to deallocate that memory
once you don't need it any more. If you fail to do this, your
program will have what is known as a memory leak.That
is, memory on the heap will still be set aside (and won't be
available to other processes).
 malloc() Allocates requested size of bytes and
returns a pointer first byte of allocated space
 calloc() Allocates space for an array
elements, initializes to zero and then returns a
pointer to memory
 free() deallocate the previously allocated
space
 realloc() Change the size of previously
allocated space
malloc()
 Syntax
malloc(size in bytes);
 This function allocates ‘size’ byte of memory and returns a pointer to
the first byte or NULL if there is some kind of error
 But we need a pointer to point to the allocated space in heap
 int *p; p=malloc(2);
int *p;
p=malloc(2); //allocates 2 bytes of memory
p=malloc(sizeof(int)); //sizeof() returns size of any data type
so here it will be malloc(2)
p=(int *)malloc(2); //malloc always return void * pointer .
So you may type cast it into
any data type.
but it is unnecessary as the compiler
does it
for us
p=(int *)malloc (sizeof(int)); //allocates 2 bytes of memory
 Calloc() stands for "contiguous allocation”
 Allocates multiple blocks of memory each of same size and sets all
bytes to zero
 Syntax
calloc(number of elements , size in bytes);
we need a pointer to point to the allocated space in heap
int *p;
p=calloc(2,2); //allocates 2 block of 2 bytes memory
p=calloc(3,sizeof(int)); //sizeof() returns size of any data type
so here it will be calloc(3,2)
p=(int *)calloc(2,10); //calloc always return void * pointer .
So you may type cast it into any data type.
but it is unnecessary as the compiler does it
for us
p=(int *)calloc (3,sizeof(int)); //allocates 3 block of 2 bytes
memmory
MALLOC()
• Allocates "size" bytes of memory.
• The contents of
allocated memory are not
changed. i.e., the memory may
contains garbage values.
• returns void pointer (void *). If
the allocation succeeds, a pointer
to the block of memory is returned
CALLOC()
• Allocates
a region of memory large
enough to hold "n elements" of
"size" bytes each.
• The allocated region is
initialized to zero.
• returns void pointer (void *). If
the allocation succeeds, a
pointer to the block of
memory is returned.
realloc( pointer name , new size );
It will realloc the size of memory
free( pointer name );
De allocate the memory
#include <stdio.h>
#include <stdlib.h>
double* multiplyByTwo (double *input)
{
double *twice = malloc(sizeof(double));
*twice = *input * 2.0;
return twice;
}
int main ()
{
int *age = malloc(sizeof(int));
*age = 30;
double *salary = malloc(sizeof(double));
*salary = 12345.67;
double *myList = calloc(3 , sizeof(double));
myList[0] = 1.2;
myList[1] = 2.3;
myList[2] = 3.4;
double *twiceSalary = multiplyByTwo(salary);
printf("double your salary is %.3fn", *twiceSalary);
free(age);
free(salary);
free(myList);
free(twiceSalary);
return 0;
}
If this presentation helped you, please visit our
page facebook.com/baabtra and like it.
Thanks in advance.
www.baabtra.com | www.massbaab.com |www.baabte.com
Contact Us
Emarald Mall (Big Bazar Building)
Mavoor Road, Kozhikode,
Kerala, India.
Ph: + 91 – 495 40 25 550
NC Complex, Near Bus Stand
Mukkam, Kozhikode,
Kerala, India.
Ph: + 91 – 495 40 25 550
Start upVillage
Eranakulam,
Kerala, India.
Email: info@baabtra.com

Más contenido relacionado

La actualidad más candente

TLPI - 7 Memory Allocation
TLPI - 7 Memory AllocationTLPI - 7 Memory Allocation
TLPI - 7 Memory Allocation
Shu-Yu Fu
 
Python advanced 3.the python std lib by example –data structures
Python advanced 3.the python std lib by example –data structuresPython advanced 3.the python std lib by example –data structures
Python advanced 3.the python std lib by example –data structures
John(Qiang) Zhang
 

La actualidad más candente (20)

Memory allocation in c
Memory allocation in cMemory allocation in c
Memory allocation in c
 
Stack and Heap
Stack and HeapStack and Heap
Stack and Heap
 
Dynamic memory allocation
Dynamic memory allocationDynamic memory allocation
Dynamic memory allocation
 
Dynamic memory Allocation in c language
Dynamic memory Allocation in c languageDynamic memory Allocation in c language
Dynamic memory Allocation in c language
 
C dynamic ppt
C dynamic pptC dynamic ppt
C dynamic ppt
 
Dynamic memory allocation in c language
Dynamic memory allocation in c languageDynamic memory allocation in c language
Dynamic memory allocation in c language
 
Dynamic memory allocation(memory,allocation,memory allocatin,calloc,malloc,re...
Dynamic memory allocation(memory,allocation,memory allocatin,calloc,malloc,re...Dynamic memory allocation(memory,allocation,memory allocatin,calloc,malloc,re...
Dynamic memory allocation(memory,allocation,memory allocatin,calloc,malloc,re...
 
Dynamic memory allocation
Dynamic memory allocationDynamic memory allocation
Dynamic memory allocation
 
TLPI - 7 Memory Allocation
TLPI - 7 Memory AllocationTLPI - 7 Memory Allocation
TLPI - 7 Memory Allocation
 
Introduction to c part -3
Introduction to c   part -3Introduction to c   part -3
Introduction to c part -3
 
Standard Template Library (STL) in Object Oriented Programming
Standard Template Library (STL) in Object Oriented ProgrammingStandard Template Library (STL) in Object Oriented Programming
Standard Template Library (STL) in Object Oriented Programming
 
Heap Management
Heap ManagementHeap Management
Heap Management
 
06 linked list
06 linked list06 linked list
06 linked list
 
Unit II - LINEAR DATA STRUCTURES
Unit II -  LINEAR DATA STRUCTURESUnit II -  LINEAR DATA STRUCTURES
Unit II - LINEAR DATA STRUCTURES
 
Stack and Queue by M.Gomathi Lecturer
Stack and Queue by M.Gomathi LecturerStack and Queue by M.Gomathi Lecturer
Stack and Queue by M.Gomathi Lecturer
 
Linked list
Linked listLinked list
Linked list
 
Ppt presentation of queues
Ppt presentation of queuesPpt presentation of queues
Ppt presentation of queues
 
Dynamic memory allocation
Dynamic memory allocationDynamic memory allocation
Dynamic memory allocation
 
Python advanced 3.the python std lib by example –data structures
Python advanced 3.the python std lib by example –data structuresPython advanced 3.the python std lib by example –data structures
Python advanced 3.the python std lib by example –data structures
 
Applications of data structures
Applications of data structuresApplications of data structures
Applications of data structures
 

Similar a Stack & heap

13. dynamic allocation
13. dynamic allocation13. dynamic allocation
13. dynamic allocation
웅식 전
 

Similar a Stack & heap (20)

Dynamic Memory Allocation in C
Dynamic Memory Allocation in CDynamic Memory Allocation in C
Dynamic Memory Allocation in C
 
Dma
DmaDma
Dma
 
Dynamic Memory allocation
Dynamic Memory allocationDynamic Memory allocation
Dynamic Memory allocation
 
final GROUP 4.pptx
final GROUP 4.pptxfinal GROUP 4.pptx
final GROUP 4.pptx
 
Memory Allocation & Direct Memory Allocation in C & C++ Language PPT
Memory Allocation & Direct Memory Allocation in C & C++ Language PPTMemory Allocation & Direct Memory Allocation in C & C++ Language PPT
Memory Allocation & Direct Memory Allocation in C & C++ Language PPT
 
Dynamic memory allocation
Dynamic memory allocationDynamic memory allocation
Dynamic memory allocation
 
13. dynamic allocation
13. dynamic allocation13. dynamic allocation
13. dynamic allocation
 
Buffer overflow attack
Buffer overflow attackBuffer overflow attack
Buffer overflow attack
 
Dma
DmaDma
Dma
 
Functions with heap and stack
Functions with heap and stackFunctions with heap and stack
Functions with heap and stack
 
Dynamic memory allocation
Dynamic memory allocationDynamic memory allocation
Dynamic memory allocation
 
dynamic_v1-3.pptx
dynamic_v1-3.pptxdynamic_v1-3.pptx
dynamic_v1-3.pptx
 
Memory Management.pptx
Memory Management.pptxMemory Management.pptx
Memory Management.pptx
 
C++ Memory Management
C++ Memory ManagementC++ Memory Management
C++ Memory Management
 
Data Structure - Dynamic Memory Allocation
Data Structure - Dynamic Memory AllocationData Structure - Dynamic Memory Allocation
Data Structure - Dynamic Memory Allocation
 
Memory Management In C++
Memory Management In C++Memory Management In C++
Memory Management In C++
 
DYNAMIC MEMORY ALLOCATION.pptx
DYNAMIC MEMORY ALLOCATION.pptxDYNAMIC MEMORY ALLOCATION.pptx
DYNAMIC MEMORY ALLOCATION.pptx
 
DYNAMIC MEMORY ALLOCATION.pptx
DYNAMIC MEMORY ALLOCATION.pptxDYNAMIC MEMORY ALLOCATION.pptx
DYNAMIC MEMORY ALLOCATION.pptx
 
Linux memorymanagement
Linux memorymanagementLinux memorymanagement
Linux memorymanagement
 
ADK COLEGE.pptx
ADK COLEGE.pptxADK COLEGE.pptx
ADK COLEGE.pptx
 

Último

VIP Call Girls Ankleshwar 7001035870 Whatsapp Number, 24/07 Booking
VIP Call Girls Ankleshwar 7001035870 Whatsapp Number, 24/07 BookingVIP Call Girls Ankleshwar 7001035870 Whatsapp Number, 24/07 Booking
VIP Call Girls Ankleshwar 7001035870 Whatsapp Number, 24/07 Booking
dharasingh5698
 
UNIT-V FMM.HYDRAULIC TURBINE - Construction and working
UNIT-V FMM.HYDRAULIC TURBINE - Construction and workingUNIT-V FMM.HYDRAULIC TURBINE - Construction and working
UNIT-V FMM.HYDRAULIC TURBINE - Construction and working
rknatarajan
 

Último (20)

Thermal Engineering Unit - I & II . ppt
Thermal Engineering  Unit - I & II . pptThermal Engineering  Unit - I & II . ppt
Thermal Engineering Unit - I & II . ppt
 
(INDIRA) Call Girl Aurangabad Call Now 8617697112 Aurangabad Escorts 24x7
(INDIRA) Call Girl Aurangabad Call Now 8617697112 Aurangabad Escorts 24x7(INDIRA) Call Girl Aurangabad Call Now 8617697112 Aurangabad Escorts 24x7
(INDIRA) Call Girl Aurangabad Call Now 8617697112 Aurangabad Escorts 24x7
 
BSides Seattle 2024 - Stopping Ethan Hunt From Taking Your Data.pptx
BSides Seattle 2024 - Stopping Ethan Hunt From Taking Your Data.pptxBSides Seattle 2024 - Stopping Ethan Hunt From Taking Your Data.pptx
BSides Seattle 2024 - Stopping Ethan Hunt From Taking Your Data.pptx
 
Online banking management system project.pdf
Online banking management system project.pdfOnline banking management system project.pdf
Online banking management system project.pdf
 
Vivazz, Mieres Social Housing Design Spain
Vivazz, Mieres Social Housing Design SpainVivazz, Mieres Social Housing Design Spain
Vivazz, Mieres Social Housing Design Spain
 
The Most Attractive Pune Call Girls Manchar 8250192130 Will You Miss This Cha...
The Most Attractive Pune Call Girls Manchar 8250192130 Will You Miss This Cha...The Most Attractive Pune Call Girls Manchar 8250192130 Will You Miss This Cha...
The Most Attractive Pune Call Girls Manchar 8250192130 Will You Miss This Cha...
 
Intze Overhead Water Tank Design by Working Stress - IS Method.pdf
Intze Overhead Water Tank  Design by Working Stress - IS Method.pdfIntze Overhead Water Tank  Design by Working Stress - IS Method.pdf
Intze Overhead Water Tank Design by Working Stress - IS Method.pdf
 
VIP Call Girls Ankleshwar 7001035870 Whatsapp Number, 24/07 Booking
VIP Call Girls Ankleshwar 7001035870 Whatsapp Number, 24/07 BookingVIP Call Girls Ankleshwar 7001035870 Whatsapp Number, 24/07 Booking
VIP Call Girls Ankleshwar 7001035870 Whatsapp Number, 24/07 Booking
 
NFPA 5000 2024 standard .
NFPA 5000 2024 standard                                  .NFPA 5000 2024 standard                                  .
NFPA 5000 2024 standard .
 
Water Industry Process Automation & Control Monthly - April 2024
Water Industry Process Automation & Control Monthly - April 2024Water Industry Process Automation & Control Monthly - April 2024
Water Industry Process Automation & Control Monthly - April 2024
 
The Most Attractive Pune Call Girls Budhwar Peth 8250192130 Will You Miss Thi...
The Most Attractive Pune Call Girls Budhwar Peth 8250192130 Will You Miss Thi...The Most Attractive Pune Call Girls Budhwar Peth 8250192130 Will You Miss Thi...
The Most Attractive Pune Call Girls Budhwar Peth 8250192130 Will You Miss Thi...
 
Booking open Available Pune Call Girls Koregaon Park 6297143586 Call Hot Ind...
Booking open Available Pune Call Girls Koregaon Park  6297143586 Call Hot Ind...Booking open Available Pune Call Girls Koregaon Park  6297143586 Call Hot Ind...
Booking open Available Pune Call Girls Koregaon Park 6297143586 Call Hot Ind...
 
Top Rated Pune Call Girls Budhwar Peth ⟟ 6297143586 ⟟ Call Me For Genuine Se...
Top Rated  Pune Call Girls Budhwar Peth ⟟ 6297143586 ⟟ Call Me For Genuine Se...Top Rated  Pune Call Girls Budhwar Peth ⟟ 6297143586 ⟟ Call Me For Genuine Se...
Top Rated Pune Call Girls Budhwar Peth ⟟ 6297143586 ⟟ Call Me For Genuine Se...
 
PVC VS. FIBERGLASS (FRP) GRAVITY SEWER - UNI BELL
PVC VS. FIBERGLASS (FRP) GRAVITY SEWER - UNI BELLPVC VS. FIBERGLASS (FRP) GRAVITY SEWER - UNI BELL
PVC VS. FIBERGLASS (FRP) GRAVITY SEWER - UNI BELL
 
Thermal Engineering-R & A / C - unit - V
Thermal Engineering-R & A / C - unit - VThermal Engineering-R & A / C - unit - V
Thermal Engineering-R & A / C - unit - V
 
UNIT-V FMM.HYDRAULIC TURBINE - Construction and working
UNIT-V FMM.HYDRAULIC TURBINE - Construction and workingUNIT-V FMM.HYDRAULIC TURBINE - Construction and working
UNIT-V FMM.HYDRAULIC TURBINE - Construction and working
 
Thermal Engineering -unit - III & IV.ppt
Thermal Engineering -unit - III & IV.pptThermal Engineering -unit - III & IV.ppt
Thermal Engineering -unit - III & IV.ppt
 
Unit 1 - Soil Classification and Compaction.pdf
Unit 1 - Soil Classification and Compaction.pdfUnit 1 - Soil Classification and Compaction.pdf
Unit 1 - Soil Classification and Compaction.pdf
 
Generative AI or GenAI technology based PPT
Generative AI or GenAI technology based PPTGenerative AI or GenAI technology based PPT
Generative AI or GenAI technology based PPT
 
KubeKraft presentation @CloudNativeHooghly
KubeKraft presentation @CloudNativeHooghlyKubeKraft presentation @CloudNativeHooghly
KubeKraft presentation @CloudNativeHooghly
 

Stack & heap

  • 1.
  • 3. Disclaimer: This presentation is prepared by trainees of baabtra as a part of mentoring program. This is not official document of baabtra –Mentoring Partner Baabtra-Mentoring Partner is the mentoring division of baabte System Technologies Pvt . Ltd
  • 4.
  • 5.
  • 6.  Stack is a special region of computer's memory that stores temporary variables created by each function (including the main() function).The stack is a "FILO" (first in, last out) data structure, that is managed and optimized by the CPU quite closely. Every time a function declares a new variable, it is "pushed" onto the stack.Then every time a function exits, all of the variables pushed onto the stack by that function, are freed (that is to say, they are deleted). Once a stack variable is freed, that region of memory becomes available for other stack variables.
  • 7.  the stack grows and shrinks as functions push and pop local variables  there is no need to manage the memory yourself, variables are allocated and freed automatically  the stack has size limits  stack variables only exist while the function that created them, is running
  • 8. main() { Int a=10,b=20,c; c=sum(a , b); } int sum(int a , int b) { int c; c=a+b; return c; } STACK Main() a=10 b=20 c ; sum() a =10 b=20 C=30
  • 9.  The heap is a region of computer's memory that is not managed automatically , and is not as tightly managed by the CPU. It is a more region of memory .  To allocate memory on the heap, you must use malloc() or calloc(), which are built-in C functions. Once you have allocated memory on the heap, you are responsible for using free() to deallocate that memory once you don't need it any more. If you fail to do this, your program will have what is known as a memory leak.That is, memory on the heap will still be set aside (and won't be available to other processes).
  • 10.  malloc() Allocates requested size of bytes and returns a pointer first byte of allocated space  calloc() Allocates space for an array elements, initializes to zero and then returns a pointer to memory  free() deallocate the previously allocated space  realloc() Change the size of previously allocated space
  • 11. malloc()  Syntax malloc(size in bytes);  This function allocates ‘size’ byte of memory and returns a pointer to the first byte or NULL if there is some kind of error  But we need a pointer to point to the allocated space in heap  int *p; p=malloc(2);
  • 12. int *p; p=malloc(2); //allocates 2 bytes of memory p=malloc(sizeof(int)); //sizeof() returns size of any data type so here it will be malloc(2) p=(int *)malloc(2); //malloc always return void * pointer . So you may type cast it into any data type. but it is unnecessary as the compiler does it for us p=(int *)malloc (sizeof(int)); //allocates 2 bytes of memory
  • 13.  Calloc() stands for "contiguous allocation”  Allocates multiple blocks of memory each of same size and sets all bytes to zero  Syntax calloc(number of elements , size in bytes); we need a pointer to point to the allocated space in heap
  • 14. int *p; p=calloc(2,2); //allocates 2 block of 2 bytes memory p=calloc(3,sizeof(int)); //sizeof() returns size of any data type so here it will be calloc(3,2) p=(int *)calloc(2,10); //calloc always return void * pointer . So you may type cast it into any data type. but it is unnecessary as the compiler does it for us p=(int *)calloc (3,sizeof(int)); //allocates 3 block of 2 bytes memmory
  • 15. MALLOC() • Allocates "size" bytes of memory. • The contents of allocated memory are not changed. i.e., the memory may contains garbage values. • returns void pointer (void *). If the allocation succeeds, a pointer to the block of memory is returned CALLOC() • Allocates a region of memory large enough to hold "n elements" of "size" bytes each. • The allocated region is initialized to zero. • returns void pointer (void *). If the allocation succeeds, a pointer to the block of memory is returned.
  • 16. realloc( pointer name , new size ); It will realloc the size of memory free( pointer name ); De allocate the memory
  • 17. #include <stdio.h> #include <stdlib.h> double* multiplyByTwo (double *input) { double *twice = malloc(sizeof(double)); *twice = *input * 2.0; return twice; } int main () { int *age = malloc(sizeof(int)); *age = 30; double *salary = malloc(sizeof(double)); *salary = 12345.67; double *myList = calloc(3 , sizeof(double)); myList[0] = 1.2; myList[1] = 2.3; myList[2] = 3.4; double *twiceSalary = multiplyByTwo(salary); printf("double your salary is %.3fn", *twiceSalary); free(age); free(salary); free(myList); free(twiceSalary); return 0; }
  • 18. If this presentation helped you, please visit our page facebook.com/baabtra and like it. Thanks in advance. www.baabtra.com | www.massbaab.com |www.baabte.com
  • 19. Contact Us Emarald Mall (Big Bazar Building) Mavoor Road, Kozhikode, Kerala, India. Ph: + 91 – 495 40 25 550 NC Complex, Near Bus Stand Mukkam, Kozhikode, Kerala, India. Ph: + 91 – 495 40 25 550 Start upVillage Eranakulam, Kerala, India. Email: info@baabtra.com