Uploaded on

 

More in: Technology
  • Full Name Full Name Comment goes here.
    Are you sure you want to
    Your message goes here
    Be the first to comment
    Be the first to like this
No Downloads

Views

Total Views
72
On Slideshare
0
From Embeds
0
Number of Embeds
0

Actions

Shares
Downloads
3
Comments
0
Likes
0

Embeds 0

No embeds

Report content

Flagged as inappropriate Flag as inappropriate
Flag as inappropriate

Select your reason for flagging this presentation as inappropriate.

Cancel
    No notes for slide

Transcript

  • 1. 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
  • 2. Week Target Achieved 1 30 23 2 3 Typing Speed
  • 3. Jobs Applied Week Company Designation Applied Date Current Status 1 2 3
  • 4. Functions With Heap and Stack Muhammed Ajmal IK ajuik2008@gmail.com www.facebook.com/username twitter.com/username in.linkedin.com/in/profilename 9745020951
  • 5. Overview • Introduction • Stack • Heap • Simple program
  • 6. Introduction • The memory a program uses is typically divided into four different areas: – The code area. – The heap. – The stack
  • 7. 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
  • 8. Stack contd..
  • 9. Stack operation • Push • Pop
  • 10. 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()
  • 11. Heap contd. • Variables on the heap must be destroyed manually. • Function for memory deallocation – Free()
  • 12. Example for stack
  • 13. Example for Heap
  • 14. 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)
  • 15. { 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); }
  • 16. Thank you
  • 17. 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
  • 18. 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.