Presentation is loading. Please wait.

Presentation is loading. Please wait.

 Memory setup  Pointer declaration  Address operator  Indirection  Printing addresses or pointers.

Published byBruno Logan Modified over 8 years ago

Similar presentations

Presentation on theme: " Memory setup  Pointer declaration  Address operator  Indirection  Printing addresses or pointers."— Presentation transcript:

1

2

3  Memory setup  Pointer declaration  Address operator  Indirection  Printing addresses or pointers

4 int a = 10; float x = 17.24; char c = ‘q’; 10 17.24 ‘q’ a x c (1ab) (2fe) (3cd)

5 int a = 10; float x = 17.24; char c = ‘q’; 10 17.24 ‘q’ 5fb a x c (1ab) (2fe) (3cd)

6 int a = 10; float x = 17.24; char c = ‘q’; int *ptr; 10 17.24 ‘q’ a x c (1ab) (2fe) (3cd) ptr

7 int a = 10; float x = 17.24; char c = ‘q’; cout << a; cout << &a; 10 17.24 ‘q’ a x c (1ab) (2fe) (3cd)

8 int a = 10; float x = 17.24; char c = ‘q’; int *ptr; ptr = &a; 10 17.24 ‘q’ 1ab a x c (1ab) (2fe) (3cd) ptr

9 int a = 10; float x = 17.24; char c = ‘q’; int *ptr; ptr = &a; 10 17.24 ‘q’ 1ab a x c (1ab) (2fe) (3cd) ptr

10 int a = 10; float x = 17.24; char c = ‘q’; int *ptr; ptr = &a; 10 17.24 ‘q’ a x c (1ab) (2fe) (3cd) 1ab ptr

11 #include using std::cout; using std::endl; int main() { int y, cc = 10; int* intptr; intptr = &cc; y = *intptr; *intptr = 32; cout << y <<* intptr << intptr <<& intptr << endl; return 0; }

12 int y, cc = 10; int* intptr; intptr = &cc; y = *intptr; *intptr = 32; cout << y <<* intptr << intptr <<& intptr << endl; 10 y cc (1ab) (4fe)

13 int y, cc = 10; int* intptr; intptr = &cc; y = *intptr; *intptr = 32; cout << y <<*intptr << ptr <<&intptr << endl; ; 10 y cc (1ab) (4fe) intptr

14 int y, cc = 10; int* intptr; intptr = &cc; y = *intptr; *intptr = 32; cout << y <<*intptr <<intptr <<&intptr << endl; 10 y cc (1ab) (4fe) 4fe intptr

15 int y, cc = 10; int* intptr; intptr = &cc; y = *intptr; *intptr = 32; cout << y <<* intptr << intptr <<& intptr << endl; 10 y cc (1ab) (4fe) 4fe intptr

16 int y, cc = 10; int* intptr; intptr = &cc; y = *intptr; *intptr = 32; cout << y <<*intptr << intptr <<& intptr << endl; 10 32 y cc (1ab) (4fe) 4fe intptr

17 int y, cc = 10; int* intptr; intptr = &cc; y = *intptr; cout << y <<*intptr <<intptr<<&intptr << endl; 10 32 y cc (1ab) (4fe) 4fe intptr (55a)

18 int y, cc = 10; int* intptr; intptr = &cc; y = *intptr; cout << y <<*intptr <<intptr <<&intptr << endl; 10 32 y cc (1ab) (4fe) 4fe intptr (55a) Output 10 32 4fe 55a

19 Memory setup Pointer declaration Address operator Indirection Printing addresses or pointers

Download ppt " Memory setup  Pointer declaration  Address operator  Indirection  Printing addresses or pointers."

Similar presentations

