 2003 Prentice Hall, Inc. All rights reserved. 1 Pointers and Strings Outline Introduction Pointer Variable Declarations and Initialization Pointer Operators.

Slides:



Advertisements
Similar presentations
1 Pointers Lecture Introduction Pointers  Powerful, but difficult to master  Simulate pass-by-reference  Close relationship with arrays and.
Advertisements

CS 141 Computer Programming 1 1 Pointers. Pointer Variable Declarations and Initialization Pointer variables –Contain memory addresses as values –Normally,
Pointers and Strings. Introduction Pointers –Powerful, but difficult to master –Simulate call-by-reference –Close relationship with arrays and strings.
© Copyright 1992–2004 by Deitel & Associates, Inc. and Pearson Education Inc. All Rights Reserved. Chapter 7 - Pointers Outline 7.1Introduction 7.2Pointer.
Lesson 6 - Pointers Outline Introduction Pointer Variable Declarations and Initialization Pointer Operators Calling Functions by Reference Using the const.
 2000 Prentice Hall, Inc. All rights reserved. Chapter 7 - Pointers Outline 7.1Introduction 7.2Pointer Variable Declarations and Initialization 7.3Pointer.
 2003 Prentice Hall, Inc. All rights reserved Introduction Arrays –Structures of related data items –Static entity (same size throughout program)
5.1Introduction Pointers –Powerful, but difficult to master –Simulate pass-by-reference –Close relationship with arrays and strings.
 2007 Pearson Education, Inc. All rights reserved C Pointers.
 2000 Deitel & Associates, Inc. All rights reserved. 1 Chapter 5 - Pointers and Strings Outline 5.1Introduction 5.2Pointer Variable Declarations and Initialization.
 2003 Prentice Hall, Inc. All rights reserved. 1 Arrays –Structures of related data items –Static entity (same size throughout program) A few types –Pointer-based.
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.
Lecture 7 C Pointers Acknowledgment The notes are adapted from those provided by Deitel & Associates, Inc. and Pearson Education Inc.
 2003 Prentice Hall, Inc. All rights reserved. 1 Chapter 5 - Pointers and Strings Outline 5.1 Introduction 5.2 Pointer Variable Declarations and Initialization.
 2003 Prentice Hall, Inc. All rights reserved. 1 IS 0020 Program Design and Software Tools Introduction to C++ Programming Lecture 3 Arrays & Pointers.
 2007 Pearson Education, Inc. All rights reserved C Pointers.
(continue) © by Pearson Education, Inc. All Rights Reserved.
 2003 Prentice Hall, Inc. All rights reserved Introduction Pointers –Powerful, but difficult to master –Simulate pass-by-reference –Close relationship.
Nirmalya Roy School of Electrical Engineering and Computer Science Washington State University Cpt S 122 – Data Structures Pointers.
[S. Uludag] CIS / CSC 175 Problem Solving and Programming I Winter 2010 Suleyman Uludag Department of Computer Science, Engineering and Physics (CSEP)
 2003 Prentice Hall, Inc. All rights reserved. 1 Arrays Outline Introduction Arrays Declaring Arrays Examples Using Arrays.
 2003 Prentice Hall, Inc. All rights reserved. 1 Chapter 5: Pointers and Strings Outline Introduction Pointer Variable Declarations and Initialization.
 2008 Pearson Education, Inc. All rights reserved Pointers and Pointer-Based Strings.
 2000 Deitel & Associates, Inc. All rights reserved Introduction Pointers –Powerful, but difficult to master –Simulate call-by-reference –Close.
 2000 Deitel & Associates, Inc. All rights reserved. Chapter 5 - Pointers and Strings Outline 5.1Introduction 5.2Pointer Variable Declarations and Initialization.
1 Object-Oriented Programming -- Using C++ Andres, Wen-Yuan Liao Department of Computer Science and Engineering De Lin Institute of Technology
Pointers Class #9 – Pointers Pointers Pointers are among C++ ’ s most powerful, yet most difficult concepts to master. We ’ ve seen how we can use references.
C++ Programming Lecture 17 Pointers – Part I The Hashemite University Computer Engineering Department (Adapted from the textbook slides)
© Copyright 1992–2004 by Deitel & Associates, Inc. and Pearson Education Inc. All Rights Reserved. Chapter 7 - Pointers Outline 7.1Introduction 7.2Pointer.
1 Lecture 12 Pointers and Strings Section 5.4, ,
1 Chapter 5 - Pointers and Strings Outline 5.1Introduction 5.2Pointer Variable Declarations and Initialization 5.3Pointer Operators 5.4Calling Functions.
 2003 Prentice Hall, Inc. All rights reserved. 1 namespaces Program has identifiers in different scopes –Sometimes scopes overlap, lead to problems Namespace.
 2003 Prentice Hall, Inc. All rights reserved. 1 Chapter 5 - Pointers and Strings Outline 5.1 Introduction 5.2 Pointer Variable Declarations and Initialization.
