Introduction to Data Structure, Spring 2007 Slide- 1 California State University, Fresno Introduction to Data Structure Memory Allocation Ming Li Department.

Slides:

Advertisements

Similar presentations

Dynamic memory allocation

Advertisements

Constructor. 2 constructor The main use of constructors is to initialize objects. A constructor is a special member function, whose name is same as class.

Chapter 6 Data Types

Dynamic Memory Allocation (also see pointers lectures) -L. Grewe.

Introduction to Programming Lecture 39. Copy Constructor.

Pointers & Dynamic Memory Allocation Mugurel Ionu Andreica Spring 2012.

ECE Application Programming Instructor: Dr. Michael Geiger Fall 2012 Lecture 31: Dynamic memory allocation.

Growing Arrays in C By: Victoria Tielebein CS 265- Spring 2011.

Agenda  Review: pointer & array  Relationship between pointer & array  Dynamic memory allocation.

POINTER Prepared by MMD, Edited by MSY1.  Basic concept of pointers  Pointer declaration  Pointer operator (& and *)  Parameter passing by reference.

Informática II Prof. Dr. Gustavo Patiño MJ

1 Day 03 Introduction to C. 2 Memory layout and addresses r s int x = 5, y = 10; float f = 12.5, g = 9.8; char c = ‘r’, d = ‘s’;

Dynamic Memory Allocation in C++. Memory Segments in C++ Memory is divided in certain segments – Code Segment Stores application code – Data Segment Holds.

Introduction to Data Structure, Spring 2007 Slide- 1 California State University, Fresno Introduction to Data Structure Introduction of Concepts Ming Li.

Starting Out with C++: Early Objects 5/e © 2006 Pearson Education. All Rights Reserved Copyright 2004 Scott/Jones Publishing Starting Out with C++: Early.

Main Index Contents 11 Main Index Contents Pointer Illustration Pointer Illustration Vertical / Horizontal View. Vertical / Horizontal View. Data Addresses.

Introduction to Data Structure, Spring 2007 Slide- 1 California State University, Fresno Introduction to Data Structure C Programming Concepts Ming Li.

Main Index Contents 11 Main Index Contents Pointer Illustration Pointer Illustration Vertical / Horizontal View. Vertical / Horizontal View. Data Addresses.

Lecture 2 Pointers Pointers with Arrays Dynamic Memory Allocation.

Computer Science 210 Computer Organization Pointers and Dynamic Storage.

1 Pointers, Dynamic Data, and Reference Types Review on Pointers Reference Variables Dynamic Memory Allocation –The new operator –The delete operator –Dynamic.

1 Procedural Concept The main program coordinates calls to procedures and hands over appropriate data as parameters.

Pointers| SCP1103 Programming Technique C | Jumail, FSKSM, UTM, 2005 | Last Updated: September 2006 Slide 1 Pointers by Jumail Bin Taliba Faculty of Computer.

Dynamic Memory Allocation. One Dimensional Dynamic Memory #define SIZE1 25 #define SIZE2 36 int *p; long double *q; p = (int *)malloc(SIZE1 * sizeof(int));

Overview Working directly with memory locations is beneficial. In C, pointers allow you to: change values passed as arguments to functions work directly.

CS 11 C track: lecture 5 Last week: pointers This week: Pointer arithmetic Arrays and pointers Dynamic memory allocation The stack and the heap.

Addresses in Memory When a variable is declared, enough memory to hold a value of that type is allocated for it at an unused memory location. This is.

1 C - Memory Simple Types Arrays Pointers Pointer to Pointer Multi-dimensional Arrays Dynamic Memory Allocation.

Copyright © 2009 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Dynamic Memory Allocation 9.8.

Pointers and Arrays Beyond Chapter Pointers and Arrays What are the real differences? Pointer Holds the address of a variable Can be pointed.

Comp 245 Data Structures Linked Lists. An Array Based List Usually is statically allocated; may not use memory efficiently Direct access to data; faster.

Lecture 13 Static vs Dynamic Memory Allocation

7. Pointers, Dynamic Memory 20 th September IIT Kanpur 1C Course, Programming club, Fall 2008.

Stack and Heap Memory Stack resident variables include:

Dynamic Memory Allocation The process of allocating memory at run time is known as dynamic memory allocation. C does not Inherently have this facility,

6. More on Pointers 14 th September IIT Kanpur C Course, Programming club, Fall

Computer Science and Software Engineering University of Wisconsin - Platteville 2. Pointer Yan Shi CS/SE2630 Lecture Notes.

Storage Bindings Allocation is the process by which the memory cell or collection of memory cells is assigned to a variable. These cells are taken from.

C++ Data Types Structured array struct union class Address pointer reference Simple IntegralFloating char short int long enum float double long double.

CPSC 252 Dynamic Memory Allocation Page 1 Dynamic memory allocation Our first IntVector class has some serious limitations the capacity is fixed at MAX_SIZE.

Dynamic Memory Allocation. Domain A subset of the total domain name space. A domain represents a level of the hierarchy in the Domain Name Space, and.

1 CS 132 Spring 2008 Chapter 3 Pointers and Array-Based Lists read p