Incomplete Structs struct B; struct A { struct B * partner; // other declarations… }; struct B { struct A * partner; // other declarations… };

Incomplete Structs struct B; struct A { struct B * partner; // other declarations… }; struct B { struct A * partner; // other declarations… };
A pointer is the memory address of a variable. A memory address is a physical location within a system’s memory space. A pointer variable is variable used.

A pointer is the memory address of a variable. A memory address is a physical location within a system’s memory space. A pointer variable is variable used.
1 Class Vehicle #include #define N 10../.. 2 Class Vehicle class vehicle { public: float speed; char colour[N+1]; char make[N+1];

1 Class Vehicle #include #define N 10../.. 2 Class Vehicle class vehicle { public: float speed; char colour[N+1]; char make[N+1];
1 Pointers Lecture 11. 2 5.1Introduction Pointers  Powerful, but difficult to master  Simulate pass-by-reference  Close relationship with arrays and.

1 Pointers Lecture Introduction Pointers  Powerful, but difficult to master  Simulate pass-by-reference  Close relationship with arrays and.
CS 141 Computer Programming 1 1 Pointers. Pointer Variable Declarations and Initialization Pointer variables –Contain memory addresses as values –Normally,

CS 141 Computer Programming 1 1 Pointers. Pointer Variable Declarations and Initialization Pointer variables –Contain memory addresses as values –Normally,
Pointers 1 Pointers Pointers  In chapter three we looked at passing parameters to functions using call by value, and using call by reference, using reference.

Pointers 1 Pointers Pointers  In chapter three we looked at passing parameters to functions using call by value, and using call by reference, using reference.
Pointers Mark Hennessy Dept. Computer Science NUI Maynooth C++ Workshop 18 th – 22 nd September 2006.

Pointers Mark Hennessy Dept. Computer Science NUI Maynooth C++ Workshop 18 th – 22 nd September 2006.
1 Chapter 9 Pointers. 2 Topics 8.1 Getting the Address of a Variable 8.2 Pointer Variables 8.3 Relationship Between Arrays and Pointers 8.4 Pointer Arithmetic.

1 Chapter 9 Pointers. 2 Topics 8.1 Getting the Address of a Variable 8.2 Pointer Variables 8.3 Relationship Between Arrays and Pointers 8.4 Pointer Arithmetic.
Programming Pointers. COMP104 Lecture 32 / Slide 2 Pointers l Pointers are objects whose values are the locations of other objects l Pointers are memory.

Programming Pointers. COMP104 Lecture 32 / Slide 2 Pointers l Pointers are objects whose values are the locations of other objects l Pointers are memory.
What are Pointers? Different from other normal variables which can store values. pointers are special variables that can hold the address of a variable.

What are Pointers? Different from other normal variables which can store values. pointers are special variables that can hold the address of a variable.
 Review structures  Program to demonstrate a structure containing a pointer.

 Review structures  Program to demonstrate a structure containing a pointer.
Arrays in C++ Numeric Character. Structured Data Type A structured data type is a type that stores a collection of individual components with one variable.

Arrays in C++ Numeric Character. Structured Data Type A structured data type is a type that stores a collection of individual components with one variable.
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.

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.
Functions Pass by Reference Alina Solovyova-Vincent Department of Computer Science & Engineering University of Nevada, Reno Fall 2005.

Functions Pass by Reference Alina Solovyova-Vincent Department of Computer Science & Engineering University of Nevada, Reno Fall 2005.
Pointers Chapter 9. Getting The Address Of A Variable Each variable in program is stored at a unique address Use address operator & to get address of.

Pointers Chapter 9. Getting The Address Of A Variable Each variable in program is stored at a unique address Use address operator & to get address of.
Comp 245 Data Structures Linked Lists. An Array Based List Usually is statically allocated; may not use memory efficiently Direct access to data; faster.

Comp 245 Data Structures Linked Lists. An Array Based List Usually is statically allocated; may not use memory efficiently Direct access to data; faster.
 2003 Prentice Hall, Inc. All rights reserved. 1 5.1Introduction Pointers –Powerful, but difficult to master –Simulate pass-by-reference –Close relationship.

 2003 Prentice Hall, Inc. All rights reserved Introduction Pointers –Powerful, but difficult to master –Simulate pass-by-reference –Close relationship.
C++ Data Types Structured array struct union class Address pointer reference Simple IntegralFloating char short int long enum float double long double.

C++ Data Types Structured array struct union class Address pointer reference Simple IntegralFloating char short int long enum float double long double.
Tracing through E01, question 9 – step 1 // p02.cc P. Conrad, for CISC181 07S // Exam question for E01 #include using namespace std; void mysteryFunction(int.

Tracing through E01, question 9 – step 1 // p02.cc P. Conrad, for CISC181 07S // Exam question for E01 #include using namespace std; void mysteryFunction(int.
Review the following : Flowcharting Variable declarations Output Input Arithmetic Calculations Conditional Statements Loops.

Review the following : Flowcharting Variable declarations Output Input Arithmetic Calculations Conditional Statements Loops.

Similar presentations

Ads by Google