1. Pointers –Powerful, but difficult to master –Simulate pass-by-reference –Close relationship with arrays and strings 2.
 2003 Prentice Hall, Inc. All rights reserved. 1 Pointers and Strings Outline Introduction Pointer Variable Declarations and Initialization Pointer Operators.
 2003 Prentice Hall, Inc. All rights reserved. 1 Lecture 5: Pointer Outline Chapter 5 Pointer continue Call by reference Pointer arithmatic Debugging.
C++ Programming Lecture 14 Arrays – Part I The Hashemite University Computer Engineering Department (Adapted from the textbook slides)
Pointers in C by Dr P.Padmanabham Professor (CSE)&Director Bharat Institute of Engineering &Technology Hyderabad Mobile
1 Lecture 4: Part1 Arrays Introduction Arrays  Structures of related data items  Static entity (same size throughout program)
Chapter 7 Pointers Associate Prof. Yuh-Shyan Chen Dept. of Computer Science and Information Engineering National Chung-Cheng University.
EC-111 Algorithms & Computing Lecture #9 Instructor: Jahan Zeb Department of Computer Engineering (DCE) College of E&ME NUST.
Dale Roberts Department of Computer and Information Science, School of Science, IUPUI CSCI N305 Pointers Call-by-Reference.
Pointers. Introduction to pointers Pointer variables contain memory addresses as their values. Usually, a variable directly contains a specific value.
C++ Programming Lecture 18 Pointers – Part II The Hashemite University Computer Engineering Department (Adapted from the textbook slides)
Chapter 7 - Pointers Outline 7.1 Introduction
Chapter 5 - Pointers and Strings
EPSII 59:006 Spring 2004.
Chapter 7 - Pointers Outline 7.1 Introduction
Chapter 7 - Pointers Outline 7.1 Introduction
Chapter 7 - Pointers Outline 7.1 Introduction
CSC113: Computer Programming (Theory = 03, Lab = 01)
Chapter 5 - Pointers and Strings
Remark: Data Type of Array Name
Pointers and Pointer-Based Strings
Pointers Kingdom of Saudi Arabia
Chapter 5 - Pointers and Strings
Chapter 5 - Pointers and Strings
5.1 Introduction Pointers Powerful, but difficult to master
Chapter 5 - Pointers and Strings
EENG212 ALGORITHMS & DATA STRUCTURES
C++ Programming Lecture 17 Pointers – Part I
5.1 Introduction Pointers Powerful, but difficult to master
Arrays Arrays A few types Structures of related data items
Lecture 2 Arrays & Pointers May 17, 2004
C++ Programming Lecture 18 Pointers – Part II
Chapter 5 - Pointers and Strings
Lecture 2 Arrays & Pointers September 7, 2004
CISC181 Introduction to Computer Science Dr
4.1 Introduction Arrays A few types Structures of related data items
Presentation transcript:

 2003 Prentice Hall, Inc. All rights reserved. 1 Pointers and Strings Outline Introduction Pointer Variable Declarations and Initialization Pointer Operators Calling Functions by Reference Using const with Pointers Selection Sort Using Pass-by-Reference

 2003 Prentice Hall, Inc. All rights reserved. 2 Introduction Pointers –Powerful, but difficult to master –Enable pass-by-reference and allow the creation of dynamic data structure (e.g., linked lists, queues, etc.) –Close relationship with arrays and strings

 2003 Prentice Hall, Inc. All rights reserved. 3 Pointer Variable Declarations and Initialization Pointer variables –Contain memory addresses as values –Normally, variable contains specific value (direct reference) –Pointers contain address of a variable that itself has specific value (indirect reference) Indirection –Referencing value through pointer Pointer declarations –* indicates variable is pointer int *myPtr; declares pointer to int, pointer of type int * –Multiple pointers require multiple asterisks int *myPtr1, *myPtr2; count 7 countPtr count 7

 2003 Prentice Hall, Inc. All rights reserved. 4 Pointer Variable Declarations and Initialization Can declare pointers to any data type Pointer initialization –Initialized to 0, NULL, or address 0 or NULL points to nothing (null pointer) NULL defined in

 2003 Prentice Hall, Inc. All rights reserved. 5 Pointer Operators & (address operator) –Returns memory address of its operand –Example int y = 5; int *yPtr; yPtr = &y; // yPtr gets address of y –yPtr “points to” y yPtr y 5 yptr y 5 address of y is value of yptr

 2003 Prentice Hall, Inc. All rights reserved. 6 Pointer Operators * (indirection or dereferencing operator) –Returns synonym for the object its pointer operand points to. –*yPtr returns y (because yPtr points to y ) Example: cout << *yPtr << endl;  returns the value of y  cout << y << endl; –dereferenced pointer is lvalue *yPtr = 9; // assigns 9 to y cin >> *yPtr; // receive a value from input * and & are inverses of each other

 2003 Prentice Hall, Inc. All rights reserved. Outline 7 1 // Fig. 8.4: fig08_04.cpp 2 // Using the & and * operators. 3 #include 4 5 using std::cout; 6 using std::endl; 7 8 int main() 9 { 10 int a; // a is an integer 11 int *aPtr; // aPtr is a pointer to an integer a = 7; 14 aPtr = &a; // aPtr assigned address of a cout << "The address of a is " << &a 17 << "\nThe value of aPtr is " << aPtr; cout << "\n\nThe value of a is " << a 20 << "\nThe value of *aPtr is " << *aPtr; cout << "\n\nShowing that * and & are inverses of " 23 << "each other.\n&*aPtr = " << &*aPtr 24 << "\n*&aPtr = " << *&aPtr << endl; 25 * and & are inverses of each other

 2003 Prentice Hall, Inc. All rights reserved. Outline 8 26 return 0; // indicates successful termination } // end main The address of a is 0012FED4 The value of aPtr is 0012FED4 The value of a is 7 The value of *aPtr is 7 Showing that * and & are inverses of each other. &*aPtr = 0012FED4 *&aPtr = 0012FED4 * and & are inverses; same result when both applied to aPtr

 2003 Prentice Hall, Inc. All rights reserved. 9 Calling Functions by Reference 3 ways to pass arguments to function –Pass-by-value –Pass-by-reference with reference arguments –Pass-by-reference with pointer arguments return can return one value from function Arguments passed to function using reference arguments –Modify original values of arguments Eliminate the overhead of passing large objects! –More than one value “returned”

 2003 Prentice Hall, Inc. All rights reserved. 10 Calling Functions by Reference Pass-by-reference with pointer arguments –Simulate pass-by-reference Use pointers and (*) indirection operator –Pass address of argument using & operator –Arrays not passed with & because array name already pointer (pointer to the first element in the array, & arrayName[0] ) –* operator is used in the function as alias/nickname for variable A function receiving an address as an argument must define a pointer parameter to receive the address

 2003 Prentice Hall, Inc. All rights reserved. Outline 11 1 // Fig. 8.6: fig08_06.cpp 2 // Cube a variable using pass-by-value. 3 #include 4 5 using std::cout; 6 using std::endl; 7 8 int cubeByValue( int ); // prototype 9 10 int main() 11 { 12 int number = 5; cout << "The original value of number is " << number; // pass number by value to cubeByValue 17 number = cubeByValue( number ); cout << "\nThe new value of number is " << number << endl; return 0; // indicates successful termination } // end main 24 Pass number by value; result return ed by cubeByValue

 2003 Prentice Hall, Inc. All rights reserved. Outline // calculate and return cube of integer argument 26 int cubeByValue( int n ) 27 { 28 return n * n * n; // cube local variable n and return result } // end function cubeByValue The original value of number is 5 The new value of number is 125 cubeByValue receives parameter passed-by-value Cubes and return s local variable n

 2003 Prentice Hall, Inc. All rights reserved. Outline 13 1 // Fig. 8.7: fig08_07.cpp 2 // Cube a variable using pass-by-reference 3 // with a pointer argument. 4 #include 5 6 using std::cout; 7 using std::endl; 8 9 void cubeByReference( int * ); // prototype int main() 12 { 13 int number = 5; cout << "The original value of number is " << number; // pass address of number to cubeByReference 18 cubeByReference( &number ); cout << "\nThe new value of number is " << number << endl; return 0; // indicates successful termination } // end main 25 Apply address operator & to pass address of number to cubeByReference cubeByReference modified variable number Prototype indicates parameter is pointer to int

 2003 Prentice Hall, Inc. All rights reserved. Outline // calculate cube of *nPtr; modifies variable number in main 27 void cubeByReference( int *nPtr ) 28 { 29 *nPtr = *nPtr * *nPtr * *nPtr; // cube *nPtr } // end function cubeByReference The original value of number is 5 The new value of number is 125 cubeByReference receives address of int variable, i.e., pointer to an int Modify and access int variable using indirection operator *

 2003 Prentice Hall, Inc. All rights reserved. 15 Using const with Pointers const qualifier –Value of variable should not be modified –const used when function does not need to change a variable Principle of least privilege –Award a function enough access to accomplish its task, but no more Four ways to pass pointer to function –Non-constant pointer to non-constant data Highest amount of access is granted –Non-constant pointer to constant data –Constant pointer to non-constant data –Constant pointer to constant data Least amount of access is granted

 2003 Prentice Hall, Inc. All rights reserved. Outline 16 1 // Fig. 8.10: fig08_10.cpp 2 // Converting lowercase letters to uppercase letters 3 // using a non-constant pointer to non-constant data. 4 #include 5 6 using std::cout; 7 using std::endl; 8 9 #include // prototypes for islower and toupper void convertToUppercase( char * ); int main() 14 { 15 char phrase[] = "characters and $32.98"; cout << "The phrase before conversion is: " << phrase; 18 convertToUppercase( phrase ); 19 cout << "\nThe phrase after conversion is: " 20 << phrase << endl; return 0; // indicates successful termination } // end main 25 Parameter is non-constant pointer to non-constant data convertToUppercase modifies variable phrase

 2003 Prentice Hall, Inc. All rights reserved. Outline // convert string to uppercase letters 27 void convertToUppercase( char *sPtr ) 28 { 29 while ( *sPtr != '\0' ) { // current character is not '\0' if ( islower( *sPtr ) ) // if character is lowercase, 32 *sPtr = toupper( *sPtr ); // convert to uppercase sPtr; // move sPtr to next character in string } // end while } // end function convertToUppercase The phrase before conversion is: characters and $32.98 The phrase after conversion is: CHARACTERS AND $32.98 Parameter sPtr non-constant pointer to non-constant data Function islower returns true if character is lowercase Function toupper returns corresponding uppercase character if original character lowercase; otherwise toupper returns original (uppercase) character When operator ++ applied to pointer that points to array, memory address stored in pointer modified to point to next element of array.

 2003 Prentice Hall, Inc. All rights reserved. Outline 18 1 // Fig. 8.11: fig08_11.cpp 2 // Printing a string one character at a time using 3 // a non-constant pointer to constant data. 4 #include 5 6 using std::cout; 7 using std::endl; 8 9 void printCharacters( const char * ); int main() 12 { 13 const char phrase[] = "print characters of a string"; cout << "The string is:\n"; 16 printCharacters( phrase ); 17 cout << endl; return 0; // indicates successful termination } // end main 22 Parameter is non-constant pointer to constant data. Pass pointer phrase to function printCharacters.  a non-constant pointer to constant data is a pointer that can be modified to point to any data item of the appropriate type, but the data to which it points cannot be modified through that pointer

 2003 Prentice Hall, Inc. All rights reserved. Outline // sPtr cannot modify the character to which it points, 24 // i.e., sPtr is a "read-only" pointer 25 void printCharacters( const char *sPtr ) 26 { 27 for ( ; *sPtr != '\0'; sPtr++ ) // no initialization 28 cout << *sPtr; } // end function printCharacters The string is: print characters of a string sPtr is non-constant pointer to constant data; cannot modify character to which sPtr points. Increment sPtr to point to next character.

 2003 Prentice Hall, Inc. All rights reserved. Outline 20 1 // Fig. 8.12: fig08_12.cpp 2 // Attempting to modify data through a 3 // non-constant pointer to constant data. 4 5 void f( const int * ); // prototype 6 7 int main() 8 { 9 int y; f( &y ); // f attempts illegal modification return 0; // indicates successful termination } // end main // xPtr cannot modify the value of the variable 18 // to which it points 19 void f( const int *xPtr ) 20 { 21 *xPtr = 100; // error: cannot modify a const object } // end function f d:\cpphtp8_examples\ch08\Fig08_12.cpp(21) : error C2166: l-value specifies const object Parameter is non-constant pointer to constant data. Pass address of int variable y to attempt illegal modification. Attempt to modify const object pointed to by xPtr. Error produced when attempting to compile.

 2003 Prentice Hall, Inc. All rights reserved. 21 Using const with Pointers const pointers –Always point to same memory location –Default for array name –Must be initialized when declared

 2003 Prentice Hall, Inc. All rights reserved. Outline 22 1 // Fig. 8.13: fig08_13.cpp 2 // Attempting to modify a constant pointer to 3 // non-constant data. 4 5 int main() 6 { 7 int x, y; 8 9 // ptr is a constant pointer to an integer that can 10 // be modified through ptr, but ptr always points to the 11 // same memory location. 12 int * const ptr = &x; *ptr = 7; // allowed: *ptr is not const 15 ptr = &y; // error: ptr is const; cannot assign new address return 0; // indicates successful termination } // end main d:\cpphtp8_examples\ch08\Fig08_13.cpp(15) : error C2166: l-value specifies const object ptr is constant pointer to integer. Can modify x (pointed to by ptr ) since x not constant. Cannot modify ptr to point to new address since ptr is constant. Line 15 generates compiler error by attempting to assign new address to constant pointer.  a constant pointer to non-constant data is a pointer that always points to the same memory location. Data at that location can be changed through the pointer. (e.g., array name)

 2003 Prentice Hall, Inc. All rights reserved. Outline 23 1 // Fig. 8.14: fig08_14.cpp 2 // Attempting to modify a constant pointer to constant data. 3 #include 4 5 using std::cout; 6 using std::endl; 7 8 int main() 9 { 10 int x = 5, y; // ptr is a constant pointer to a constant integer. 13 // ptr always points to the same location; the integer 14 // at that location cannot be modified. 15 const int * const ptr = &x; cout << *ptr << endl; *ptr = 7; // error: *ptr is const; cannot assign new value 20 ptr = &y; // error: ptr is const; cannot assign new address return 0; // indicates successful termination } // end main ptr is constant pointer to integer constant. Cannot modify x (pointed to by ptr ) since *ptr declared constant. Cannot modify ptr to point to new address since ptr is constant.  a constant pointer to a constant data is a pointer that always points to the same memory location and data at that location cannot be modified.

 2003 Prentice Hall, Inc. All rights reserved. Outline 24 d:\cpphtp8_examples\ch08\Fig08_14.cpp(19) : error C2166: l-value specifies const object d:\cpphtp8_examples\ch08\Fig08_14.cpp(20) : error C2166: l-value specifies const object Line 19 generates compiler error by attempting to modify constant object. Line 20 generates compiler error by attempting to assign new address to constant pointer.

 2003 Prentice Hall, Inc. All rights reserved. 25 Selection Sort Using Pass-by-Reference Implement selectionSort using pointers –Want function swap to access array elements Individual array elements: scalars –Passed by value “by default” Pass by reference using address operator & –Selection sort: First iteration: select smallest element in array and swap it with first element of array Second iteration: select second smallest and swap it with second element in array Etc…..

 2003 Prentice Hall, Inc. All rights reserved. Outline 26 1 // Fig. 8.15: fig08_15.cpp 2 // This program puts values into an array, sorts the values into 3 // ascending order, and prints the resulting array. 4 #include 5 6 using std::cout; 7 using std::endl; 8 9 #include using std::setw; void selectionSort( int *, const int ); // prototype 14 void swap( int * const, int * const ); // prototype int main() 17 { 18 const int arraySize = 10; 19 int a[ arraySize ] = { 2, 6, 4, 8, 10, 12, 89, 68, 45, 37 }; cout << "Data items in original order\n"; for ( int i = 0; i < arraySize; i++ ) 24 cout << setw( 4 ) << a[ i ]; 25

 2003 Prentice Hall, Inc. All rights reserved. Outline selectionSort( a, arraySize ); // sort the array cout << "\nData items in ascending order\n"; for ( int j = 0; j < arraySize; j++ ) 31 cout << setw( 4 ) << a[ j ]; cout << endl; return 0; // indicates successful termination } // end main // sort an array of integers using selection sort algorithm 40 void selectionSort( int *array, const int size ) 41 { 42 int smallest; 43 for ( int i = 0; i < size - 1; i++ ) // loop over size-1 elements 44 { 45 smallest = i; 46 for ( int index = i + 1; index < size; index++ ) 47 if ( array[ index ] < array[ smallest ] ) 48 smallest = index; 49 // swap adjacent elements if they are out of order 50 swap( &array[ i ], &array[ smallest ] ); 51 } // end for 52 } // end function selectionSort Declare as int *array (rather than int array[] ) to indicate function selectionSort receives single-subscripted array. Receives size of array as argument; declared const to ensure size not modified.

 2003 Prentice Hall, Inc. All rights reserved. Outline // swap values at memory locations to which 55 // element1Ptr and element2Ptr point 56 void swap( int * const element1Ptr, int * const element2Ptr ) 57 { 58 int hold = *element1Ptr; 59 *element1Ptr = *element2Ptr; 60 *element2Ptr = hold; } // end function swap Data items in original order Data items in ascending order Pass arguments by reference, allowing function to swap values at memory locations.