Copyright 2005, The Ohio State University 1 Pointers, Dynamic Data, and Reference Types Review on Pointers Reference Variables Dynamic Memory Allocation.

19&20-2 Know how to declare pointer variables. Understand the & (address) and *(indirection) operators. Dynamic Memory Allocation Related Chapter: ABC.

+ Dynamic memory allocation. + Introduction We often face situations in programming where the data is dynamics in nature. Consider a list of customers.

CS415 C++ Programming Takamitsu Kawai x4212 G11 CERC building WV Virtual Environments Lab West Virginia University.

© Janice Regan, CMPT 128, February CMPT 128: Introduction to Computing Science for Engineering Students Pointers.

1 Lecture07: Memory Model 5/2/2012 Slides modified from Yin Lou, Cornell CS2022: Introduction to C.

CMSC 202 Computer Science II for Majors. CMSC 202UMBC Topics Memory management operators Dynamic memory Project 2 questions.

Lecture 10: 2/17/2003CS148 Spring CS148 Introduction to Programming II Ayman Abdel-Hamid Department of Computer Science Old Dominion University Lecture.

POINTERS IN C. Introduction  A pointer is a variable that holds a memory address  This address is the location of another object (typically another.

1 Memory as byte array Pointers Arrays relationship to pointers Operator ‘new’ Operator ‘delete’ Copy ctor Assignment operator ‘this’ const pointer Allocating.

P OINTERS A pointer is an address All data is stored in memory in some location that is indexed with an address Can refer to variables by name or by memory.

Dynamic Array Allocation char *ptr; // ptr is a pointer variable that // can hold the address of a char ptr = new char[ 5 ]; // dynamically, during run.

Dynamic Memory Management & Static Class Members Lecture No 7 Object Oriented Programming COMSATS Institute of Information Technology.

POINTERS AND MEMORY ACKNOWLEDGEMENT: THE SLIDES ARE PREPARED FROM SLIDES PROVIDED BY NANCY M. AMATO AND JORY DENNY 1.

Arrays and Pointers (part 1) CSE 2031 Fall July 2016.

Stack and Heap Memory Stack resident variables include:

Computer Science 210 Computer Organization

Introduction to Programming

14th September IIT Kanpur

Computer Science 210 Computer Organization

Pointers, Dynamic Data, and Reference Types

Dynamic Memory Allocation

Pointers And Memory Acknowledgement: THE Slides are Prepared FROM SLIDES PROVIDED By NANCY M. AMATO AND Jory Denny.

Dynamic Memory A whole heap of fun….

7. Pointers, Dynamic Memory

C Programming Lecture-8 Pointers and Memory Management

Pointers, Dynamic Data, and Reference Types

Dynamic Data Structures

Presentation transcript:

Introduction to Data Structure, Spring 2007 Slide- 1 California State University, Fresno Introduction to Data Structure Memory Allocation Ming Li Department of Computer Science California State University, Fresno Fall 2006

Introduction to Data Structure, Spring 2007 Slide- 2 California State University, Fresno Vertical and Horizontal View of Memory Address 0 Addressn Address 2 Address 1 Addr n Vertical View of Memory Horizontal View of Memory...

Introduction to Data Structure, Spring 2007 Slide- 3 California State University, Fresno Data Addresses in Memory

Introduction to Data Structure, Spring 2007 Slide- 4 California State University, Fresno Declare a pointer by stating the type followed by the variable name, but with a "*" added immediately before the name. The pointer ptr is a variable whose value is the address of a data item of the designated type. Declaring Pointer Variables int *intPtr; char *charPtr; type *ptr;

Introduction to Data Structure, Spring 2007 Slide- 5 California State University, Fresno Assigning Values to Pointers &m is the address of the integer in memory. The assignment statement Sets intPtr to point at an actual data item. intPtr = &m; int m = 50, *intPtr;

Introduction to Data Structure, Spring 2007 Slide- 6 California State University, Fresno Accessing Data with Pointers int x = 50, y = 100, *px = &x, *py = &y;

Introduction to Data Structure, Spring 2007 Slide- 7 California State University, Fresno Operator ‘new’ p = new time24; // *p is 00:00 (midnight) q = new time24(8, 15); // *q is 8:15 AM Question: Difference between “Heap” and “Stack”?

Introduction to Data Structure, Spring 2007 Slide- 8 California State University, Fresno Operator ‘delete’ Deallocating a dynamic array, use a slightly different form of delete. Place square brackets [] between delete and the pointer variable name. The system deallocates all of the memory originally assigned to the dynamic array. arr = new T[ARRSIZE]; // allocated space for ARRSIZE objects delete [] arr; // deallocate dynamic array storage

Introduction to Data Structure, Spring 2007 Slide- 9 California State University, Fresno Illustrating the Destructor

Introduction to Data Structure, Spring 2007 Slide- 10 California State University, Fresno Difference between C and C++ In C: Use malloc or calloc to allocate memory char *cp = malloc (100); int *cp = calloc (100, sizeof(int)); Use free to release memory free(cp); malloc and free should be used together In C++ new and delete should be used together Mixing new with free or malloc/calloc with delete will crash the memory!