This presentation discusses functions with the heap and stack in computer memory. It explains that the stack stores temporary function variables in a last-in, first-out structure, while the heap is used for dynamic memory allocation using functions like malloc() and is manually freed using free(). It includes an example C program that uses the heap to allocate memory for an integer array, calculate the average of elements in the array, and free the memory. The presentation was created by a trainee at Baabtra as part of a mentoring program.

2. 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

3. Week Target Achieved
1 30 23
2
3
Typing Speed

4. Jobs Applied
Week Company Designation Applied Date Current Status
1
2
3

5. Functions With Heap and Stack
Muhammed Ajmal IK
ajuik2008@gmail.com
www.facebook.com/username
twitter.com/username
in.linkedin.com/in/profilename
9745020951

6. Overview
• Introduction
• Stack
• Heap
• Simple program

7. Introduction
• The memory a program uses is typically divided into
four different areas:
– The code area.
– The heap.
– The stack

8. Stack
• It is a particular portion of memory.
• It stores temporary variables created by each
function
• variables are allocated and freed automatically
• the stack has size limits
• stack is a last-in, first-out (LIFO) structure

9. Stack contd..

10. Stack operation
• Push
• Pop

11. Heap
• Heap is the area of memory used for dynamic
memory allocation
• Stored in computer RAM just like the stack.
• Function for memory allocation
– Malloc()
– Calloc()
– Realloc()

12. Heap contd.
• Variables on the heap must be destroyed manually.
• Function for memory deallocation
– Free()

13. Example for stack

14. Example for Heap

15. Find Average of n Number
#include<stdio.h>
#include<stdlib.h>
int main()
{
int *ptr,n,i;
float sum=0.0;
printf("Enter how many Element you want to insert");
scanf("%d",&n);
ptr=malloc(n*sizeof(int));
if(ptr==NULL)

16. {
printf("Memory not allocated");
exit(0);
}
printf("enter element:");
for(i=0;i<n;++i)
{
scanf("%d",ptr+i);
sum=sum+ *(ptr+i);
}
printf("n Average %f",(sum/n));
free(ptr);
}

17. Thank you

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 up Village
Eranakulam,
Kerala, India.
Email: info@baabtra.com
IKK Road,
East Hill, Kozhikode
Kerala, India.
Ph: + 91 – 495 30 63 624
NIT-TBI,
NIT Campus, Kozhikode,
Kerala, India.