85 Pages

cpphtp4_PPT_05

Course: STAT 101, Spring 2012
School: Iowa State
Rating:
 
 
 
 
 

Word Count: 6701

Document Preview

5 1 Chapter - Pointers and Strings Outline 5.1 5.2 5.3 5.4 5.5 5.6 5.7 5.8 5.9 5.10 5.11 5.12 Introduction Pointer Variable Declarations and Initialization Pointer Operators Calling Functions by Reference Using const with Pointers Bubble Sort Using Pass-by-Reference Pointer Expressions and Pointer Arithmetic Relationship Between Pointers and Arrays Arrays of Pointers Case Study: Card Shuffling and Dealing...

Register Now

Unformatted Document Excerpt

Coursehero >> Iowa >> Iowa State >> STAT 101

Course Hero has millions of student submitted documents similar to the one
below including study guides, practice problems, reference materials, practice exams, textbook help and tutor support.

Course Hero has millions of student submitted documents similar to the one below including study guides, practice problems, reference materials, practice exams, textbook help and tutor support.
5 1 Chapter - Pointers and Strings Outline 5.1 5.2 5.3 5.4 5.5 5.6 5.7 5.8 5.9 5.10 5.11 5.12 Introduction Pointer Variable Declarations and Initialization Pointer Operators Calling Functions by Reference Using const with Pointers Bubble Sort Using Pass-by-Reference Pointer Expressions and Pointer Arithmetic Relationship Between Pointers and Arrays Arrays of Pointers Case Study: Card Shuffling and Dealing Simulation Function Pointers Introduction to Character and String Processing 5.12.1 Fundamentals of Characters and Strings 5.12.2 String Manipulation Functions of the StringHandling Library 2003 Prentice Hall, Inc. All rights reserved. 2 5.1 Pointers Introduction Powerful, but difficult to master Simulate pass-by-reference Close relationship with arrays and strings 2003 Prentice Hall, Inc. All rights reserved. 3 5.2 Pointer Variable Declarations and Initialization count 7 Pointer variables Contain memory addresses as values Normally, variable contains specific value (direct reference) Pointers contain address of variable that has specific value countPtr count (indirect reference) Indirection Referencing value through pointer 7 Pointer declarations * indicates variable is pointer int *myPtr; declares pointer to int, pointer of type int * Multiple pointers require multiple asterisks int *myPtr1, *myPtr2; 2003 Prentice Hall, Inc. All rights reserved. 4 5.2 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 2003 Prentice Hall, Inc. All rights reserved. 5 5.3 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 y 5 yptr 500000 600000 600000 y 5 yPtr address of y is value of yptr 2003 Prentice Hall, Inc. All rights reserved. 6 5.3 Pointer Operators * (indirection/dereferencing operator) Returns synonym for object its pointer operand points to *yPtr returns y (because yPtr points to y). dereferenced pointer is lvalue *yptr = 9; // assigns 9 to y * and & are inverses of each other 2003 Prentice Hall, Inc. All rights reserved. 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 // Fig. 5.4: fig05_04.cpp // Using the & and * operators. #include <iostream> using std::cout; using std::endl; int main() { int a; int *aPtr; a = 7; aPtr = &a; 7 Outline fig05_04.cpp (1 of 2) // a is an integer // aPtr is a pointer to an integer // aPtr assigned address of a cout << "The address of a is " << &a << "\nThe value of aPtr is " << aPtr; cout << "\n\nThe value of a is " << a << "\nThe value of *aPtr is " << *aPtr; cout << "\n\nShowing that * and & are inverses of " << "each other.\n&*aPtr = " << &*aPtr << "\n*&aPtr = " << *&aPtr << endl; * and & are inverses of each other 2003 Prentice Hall, Inc. All rights reserved. 26 27 28 return 0; } // end main // indicates successful termination 8 Outline fig05_04.cpp (2 of 2) fig05_04.cpp output (1 of 1) 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 5.4 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 More than one value returned 2003 Prentice Hall, Inc. All rights reserved. 10 5.4 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 * operator used as alias/nickname for variable inside of function 2003 Prentice Hall, Inc. All rights reserved. 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 // Fig. 5.6: fig05_06.cpp // Cube a variable using pass-by-value. #include <iostream> using std::cout; using std::endl; int cubeByValue( int ); int main() { int number = 5; cout << "The original value of number is " Pass number << number; // pass number by value to cubeByValue number = cubeByValue( number ); // prototype 11 Outline fig05_06.cpp (1 of 2) by value; result returned by cubeByValue cout << "\nThe new value of number is " << number << endl; return 0; } // end main // indicates successful termination 2003 Prentice Hall, Inc. All rights reserved. 25 26 27 28 29 30 // calculate and return cube of integer argument int cubeByValue( int n ) { cubeByValue receives return n * n * n; // cube local variable n and return result 12 Outline fig05_06.cpp (2 of 2) fig05_06.cpp output (1 of 1) parameter passed-by-value } // end function cubeByValue The original value of number is 5 The new value of number is 125 Cubes and returns local variable n 2003 Prentice Hall, Inc. All rights reserved. 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 // Fig. 5.7: fig05_07.cpp // Cube a variable using pass-by-reference // with a pointer argument. #include <iostream> using std::cout; using std::endl; void cubeByReference( int * ); int main() { int number = 5; cout << "The original value of number is " << number; // pass address of number to cubeByReference( &number ); 13 Outline fig05_07.cpp (1 of 2) Prototype indicates parameter is pointer to int // prototype Apply address operator & to pass address of number to cubeByReference cubeByReference cout << "\nThe new value of number is " << number << endl; return 0; } // end main // indicates successful termination cubeByReference modified variable number 2003 Prentice Hall, Inc. All rights reserved. 26 27 28 29 30 31 // calculate cube of *nPtr; modifies variable number in main void cubeByReference( int *nPtr ) { *nPtr = *nPtr * *nPtr * *nPtr; // cube *nPtr } // end function cubeByReference 14 Outline fig05_07.cpp (2 of 2) fig05_07.cpp output (1 of 1) 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 5.5 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 function enough access to accomplish task, but no more Four ways to pass pointer to function Nonconstant pointer to nonconstant data Highest amount of access Nonconstant pointer to constant data Constant pointer to nonconstant data Constant pointer to constant data Least amount of access 2003 Prentice Hall, Inc. All rights reserved. 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 // Fig. 5.10: fig05_10.cpp // Converting lowercase letters to uppercase letters // using a non-constant pointer to non-constant data. #include <iostream> using std::cout; using std::endl; #include <cctype> // prototypes for 16 Outline fig05_10.cpp (1 of 2) Parameter is nonconstant pointer toupper islower and to nonconstant data void convertToUppercase( char * ); int main() { char phrase[] = "characters and $32.98"; convertToUppercase modifies variable phrase cout << "The phrase before conversion is: " << phrase; convertToUppercase( phrase ); cout << "\nThe phrase after conversion is: " << phrase << endl; return 0; } // end main // indicates successful termination 2003 Prentice Hall, Inc. All rights reserved. 26 27 28 29 30 31 32 33 34 35 36 37 38 The The // convert string to uppercase letters void convertToUppercase( char *sPtr ) { while ( *sPtr != '\0' ) { // current character is not '\0' if ( islower( *sPtr ) ) // if character *sPtr = toupper( *sPtr ); // convert to uppercase ++sPtr; // move 17 Outline fig05_10.cpp Parameter sPtr nonconstant (2 of 2) is lowercase, pointer to nonconstant data fig05_10.cpp output (1 of 1) } // end while Function islower returns sPtrtrue if character is in string to next character lowercase Function toupper returns } // end function convertToUppercase corresponding uppercase to When operator ++ applied character if original character pointer that points to array, phrase before conversion is: characters and $32.98 lowercase; otherwise in memory address stored phrase after conversion is: CHARACTERS AND $32.98 toupper returns original pointer modified to point to (uppercase) character next element of array. 2003 Prentice Hall, Inc. All rights reserved. 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 // Fig. 5.11: fig05_11.cpp // Printing a string one character at a time using // a non-constant pointer to constant data. #include <iostream> using std::cout; using std::endl; void printCharacters( const char * ); int main() { Pass pointer char phrase[] = "print characters of a string"; cout << "The string is:\n"; printCharacters( phrase ); cout << endl; return 0; } // end main 18 Outline fig05_11.cpp (1 of 2) Parameter is nonconstant pointer to constant data. phrase to function printCharacters. // indicates successful termination 2003 Prentice Hall, Inc. All rights reserved. 23 24 25 26 27 28 29 30 // sPtr cannot modify the character to which it points, // i.e., sPtr is a "read-only" pointer void printCharacters( const char *sPtr ) { for ( ; *sPtr != '\0'; sPtr++ ) // no initialization sPtr is nonconstant cout << *sPtr; } // end function printCharacters 19 Outline fig05_11.cpp (2 of 2) fig05_11.cpp output (1 of 1) The string is: print characters of a string 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. 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 // Fig. 5.12: fig05_12.cpp // Attempting to modify data through a // non-constant pointer to constant data. void f( const int * ); int main() { int y; f( &y ); return 0; } // end main // prototype 20 Outline fig05_12.cpp (1 of 1) fig05_12.cpp output (1 of 1) Parameter is nonconstant pointer to constant data. // f attempts illegal modification // indicates successful termination Pass address of int variable y to attempt illegal modification. // xPtr cannot modify the value of the variable Attempt to modify const // to which it points object pointed to by xPtr. void f( const int *xPtr ) { *xPtr = 100; // error: cannot modify a const object } // end function f Error produced when attempting to compile. d:\cpphtp4_examples\ch05\Fig05_12.cpp(21) : error C2166: l-value specifies const object 2003 Prentice Hall, Inc. All rights reserved. 21 5.5 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. 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 // Fig. 5.13: fig05_13.cpp // Attempting to modify a constant pointer to // non-constant data. int main() { int x, y; 22 Outline fig05_13.cpp (1 of 1) fig05_13.cpp output (1 of 1) ptr is constant // ptr is a constant pointer to an integer that can pointer // be modified through ptr, but ptr always pointsby the integer. Can modify x (pointed to to // same memory location. ptr) since x not constant. Cannot modify ptr to point int * const ptr = &x; *ptr = 7; ptr = &y; return 0; } // end main // allowed: // error: ptr is const; cannot assign new address // indicates successful to to new address since ptr is constant. *ptr is not const Line 15 generates compiler error by termination attempting to assign new address to constant pointer. d:\cpphtp4_examples\ch05\Fig05_13.cpp(15) : error C2166: l-value specifies const object 2003 Prentice Hall, Inc. All rights reserved. 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 // Fig. 5.14: fig05_14.cpp // Attempting to modify a constant pointer to constant data. #include <iostream> using std::cout; using std::endl; int main() { int x = 5, y; 23 Outline fig05_14.cpp (1 of 1) ptr is integer. // ptr is a constant pointer to a constant constant pointer integer constant. // ptr always points to the same location; the integer // at that location cannot be modified. const int *const ptr = &x; cout to *ptr ptr = &y; Cannot modify x (pointed to by ptr) since *ptrto point Cannot modify ptr declared << *ptr << endl; constant. to new address since ptr is = 7; // error: *ptr constant. cannot assign new is const; // indicates successful termination value // error: ptr is const; cannot assign new address return 0; } // end main 2003 Prentice Hall, Inc. All rights reserved. d:\cpphtp4_examples\ch05\Fig05_14.cpp(19) : error C2166: l-value specifies const object d:\cpphtp4_examples\ch05\Fig05_14.cpp(20) : error C2166: l-value specifies const object 24 Outline fig05_14.cpp Line 19 generates compiler output (1 of 1) error by attempting to modify Line 20 generates compiler constant object. error by attempting to assign new address to constant pointer. 2003 Prentice Hall, Inc. All rights reserved. 25 5.6 Bubble Sort Using Pass-by-Reference Implement bubbleSort using pointers Want function swap to access array elements Individual array elements: scalars Passed by value by default Pass by reference using address operator & 2003 Prentice Hall, Inc. All rights reserved. 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 // Fig. 5.15: fig05_15.cpp // This program puts values into an array, sorts the values into // ascending order, and prints the resulting array. #include <iostream> using std::cout; using std::endl; #include <iomanip> using std::setw; void bubbleSort( int *, const int ); void swap( int * const, int * const ); // prototype // prototype 26 Outline fig05_15.cpp (1 of 3) int main() { const int arraySize = 10; 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++ ) cout << setw( 4 ) << a[ i ]; 2003 Prentice Hall, Inc. All rights reserved. 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 bubbleSort( a, arraySize ); // sort the array 27 Outline fig05_15.cpp (2 of 3) cout << "\nData items in ascending order\n"; for ( int j = 0; j < arraySize; j++ ) cout << setw( 4 ) << a[ j ]; cout << endl; return 0; } // end main // indicates successful termination // sort an array of integers using void bubbleSort( int *array, const { // loop to control passes for ( int pass = 0; pass < size - 1; pass++ ) Declare as int *array array as Receives size of (rather thanargument; declared const to int array[]) ensure bubble to indicate function sort algorithm size not modified. bubbleSort receives int size ) single-subscripted array. // loop to control comparisons during each pass for ( int k = 0; k < size - 1; k++ ) // swap adjacent elements if they are out of order if ( array[ k ] > array[ k + 1 ] ) swap( &array[ k ], &array[ k + 1 ] ); 2003 Prentice Hall, Inc. All rights reserved. 51 52 53 54 55 56 57 58 59 60 61 62 28 } // end function bubbleSort // swap values at memory locations to which // element1Ptr and element2Ptr point void swap( int * const element1Ptr, int * const element2Ptr ) { int hold = *element1Ptr; *element1Ptr = *element2Ptr; Pass *element2Ptr = hold; } // end function swap Outline fig05_15.cpp (3 of 3) fig05_15.cpp output (1 of arguments by reference, 1) allowing function to swap values at memory locations. Data items in original order 2 6 4 8 10 12 89 68 Data items in ascending order 2 4 6 8 10 12 37 45 45 68 37 89 2003 Prentice Hall, Inc. All rights reserved. 29 5.6 Bubble Sort Using Pass-by-Reference sizeof Unary operator returns size of operand in bytes For arrays, sizeof returns ( size of 1 element ) * ( number of elements ) If sizeof( int ) = 4, then int myArray[10]; cout << sizeof(myArray); will print 40 sizeof can be used with Variable names Type names Constant values 2003 Prentice Hall, Inc. All rights reserved. 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 // Fig. 5.16: fig05_16.cpp // Sizeof operator when used on an array name // returns the number of bytes in the array. #include <iostream> using std::cout; using std::endl; size_t getSize( double * ); int main() { double array[ 20 ]; cout << "The number of bytes in the << sizeof( array ); // prototype 30 Outline fig05_16.cpp (1 of 2) Operator sizeof applied to an array returns total number array is " of bytes in array. cout << "\nThe number of bytes returned by getSize is " << getSize( array ) << endl; return 0; } // end main // indicates successful termination Function getSize returns number of bytes used to store array address. 2003 Prentice Hall, Inc. All rights reserved. 25 26 27 28 29 30 // return size of ptr size_t getSize( double *ptr ) { return sizeof( ptr ); } // end function getSize 31 Outline fig05_16.cpp (2 of 2) Operator sizeof returns 160number of bytes of pointer. fig05_16.cpp output (1 of 1) The number of bytes in the array is The number of bytes returned by getSize is 4 2003 Prentice Hall, Inc. All rights reserved. 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 // Fig. 5.17: fig05_17.cpp // Demonstrating the sizeof operator. #include <iostream> using std::cout; using std::endl; int main() { char c; short s; int i; long l; float f; double d; long double ld; int array[ 20 ]; int *ptr = array; 32 Outline fig05_17.cpp (1 of 2) 2003 Prentice Hall, Inc. All rights reserved. 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 cout << << << << << << << << << << << << << << << << << "sizeof c = " << sizeof c "\tsizeof(char) = " << sizeof( char ) "\nsizeof s = " << sizeof s Operator sizeof can be "\tsizeof(short) = " << sizeof( short ) used on variable name.fig05_17.cpp Operator sizeof can be "\nsizeof i = " << sizeof i (2 of used on type name. 2) "\tsizeof(int) = " << sizeof( int ) "\nsizeof l = " << sizeof l "\tsizeof(long) = " << sizeof( long ) "\nsizeof f = " << sizeof f "\tsizeof(float) = " << sizeof( float ) "\nsizeof d = " << sizeof d "\tsizeof(double) = " << sizeof( double ) "\nsizeof ld = " << sizeof ld "\tsizeof(long double) = " << sizeof( long double ) "\nsizeof array = " << sizeof array "\nsizeof ptr = " << sizeof ptr endl; // indicates successful termination 33 Outline return 0; } // end main 2003 Prentice Hall, Inc. All rights reserved. sizeof sizeof sizeof sizeof sizeof sizeof sizeof sizeof sizeof c = 1 sizeof(char) = 1 s = 2 sizeof(short) = 2 i = 4 sizeof(int) = 4 l = 4 sizeof(long) = 4 f = 4 sizeof(float) = 4 d = 8 sizeof(double) = 8 ld = 8 sizeof(long double) = 8 array = 80 ptr = 4 34 Outline fig05_17.cpp output (1 of 1) 2003 Prentice Hall, Inc. All rights reserved. 35 Pointer Expressions and Pointer Arithmetic Pointer arithmetic Increment/decrement pointer (++ or --) Add/subtract an integer to/from a pointer( + or += , - or -=) Pointers may be subtracted from each other Pointer arithmetic meaningless unless performed on pointer to array 5.7 5 element int array on a machine using 4 byte ints vPtr points to first element v[ 0 ], which is at location 3000 vPtr = 3000 location 3000 3004 3008 3012 3016 vPtr += 2; sets vPtr to 3008 vPtr points to v[ 2 ] v[0] v[1] v[2] v[3] v[4] pointer variable vPtr 2003 Prentice Hall, Inc. All rights reserved. 36 5.7 Pointer Expressions and Pointer Arithmetic Subtracting pointers Returns number of elements between two addresses vPtr2 = v[ 2 ]; vPtr = v[ 0 ]; vPtr2 - vPtr == 2 Pointer assignment Pointer can be assigned to another pointer if both of same type If not same type, cast operator must be used Exception: pointer to void (type void *) Generic pointer, represents any type No casting needed to convert pointer to void pointer void pointers cannot be dereferenced 2003 Prentice Hall, Inc. All rights reserved. 37 5.7 Pointer Expressions and Pointer Arithmetic Pointer comparison Use equality and relational operators Comparisons meaningless unless pointers point to members of same array Compare addresses stored in pointers Example: could show that one pointer points to higher numbered element of array than other pointer Common use to determine whether pointer is 0 (does not point to anything) 2003 Prentice Hall, Inc. All rights reserved. 38 5.8 Relationship Between Pointers and Arrays Arrays and pointers closely related Array name like constant pointer Pointers can do array subscripting operations Accessing array elements with pointers Element b[ n ] can be accessed by *( bPtr + n ) Called pointer/offset notation Addresses &b[ 3 ] same as bPtr + 3 Array name can be treated as pointer b[ 3 ] same as *( b + 3 ) Pointers can be subscripted (pointer/subscript notation) bPtr[ 3 ] same as b[ 3 ] 2003 Prentice Hall, Inc. All rights reserved. 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 // Fig. 5.20: fig05_20.cpp // Using subscripting and pointer notations with arrays. #include <iostream> using std::cout; using std::endl; int main() { int b[] = { 10, 20, 30, 40 }; int *bPtr = b; // set bPtr to point to array b // output array b using array subscript notation cout << "Array b printed with:\n" << "Array subscript notation\n"; for ( int i = 0; i < 4; i++ ) cout << "b[" << i << "] = " << b[ i ] << '\n'; // output array b using the array name and // pointer/offset notation cout << "\nPointer/offset notation where " << "the pointer is the array name\n"; 39 Outline fig05_20.cpp (1 of 2) Using array subscript notation. 2003 Prentice Hall, Inc. All rights reserved. 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 for ( int offset1 = 0; offset1 < 4; offset1++ ) cout << "*(b + " << offset1 << ") = " << *( b + offset1 ) << '\n'; // output array b using bPtr and array subscript notation Using array name cout << "\nPointer subscript notation\n"; for ( int j = 0; j < 4; j++ ) cout << "bPtr[" << j << "] = " << bPtr[ j ] << '\n'; cout << "\nPointer/offset notation\n"; // output array b using bPtr and pointer/offset notation for ( int offset2 = 0; offset2 < 4; offset2++ ) cout << "*(bPtr + " << offset2 << ") = " << *( bPtr + offset2 ) << '\n'; return 0; } // end main // indicates successful termination 40 Outline fig05_20.cpp (2 of 2) and pointer/offset notation. Using pointer subscript notation. Using bPtr and pointer/offset notation. 2003 Prentice Hall, Inc. All rights reserved. Array b printed with: Array subscript notation b[0] = 10 b[1] = 20 b[2] = 30 b[3] = 40 Pointer/offset notation where the pointer is the array name *(b + 0) = 10 *(b + 1) = 20 *(b + 2) = 30 *(b + 3) = 40 Pointer bPtr[0] bPtr[1] bPtr[2] bPtr[3] subscript notation = 10 = 20 = 30 = 40 41 Outline fig05_20.cpp output (1 of 1) Pointer/offset notation *(bPtr + 0) = 10 *(bPtr + 1) = 20 *(bPtr + 2) = 30 *(bPtr + 3) = 40 2003 Prentice Hall, Inc. All rights reserved. 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 // Fig. 5.21: fig05_21.cpp // Copying a string using array notation // and pointer notation. #include <iostream> using std::cout; using std::endl; void copy1( char *, const char * ); void copy2( char *, const char * ); int main() { char string1[ 10 ]; char *string2 = "Hello"; char string3[ 10 ]; char string4[] = "Good Bye"; copy1( string1, string2 ); cout << "string1 = " << string1 << endl; copy2( string3, string4 ); cout << "string3 = " << string3 << endl; return 0; // indicates successful termination // prototype // prototype 42 Outline fig05_21.cpp (1 of 2) 2003 Prentice Hall, Inc. All rights reserved. 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 43 } // end main Outline Use array subscript notation // copy s2 to s1 using array notation fig05_21.cpp to copy string in s2 to void copy1( char *s1, const char *s2 ) (2 of 2) character array s1. { for ( int i = 0; ( s1[ i ] = s2[ i ] ) != '\0'; i++ ) fig05_21.cpp ; // do nothing in body output (1 of 1) } // end function copy1 Use pointer notation to copy // copy s2 to s1 using pointer notation string void copy2( char *s1, const char *s2 ) in s2 to character array in s1. { for ( ; ( *s1 = *s2 ) != '\0'; s1++, s2++ ) ; // do nothing in body } // end function copy2 string1 = Hello string3 = Good Bye Increment both pointers to point to next elements in corresponding arrays. 2003 Prentice Hall, Inc. All rights reserved. 44 5.9 Arrays of Pointers Arrays can contain pointers Commonly used to store array of strings char *suit[ 4 ] = {"Hearts", "Diamonds", "Clubs", "Spades" }; Each element of suit points to char * (a string) Array does not store strings, only pointers to strings suit[0] suit[1] suit[2] suit[3] H D C S e i l p a a u a r m b d t o s e s n \0 s \0 \0 d s \0 suit array has fixed size, but strings can be of any size 2003 Prentice Hall, Inc. All rights reserved. 45 5.10 Case Study: Card Shuffling and Dealing Simulation Card shuffling program Use an array of pointers to strings, to store suit names Use a double scripted array (suit by value) Ace 0 Hearts Diamonds Clubs Spades 1 0 2 3 deck[2][12] represents the King of Clubs King Two 1 Three Four 2 3 Five 4 Six 5 Seven Eight Nine 6 7 8 Ten 9 Jack 10 Queen King 11 12 Clubs Place 1-52 into the array to specify the order in which the cards are dealt 2003 Prentice Hall, Inc. All rights reserved. 46 5.10 Case Study: Card Shuffling and Dealing Simulation Pseudocode for shuffling and dealing simulation First refinement Initialize the suit array Initialize the face array Initialize the deck array Third refinement Choose slot of deck randomly While chosen slot of deck has been previously chosen Choose slot of deck randomly Place card number in chosen slot of deck Second refinement For each of the 52 cards Place card number in randomly selected unoccupied slot of deck Shuffle the deck For each of the 52 cards Find card number in deck array and print face and suit of card For each slot of the deck array If slot contains card number Print the face and suit of the card Deal 52 cards 2003 Prentice Hall, Inc. All rights reserved. 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 // Fig. 5.24: fig05_24.cpp // Card shuffling dealing program. #include <iostream> using std::cout; using std::left; using std::right; #include <iomanip> using std::setw; #include <cstdlib> #include <ctime> // prototypes for rand and srand // prototype for time 47 Outline fig05_24.cpp (1 of 4) // prototypes void shuffle( int [][ 13 ] ); void deal( const int [][ 13 ], const char *[], const char *[] ); int main() suit array contains { to char arrays. // initialize suit array const char *suit[ 4 ] = { "Hearts", "Diamonds", "Clubs", "Spades" }; pointers 2003 Prentice Hall, Inc. All rights reserved. 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 // initialize face array const char *face[ 13 ] = { "Ace", "Deuce", "Three", "Four", "Five", "Six", "Seven", "Eight", "Nine", "Ten", "Jack", "Queen", "King" }; // initialize deck array int deck[ 4 ][ 13 ] = { 0 }; srand( time( 0 ) ); shuffle( deck ); deal( deck, face, suit ); return 0; } // end main // indicates successful termination 48 Outline fig05_24.cpp (2 of 4) // seed random number generator face array contains pointers to char arrays. 2003 Prentice Hall, Inc. All rights reserved. 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 // shuffle cards in deck void shuffle( int wDeck[][ 13 ] ) { int row; int column; // for each of the 52 cards, choose slot of deck randomly for ( int card = 1; card <= 52; card++ ) { // choose new random location until unoccupied slot found Current position is at do { randomly selected row row = rand() % 4; column. column = rand() % 13; } while ( wDeck[ row ][ column ] != 0 ); // end do/while // place card number in chosen slot of deck wDeck[ row ][ column ] = card; } // end for } // end function shuffle 49 Outline fig05_24.cpp (3 of 4) and 2003 Prentice Hall, Inc. All rights reserved. 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 // deal cards in deck void deal( const int wDeck[][ 13 ], const char *wFace[], const char *wSuit[] ) { // for each of the 52 cards for ( int card = 1; card <= 52; card++ ) // loop through rows of wDeck for ( int row = 0; row <= 3; row++ ) // loop through columns of wDeck for current row for ( int column = 0; column <= 12; column++ ) // if 50 Outline fig05_24.cpp (4 of 4) Cause face to be output right Cause in field of 5 justified suit to be output left if slot contains current card, display card justified characters.in field of 8 ( wDeck[ row ][ column ] == card ) { characters. cout << setw( 5 ) << right << wFace[ column ] << " of " << setw( 8 ) << left << wSuit[ row ] << ( card % 2 == 0 ? '\n' : '\t' ); } // end if } // end function deal 2003 Prentice Hall, Inc. All rights reserved. Nine Five Queen Jack Jack Three Ten Ace Seven Six Ace Nine Six Ten Four Ten Eight Jack Four Seven Queen Nine Deuce King Queen Five of of of of of of of of of of of of of of of of of of of of of of of of of of Spades Spades Diamonds Spades Diamonds Clubs Clubs Hearts Spades Hearts Clubs Hearts Spades Spades Clubs Hearts Hearts Hearts Diamonds Hearts Spades Clubs Hearts Clubs Clubs Hearts Seven Eight Three Five Three Six Nine Queen Deuce Deuce Deuce Seven Eight King Ace Four Eight Ten King King Four Six Jack Three Five Ace of of of of of of of of of of of of of of of of of of of of of of of of of of Clubs Clubs Hearts Diamonds Diamonds Clubs Diamonds Hearts Spades Clubs Diamonds Diamonds Diamonds Hearts Spades Spades Spades Diamonds Diamonds Spades Hearts Diamonds Clubs Spades Clubs Diamonds 51 Outline fig05_24.cpp output (1 of 1) 2003 Prentice Hall, Inc. All rights reserved. 52 5.11 Function Pointers Pointers to functions Contain address of function Similar to how array name is address of first element Function name is starting address of code that defines function Function pointers can be Passed to functions Returned from functions Stored in arrays Assigned to other function pointers 2003 Prentice Hall, Inc. All rights reserved. 53 5.11 Function Pointers Calling functions using pointers Assume parameter: bool ( *compare ) ( int, int ) Execute function with either ( *compare ) ( int1, int2 ) Dereference pointer to function to execute OR compare( int1, int2 ) Could be confusing User may think compare name of actual function in program 2003 Prentice Hall, Inc. All rights reserved. 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 // Fig. 5.25: fig05_25.cpp // Multipurpose sorting program using function pointers. #include <iostream> using std::cout; using std::cin; using std::endl; #include <iomanip> using std::setw; // prototypes void bubble( int [], const int, bool (*)( int, int ) ); void swap( int * const, int * const ); bool ascending( int, int ); bool descending( int, int ); 54 Outline fig05_25.cpp (1 of 5) Parameter is pointer to function that receives two integer parameters and returns bool result. int main() { const int arraySize = 10; int order; int counter; int a[ arraySize ] = { 2, 6, 4, 8, 10, 12, 89, 68, 45, 37 }; 2003 Prentice Hall, Inc. All rights reserved. 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 cout << "Enter 1 to sort in ascending order,\n" << "Enter 2 to sort in descending order: "; cin >> order; cout << "\nData items in original order\n"; // output original array for ( counter = 0; counter < arraySize; counter++ ) cout << setw( 4 ) << a[ counter ]; // sort array in ascending order; pass function ascending // as an argument to specify ascending sorting order if ( order == 1 ) { bubble( a, arraySize, ascending ); cout << "\nData items in ascending order\n"; } // sort array in descending order; pass function descending // as an agrument to specify descending sorting order else { bubble( a, arraySize, descending ); cout << "\nData items in descending order\n"; } 55 Outline fig05_25.cpp (2 of 5) 2003 Prentice Hall, Inc. All rights reserved. 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 // output sorted array for ( counter = 0; counter < arraySize; counter++ ) cout << setw( 4 ) << a[ counter ]; cout << endl; return 0; } // end main // indicates successful termination 56 Outline fig05_25.cpp (3 of 5) compare is pointer // multipurpose bubble sort; parameter compare is a pointer to to function that receives two // the comparison function that determines sorting order integer parameters and returns void bubble( int work[], const int size, bool (*compare)( int, int ) ) bool result. { // loop to control passes Parentheses necessary to for ( int pass = 1; pass < size; pass++ ) indicate pointer to function // loop to control number of comparisons per pass Call passed function for ( int count = 0; count < size - 1; count++ ) // if adjacent elements are if ( (*compare)( work[ count ], work[ count + 1 ] ) ) swap( &work[ count ], &work[ count + 1 ] ); compare; dereference pointer to execute function. out of order, swap them 2003 Prentice Hall, Inc. All rights reserved. 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 57 } // end function bubble // swap values at memory locations to which // element1Ptr and element2Ptr point void swap( int * const element1Ptr, int * const element2Ptr ) { int hold = *element1Ptr; *element1Ptr = *element2Ptr; *element2Ptr = hold; } // end function swap // determine whether elements are out of order // for an ascending order sort bool ascending( int a, int b ) { return b < a; // swap if b is less than a } // end function ascending Outline fig05_25.cpp (4 of 5) 2003 Prentice Hall, Inc. All rights reserved. 94 95 96 97 98 99 100 // determine whether elements are out of order // for a descending order sort bool descending( int a, int b ) { return b > a; // swap if b is greater than a } // end function descending 58 Outline fig05_25.cpp (5 of 5) fig05_25.cpp output (1 of 1) Enter 1 to sort in ascending order, Enter 2 to sort in descending order: 1 Data items in original order 2 6 4 8 10 12 89 68 Data items in ascending order 2 4 6 8 10 12 37 45 45 68 37 89 Enter 1 to sort in ascending order, Enter 2 to sort in descending order: 2 Data items in original order 2 6 4 8 10 12 89 68 Data items in descending order 89 68 45 37 12 10 8 6 45 4 37 2 2003 Prentice Hall, Inc. All rights reserved. 59 5.11 Function Pointers Arrays of pointers to functions Menu-driven systems Pointers to each function stored in array of pointers to functions All functions must have same return type and same parameter types Menu choice subscript into array of function pointers 2003 Prentice Hall, Inc. All rights reserved. 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 // Fig. 5.26: fig05_26.cpp // Demonstrating an array of pointers to functions. #include <iostream> using std::cout; using std::cin; using std::endl; // function prototypes void function1( int ); void function2( int ); void function3( int ); int main() Array initialized with names { of three functions; function // initialize array of 3 pointers to functions that each // take an int argument and return void names are pointers. void (*f[ 3 ])( int ) = { function1, function2, function3 }; int choice; cout << "Enter a number between 0 and 2, 3 to end: "; cin >> choice; 60 Outline fig05_26.cpp (1 of 3) 2003 Prentice Hall, Inc. All rights reserved. 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 // process user's choice while ( choice >= 0 && choice < 3 ) { // invoke function at location choice in array f // and pass choice as an argument (*f[ choice ])( choice ); cout << "Enter a number between 0 and 2, 3 to end: "; cin >> choice; } cout << "Program execution return 0; } // end main void function1( int a ) { cout << "You entered " << a << " so function1 was called\n\n"; } // end function1 61 Outline fig05_26.cpp (2 of 3) Call chosen function by dereferencing corresponding completed." << endl; element in array. // indicates successful termination 2003 Prentice Hall, Inc. All rights reserved. 49 50 51 52 53 54 55 56 57 58 59 60 61 void function2( int b ) { cout << "You entered " << b << " so function2 was called\n\n"; } // end function2 void function3( int c ) { cout << "You entered " << c << " so function3 was called\n\n"; } // end function3 62 Outline fig05_26.cpp (3 of 3) fig05_26.cpp output (1 of 1) Enter a number between 0 and 2, 3 to end: 0 You entered 0 so function1 was called Enter a number between 0 and 2, 3 to end: 1 You entered 1 so function2 was called Enter a number between 0 and 2, 3 to end: 2 You entered 2 so function3 was called Enter a number between 0 and 2, 3 to end: 3 Program execution completed. 2003 Prentice Hall, Inc. All rights reserved. 63 5.12.1 Fundamentals of Characters and Strings Character constant Integer value represented as character in single quotes 'z' is integer value of z 122 in ASCII String Series of characters treated as single unit Can include letters, digits, special characters +, -, * ... String literal (string constants) Enclosed in double quotes, for example: "I like C++" Array of characters, ends with null character '\0' String is constant pointer Pointer to string's first character Like arrays 2003 Prentice Hall, Inc. All rights reserved. 64 5.12.1 Fundamentals of Characters and Strings String assignment Character array char color[] = "blue"; Creates 5 element char array color last element is '\0' Variable of type char * char *colorPtr = "blue"; Creates pointer colorPtr to letter b in string "blue" "blue" somewhere in memory Alternative for character array char color[] = { ,,b, ,,l, ,,u, ,,e, ,,\0 }; 2003 Prentice Hall, Inc. All rights reserved. 65 5.12.1 Fundamentals of Characters and Strings Reading strings Assign input to character array word[ 20 ] cin >> word Reads characters until whitespace or EOF String could exceed array size cin >> setw( 20 ) >> word; Reads 19 characters (space reserved for '\0') 2003 Prentice Hall, Inc. All rights reserved. 66 5.12.1 Fundamentals of Characters and Strings cin.getline Read line of text cin.getline( array, size, delimiter ); Copies input into specified array until either One less than size is reached delimiter character is input Example char sentence[ 80 ]; cin.getline( sentence, 80, '\n' ); 2003 Prentice Hall, Inc. All rights reserved. 67 5.12.2 String Manipulation Functions of the String-handling Library String handling library <cstring> provides functions to Manipulate string data Compare strings Search strings for characters and other strings Tokenize strings (separate strings into logical pieces) 2003 Prentice Hall, Inc. All rights reserved. 68 5.12.2 String Manipulation Functions of the String-handling Library char *strcpy( char *s1, const char *s2 ); char *strncpy( char *s1, const char *s2, size_t n ); char *strcat( char *s1, const char *s2 ); Copies the string s2 into the character array s1. The value of s1 is returned. Copies at most n characters of the string s2 into the character array s1. The value of s1 is returned. Appends the string s2 to the string s1. The first character of s2 overwrites the terminating null character of s1. The value of s1 is returned. Appends at most n characters of string s2 to string s1. The first character of s2 overwrites the terminating null character of s1. The value of s1 is returned. Compares the string s1 with the string s2. The function returns a value of zero, less than zero or greater than zero if s1 is equal to, less than or greater than s2, respectively. char *strncat( char *s1, const char *s2, size_t n ); int strcmp( const char *s1, const char *s2 ); 2003 Prentice Hall, Inc. All rights reserved. 69 5.12.2 String Manipulation Functions of the String-handling Library int strncmp( const char *s1, const char *s2, size_t n ); Compares up to n characters of the string s1 with the string s2. The function returns zero, less than zero or greater than zero if s1 is equal to, less than or greater than s2, respectively. A sequence of calls to strtok breaks string s1 into tokens--logical pieces such as words in a line of text--delimited by characters contained in string s2. The first call contains s1 as the first argument, and subsequent calls to continue tokenizing the same string contain NULL as the first argument. A pointer to the current to-ken is returned by each call. If there are no more tokens when the function is called, NULL is returned. char *strtok( char *s1, const char *s2 ); size_t strlen( const char *s ); Determines the length of string s. The number of characters preceding the terminating null character is returned. 2003 Prentice Hall, Inc. All rights reserved. 70 5.12.2 String Manipulation Functions of the String-handling Library Copying strings char *strcpy( char *s1, const char *s2 ) Copies second argument into first argument First argument must be large enough to store string and terminating null character char *strncpy( char *s1, const char *s2, size_t n ) Specifies number of characters to be copied from string into array Does not necessarily copy terminating null character 2003 Prentice Hall, Inc. All rights reserved. 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 // Fig. 5.28: fig05_28.cpp // Using strcpy and strncpy. #include <iostream> using std::cout; using std::endl; #include <cstring> 71 Outline <cstring> contains prototypes for strcpy and strncpy. fig05_28.cpp (1 of 2) // prototypes for strcpy and strncpy int main() { char x[] = "Happy Birthday to You"; Copy entire string char y[ 25 ]; into array y. char z[ 15 ]; strcpy( y, x ); // copy contents of x into y in array x cout << "The string in array x is: " << x << "\nThe string in array y is: "Copy first '\n'; << y << 14 characters of array x into array y. Append terminating null Note that this // copy first 14 characters of x into z character. does not write strncpy( z, x, 14 ); // does not copy terminating null character. null character z[ 14 ] = '\0'; // append '\0' to z's contents cout << "The string in array z is: " << z << endl; 2003 Prentice Hall, Inc. All rights reserved. 26 27 28 29 72 return 0; } // end main // indicates successful termination Outline String to copy. Copied string using strcpy. fig05_28.cpp Copied first 14 characters (2 using strncpy.of 2) fig05_28.cpp output (1 of 1) The string in array x is: Happy Birthday to You The string in array y is: Happy Birthday to You The string in array z is: Happy Birthday 2003 Prentice Hall, Inc. All rights reserved. 73 5.12.2 String Manipulation Functions of the String-handling Library Concatenating strings char *strcat( char *s1, const char *s2 ) Appends second argument to first argument First character of second argument replaces null character terminating first argument Ensure first argument large enough to store concatenated result and null character char *strncat( char *s1, const char *s2, size_t n ) Appends specified number of characters from second argument to first argument Appends terminating null character to result 2003 Prentice Hall, Inc. All rights reserved. 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 // Fig. 5.29: fig05_29.cpp // Using strcat and strncat. #include <iostream> using std::cout; using std::endl; #include <cstring> 74 Outline <cstring> contains prototypes for strcat and strncat. fig05_29.cpp (1 of 2) // prototypes for strcat and strncat int main() { char s1[ 20 ] = "Happy "; char s2[] = "New Year "; char s3[ 40 ] = ""; Append s2 to s1. cout << "s1 = " << s1 << "\ns2 = " << s2; strcat( s1, s2 ); // concatenate s2 to s1 cout << "\n\nAfter strcat(s1, s2):\ns1 = " << s1 Append first 6 characters << "\ns2 = " << s2; of s1 to s3. // concatenate first 6 characters of s1 to s3 strncat( s3, s1, 6 ); // places '\0' after last character 2003 Prentice Hall, Inc. All rights reserved. 26 27 28 29 30 31 32 33 34 35 cout << "\n\nAfter strncat(s3, s1, 6):\ns1 = " << s1 Append s1 to s3. << "\ns3 = " << s3; strcat( s3, s1 ); // concatenate s1 to s3 cout << "\n\nAfter strcat(s3, s1):\ns1 = " << s1 << "\ns3 = " << s3 << endl; return 0; } // end main // indicates successful termination 75 Outline fig05_29.cpp (2 of 2) fig05_29.cpp output (1 of 1) s1 = Happy s2 = New Year After strcat(s1, s2): s1 = Happy New Year s2 = New Year After strncat(s3, s1, 6): s1 = Happy New Year s3 = Happy After strcat(s3, s1): s1 = Happy New Year s3 = Happy Happy New Year 2003 Prentice Hall, Inc. All rights reserved. 76 5.12.2 String Manipulation Functions of the String-handling Library Comparing strings Characters represented as numeric codes Strings compared using numeric codes Character codes / character sets ASCII American Standard Code for Information Interchage EBCDIC Extended Binary Coded Decimal Interchange Code 2003 Prentice Hall, Inc. All rights reserved. 77 5.12.2 String Manipulation Functions of the String-handling Library Comparing strings int strcmp( const char *s1, const char *s2 ) Compares character by character Returns Zero if strings equal Negative value if first string less than second string Positive value if first string greater than second string int strncmp( const char *s1, const char *s2, size_t n ) Compares up to specified number of characters Stops comparing if reaches null character in one of arguments 2003 Prentice Hall, Inc. All rights reserved. 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 // Fig. 5.30: fig05_30.cpp // Using strcmp and strncmp. #include <iostream> using std::cout; using std::endl; #include <iomanip> using std::setw; #include <cstring> 78 Outline fig05_30.cpp (1 of 2) <cstring> contains prototypes for strcmp and strncmp. // prototypes for strcmp and strncmp int main() { char *s1 = "Happy New Year"; char *s2 = "Happy New Year"; char *s3 = "Happy Holidays"; Compare s1 and s2. cout << << << << << << "s1 = " << s1 << "\ns2 = " << s2 Compare s1 "\ns3 = " << s3 << "\n\nstrcmp(s1, s2) = " setw( 2 ) << strcmp( s1, s2 ) "\nstrcmp(s1, s3) = " << setw( 2 ) strcmp( s1, s3 ) << "\nstrcmp(s3, s1) = " setw( 2 ) << strcmp( s3, s1 ); and s3. Compare s3 and s1. 2003 Prentice Hall, Inc. All rights reserved. 26 27 28 29 30 31 32 33 34 35 cout << << << << << Compare up to 6 characters of Outline Compare "\n\nstrncmp(s1, s3, 6) = " <<s1 and s3. up to 7 characters of setw( 2 ) s1 and s3, strncmp( s1, s3, 6 ) << "\nstrncmp(s1, s3. 7) = " Compare up to 7 characters of setw( 2 ) << strncmp( s1, s3, 7 ) fig05_30.cpp s3 and s1. "\nstrncmp(s3, s1, 7) = " (2 of 2) setw( 2 ) << strncmp( s3, s1, 7 ) << endl; // indicates successful termination 79 return 0; } // end main fig05_30.cpp output (1 of 1) s1 = Happy New Year s2 = Happy New Year s3 = Happy Holidays strcmp(s1, s2) = 0 strcmp(s1, s3) = 1 strcmp(s3, s1) = -1 strncmp(s1, s3, 6) = 0 strncmp(s1, s3, 7) = 1 strncmp(s3, s1, 7) = -1 2003 Prentice Hall, Inc. All rights reserved. 80 5.12.2 String Manipulation Functions of the String-handling Library Tokenizing Breaking strings into tokens, separated by delimiting characters Tokens usually logical units, such as words (separated by spaces) "This is my string" has 4 word tokens (separated by spaces) char *strtok( char *s1, const char *s2 ) Multiple calls required First call contains two arguments, string to be tokenized and string containing delimiting characters Finds next delimiting character and replaces with null character Subsequent calls continue tokenizing Call with first argument NULL 2003 Prentice Hall, Inc. All rights reserved. 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 // Fig. 5.31: fig05_31.cpp // Using strtok. #include <iostream> using std::cout; using std::endl; #include <cstring> 81 Outline <cstring> contains prototype for strtok. fig05_31.cpp (1 of 2) // prototype for strtok int main() { char sentence[] = "This is a sentence with 7 tokens"; char *tokenPtr; cout << "The string to be tokenized is:\n" << sentence First call to strtok begins << "\n\nThe tokens are:\n\n"; tokenization. // begin tokenization of sentence tokenPtr = strtok( sentence, " " ); 2003 Prentice Hall, Inc. All rights reserved. 21 22 23 24 25 26 27 28 29 30 31 32 // continue tokenizing sentence until tokenPtr becomes NULL while ( tokenPtr != NULL ) { cout << tokenPtr << '\n'; tokenPtr = strtok( NULL, " " ); // get next token } // end while cout << "\nAfter strtok, sentence = " << sentence << endl; return 0; } // end main // indicates successful 82 Outline fig05_31.cpp (2 of 2) Subsequent calls to strtok with NULL as first argument to indicate continuation. termination 2003 Prentice Hall, Inc. All rights reserved. The string to be tokenized is: This is a sentence with 7 tokens The tokens are: This is a sentence with 7 tokens After strtok, sentence = This 83 Outline fig05_31.cpp output (1 of 1) 2003 Prentice Hall, Inc. All rights reserved. 84 5.12.2 String Manipulation Functions of the String-handling Library Determining string lengths size_t strlen( const char *s ) Returns number of characters in string Terminating null character not included in length 2003 Prentice Hall, Inc. All rights reserved. 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 // Fig. 5.32: fig05_32.cpp // Using strlen. #include <iostream> using std::cout; using std::endl; #include <cstring> 85 Outline <cstring> contains prototype for strlen. fig05_32.cpp (1 of 1) // prototype for strlen int main() { char *string1 = "abcdefghijklmnopqrstuvwxyz"; char *string2 = "four"; char *string3 = "Boston"; cout << << << << << << "The length of \"" << string1 "\" is " << strlen( string1 ) "\nThe length of \"" << string2 "\" is " << strlen( string2 ) "\nThe length of \"" << string3 "\" is " << strlen( string3 ) << endl; // indicates successful termination Using strlen to determine length of strings. return 0; } // end main 2003 Prentice Hall, Inc. All rights reserved. The length of "abcdefghijklmnopqrstuvwxyz" is 26 The length of "four" is 4 The length of "Boston" is 6 86 Outline fig05_32.cpp output (1 of 1) 2003 Prentice Hall, Inc. All rights reserved.
Find millions of documents on Course Hero - Study Guides, Lecture Notes, Reference Materials, Practice Exams and more. Course Hero has millions of course specific materials providing students with the best way to expand their education.

Below is a small sample set of documents:

University of Texas - KIN - 310
STUDY NOTES/OUTLINE MUSCLE STRUCTURE &amp; FUNCTION 1. What are the three layers of connective tissue and the location of each? Epimysium outer, around the entire muscle, Perimysium middle, surrounding individual bundles of muscle fibers, Endomysium inner, ti
University of Texas - ADV - 319
ADV 319 Fall 2011 Stout8/24/11ADV 319 PSYCHOLOGY OF ADVERTISING (Unique # 05595) T, TH 3:30-5:00 P.M (UTC 4.132)Instructor: Patricia A. Stout, Ph.D. Email: pstout@mail.utexas.edu Offic e Hours: TH 12:30-2:30 p.m. &amp; by appointment Office: WWH 413 (Map:
Mohawk - COMM - LL01
LL041 Communications Exam Review Week 13 December 1 -5, 2008 To help prepare for all your exams, there is a brief section on Exam Strategies in your textbook in Chapter 7 pp. 191-194. What have you learned in Communications class this semester? A. Produci
Mohawk - COMM - LL01
Professor Betti Sheldrick betti.sheldrick@mohawkcollege.caLanguage Studies Department A126 (905) 575-1212 ext. 3949Communication Guidelines for in and out of Class 1) If you need to speak with me, contact me by phone (extension 3949) or e-mail to make a
Mohawk - COMM - LL01
LL041 Communications Fall 2008 How to Write a Summary A summary is a shorter, concise version of an original text. The length of a summary will depend on the assignment, but as a rule it should be no more than one third of the original text. A summary sho
Mohawk - COMM - LL01
9. Nov.3 - 71. Planning, Drafting, Editing - Chap. 1 2. Constructing Logical Paragraphs - Chap. 5 3. Research and Report Writing Skills Chap. 7 4. Team Formation and Topic Selection (Friday) 1. Drafting and Editing the Technical Report Chap. 10 2. Progre
Mohawk - COMM - LL01
LL041 Communications/Fall 2008 Progress Report 5%November 14, 2008Write a progress report, in memo format, to provide me with an update on your teamwork project. A. Be sure to use correct grammar, sentence structure and vocabulary. Try to stretch your w
Mohawk - COMM - LL01
LL041 Communications Week 9 Team Code of Conduct TemplateOnce you have completed your team pre-workYou will complete the Team Code of Conduct Contract. To do this, you must edit and add to the template below to include the performance standards that you
Mohawk - COMM - LL01
LL041 Communications Week 9 Team Code of Conduct TemplateOnce you have completed your team pre-workYou will complete the Team Code of Conduct Contract. To do this, you must edit and add to the template below to include the performance standards that you
Mohawk - COMM - LL01
Technical Report StructureUsing the SIDCRA formula Developing research questions Referencing your sourcesGet Organized!1. Don't simply start writing without thinking about the structure. 2. Use the following format/structure, which works for almost any
Mohawk - COMM - LL01
Tips for Preparation and Delivery of Oral PresentationsPreparing the Oral Report Do your research carefully Focus on the audience's needs and experience Prepare note cards with an outline of main points Prepare visual aids Anticipate questions from t
Mohawk - COMM - LL01
Report Introduction: Getting Started1. Key parts of report introduction 2. Writing task draft outline of introduction1Today's Activity: Getting Started1. Brainstorm a number of potential topics. 2. Turn each topic into a governing question. 3. Think o
Mohawk - COMM - LL01
Report Introduction: Getting Started1. Key parts of report introduction 2. Writing task draft outline of introduction1Today's Activity: Getting Started1. Brainstorm a number of potential topics. 2. Turn each topic into a governing question. 3. Think o
Mohawk - COMM - LL01
Week 11 -12 Course InformationLL041 Communications Fall 2008Please read the list of important information carefully. 1) Friday's class will be held in the same micro labs as last week: Green Section - 9:30 a.m. in A012 (basement level A-wing) Blue Secti
Mohawk - COMM - LL01
Working in Groups1. 2. 3.Group dynamics Putting it in writing Assigning rolesWorking in a Group Three categories of messages: Informational Procedural Interpersonal Time management Preparation Focus Mutual respect Commitment List some rules for suc
Mohawk - EE - 147
1 MOHAWK COLLEGE OF APPLIED ARTS AND TECHNOLOGY COURSE CODE - EE148 COURSE OUTLINECOURSE NAME - Electricity Lab- Fennell Campus Delivery PROGRAM NAME - Two-Year Technician / Three-Year Technologist DURATION - Total Hrs.: 52 ; Total Wks.: 13 ; DEPARTMENT
Mohawk - EE - 147
5 1 EXPERIMENT # 1: INTRODUCTION TO THE ELECTRICAL LABORATORY COURSETECHNICAL OBJECTIVES 1. 2. 3. 4. To learn about computer generated assignments. To learn to use an analogue meter. To learn how to use a protoboard. To learn about Safety. 1. 2. 3.BEHAV
Mohawk - EE - 147
15 1EXPERIMENT # 2: RESISTOR COLOUR CODE PRE-LAB INSTRUCTIONS Most of the resistors found in electronic equipment are the fixed type. This means that their resistance cannot be varied. The most common types of fixed resistors are &quot;Composition&quot; and &quot;Wire W
Mohawk - EE - 147
23 1EXPERIMENT #3: OHM'S LAW EXPERIMENT PRE-LAB INSTRUCTIONS PART I - OHM'S LAW When George Simon Ohm investigated the relationship between voltage and current, he found that generally, the ratio of supply voltage (E) to the resulting current (I) was cons
Mohawk - EE - 147
33 1EXPERIMENT # 4: SERIES CIRCUITS (Note, this is a two period lab in order to allow the lecture to catch up with the lab if necessary.) PRE-LAB INSTRUCTIONS RESISTORS IN SERIES Components are connected in series for two main reasons. One, is to control
Mohawk - EE - 147
EE147 Problems, Floyd 7th Edition Test Topic Quantities and Units Voltage, Current, Resistance Ohm's Law Energy and Power Series DC Resistive Circuits Parallel DC Resistive Circuits Series/Parallel DC Resistive Circuits Circuit Theorems (Superposition onl
Mohawk - EE - 147
EE147 Problems, Floyd 8th Edition Problems in bold are selected for final exam review Test Topic Quantities and Units Voltage, Current, Resistance Ohm's Law Energy and Power Series DC Resistive Circuits Parallel DC Resistive Circuits Series/Parallel DC Re
Mohawk - EE - 147
Electricity EE147 Final Exam Mark Breakdown, Fall 2008 Resistance Power and Energy DC circuits Mesh/loop and Superposition Capacitors Magnetism Inductance AC fundamentals and transformers AC Circuits Total 1 5 18 7 4 3 6 12 24 _ 80
Mohawk - EE - 147
EE147 Fall 2008 Addendum for Technology Classes OnlyPlease issue this addendum, in print, to the Technology classes that are enrolled in EE147 for the fall 2008 semester.Addendums to the EE147 outline: Refer to the attached pages.1. Page 5, Module #4 R
Mohawk - ELEC - 10040
Mohawk - ELEC - 10040
DIGITAL PRINCIPLES I/O SUPPORT CIRCUIT You must build this circuit exactly the way it is shown and have it completed in order to perform LAB#2. Digital I.C.s require input and output. For simple circuits a function generator, a DMM and Scope are sufficien
Mohawk - ELEC - 10040
Mohawk - ELEC - 10040
Mohawk - ELEC - 10040
Mohawk - ELEC - 10040
Mohawk - ELEC - 10040
Mohawk - ELEC - 10040
Digital Principles Problem Set from Floyd, 10th edition: Chapter 2: #5,11,13,15,16,21-28,33,34,37-42,45,47,49,51 Chapter 3: #1,5,7,8,9,11,12,15,17,18,19,20,21,22,24,25 Chapter 4: #1,3,5,6,8,9,11,13,14,15,20,21,22,31,33,34,35,41,43,45 (Note, answer for #41
Mohawk - ELEC - 10040
Mohawk - ELEC - 10040
Mohawk - ELEC - 10040
Mohawk - ELEC - 10040
Mohawk - ELEC - 10040
Hello Students, Your instructions for lab #8 are as follows: Lab#7 was based on two predesigned combinational logic circuits one added two binary values and the other was used to compare the magnitude of two binary values. These arithmetic functions play
Mohawk - ELEC - 10040
Hello Students, Your instructions for lab #8 are as follows: Lab#7 was based on two predesigned combinational logic circuits one added two binary values and the other was used to compare the magnitude of two binary values. These arithmetic functions play
Mohawk - ELEC - 10040
Mohawk - ELEC - 10040
0.4&quot; AlInGaP Seven-Segment Numeric LED DisplayLTS-4X01A LTD-4000 Series LTC-4000Features0.4 inch (10.0mm) digit height. Choices of three bright colors: AlInGaP super red/AlInGaP yellow orange/AlInGaPyellow. Low power requirement. Excellent characters a
Mohawk - ELEC - 10040
0.4&quot; AlInGaP Seven-Segment Numeric LED DisplayLTS-4X01A LTD-4000 Series LTC-4000Features0.4 inch (10.0mm) digit height. Choices of three bright colors: AlInGaP super red/AlInGaP yellow orange/AlInGaPyellow. Low power requirement. Excellent characters a
Mohawk - ELEC - 10040
Topics for Test #1 Major Topics Highlighted A. analog vs digital, digital signals, digital values, binary, basic gates, IC package type/pinout. B. weighted number systems, decimal, binary, signed numbers, BCD (Binary Coded Decimal), hexadecimal, ASCII (Am
Mohawk - ELEC - 10040
Mohawk - COMP - EE367
EE251 Formulas IF = (VBIAS - VF) RLIMIT PIV = Vp(sec) VAVG = VP(out) Vp(out) = Vp(sec) - VDIODE(S) Vp(out) = (Vp(sec) 2) - 0.7 VVsec = (Nsec Npri) VpriVAVG = 2 VP(out) PIV = 2Vp(out) + 0.7 V r = Vr(pp) VDCVp(out) = Vp(sec) - 1.4 V Vr(pp) = ( RLC)-1 VP
Mohawk - COMP - EE367
EE251 Formulas #2 Formulas DC = IC IE = DC ( DC + 1) Av = Vout VinDC =hFE = IC IB DC = DC (1 DC) ac= hfe = Ic IbIB = IE (DC + 1) PD= VCE ICIC(sat) = VCC (RC + RE)hie = Rin(base) = ac(re + RE) = Vb IbBASE BIAS IB = (VBB - VBE) RB VCE = VCC - IC RC VC
Mohawk - COMP - EE367
Ne = 2n2EE251 Formulas IF = (VBIAS - VF) RLIMIT VAVG = VP(out) Vsec = (Nsec Npri) Vpri VAVG = 2 VP(out) Vp(out) = Vp(sec) - VDIODE(S) Vp(out) = (Vp(sec) 2) - 0.7 VPIV = Vp(sec)PIV = 2Vp(out) + 0.7 V ZZ = VZ IZ P D = V Z IZVp(out) = Vp(sec) - 1.4 V V
Mohawk - COMP - EE367
MOHAWK COLLEGE OF APPLIED ARTS AND TECHNOLOGYEE367COURSE OUTLINE COURSE NAME: PROGRAM NAME: DURATION: DEPARTMENT: FACULTY: Personal Computers Common Technologist Total Hrs.: 41; Total Wks.: 13+1; Electrotechnology Engineering and Health Technology Hrs./
Mohawk - COMP - EE367
MOHAWK COLLEGE OF APPLIED ARTS AND TECHNOLOGYEE368COURSE OUTLINE COURSE NAME: PROGRAM NAME: DURATION: DEPARTMENT: FACULTY: Personal Computers Lab Common Technologist Total Hrs.: 39; Total Wks.: 13 Electrotechnology Engineering and Health Technology Hrs.
Mohawk - COMP - EE367
Electronic Devices Problems Electronic Devices by Floyd, 7 Ed. Ch. 1, #13, 1619 inclusive =5 questions Ch. 2, #19, 1117, 1921, 2429, 31, 36 = 27 questions Ch. 3, #13, 617, 20 = 16 questions Ch. 4, #518, 23, 25, 26 = 17 questions Ch. 5, #113, 1520, 30 = 20
Mohawk - COMP - EE367
LAB MODULE #1 INTRODUCTION TO LAB TOURING THE LAB RESOURCES OBJECTIVES: The student must be able to: 1. Describe safety and house keeping issues for lab room. 2. Identify the equipment and be able to obtain detailed information about equipment from within
Mohawk - COMP - EE367
1LAB MODULE #2 SYSTEM HARDWARE COMPONENTS - RECOGNITION AND INSTALLATION OBJECTIVES: After completing this exercise, the student should be able to: - obtain technical information about systems from the manufacturer's web site - list and describe all that
Mohawk - COMP - EE367
1LAB MODULE #3 COMPUTER PORTS and PERIPHERALS EXTERNAL EXPANSION OBJECTIVES: After completing this exercise, the student should be able to: - identify the ports by their connectors - describe port connectors and peripheral cables using appropriate trade n
Mohawk - COMP - EE367
1LAB MODULE #4 WINDOWS XP BASICS - INSTALLATION PLUS OBJECTIVES: After completing this exercise, the student should be able to: - determine if the software is compatible with the hardware - collect the required information before installing an operating s
Mohawk - COMP - EE367
1LAB MODULE #5 WINDOWS XP ADVANCED SYSTEM MANAGEMENT OBJECTIVES: After completing this exercise, the student should be able to: - explain how a login relates to system security and reliability - create appropriate passwords to create a secure login - cont
Mohawk - COMP - EE367
1LAB MODULE #6 MULTIMEDIA HARDWARE LAB OBJECTIVES: After completing this exercise, the student should be able to: - determine which devices are missing drivers - determine detailed information about the hardware device - install and verify operation of a
Mohawk - COMP - EE367
MOHAWK COLLEGE OF APPLIED ARTS AND TECHNOLOGY Department of Electrotechnology NETWORK FUNDAMENTALS LAB EE368 NETWORK INSTALLATION OBJECTIVES: After completing this exercise, the student should be able to: - identify NIC and Network components - install ne
Mohawk - COMP - EE367
MOHAWK COLLEGE OF APPLIED ARTS AND TECHNOLOGY Department of Electrotechnology PERSONAL COMPUTERS EE-368 Lab 8TCP/IP SUBNETTING AND LINKSYS ROUTER CONFIGURATION OBJECTIVES: To familiarize the student with deployment of a TCP/IP based network by having the
Mohawk - COMP - EE367
MOHAWK COLLEGE OF APPLIED ARTS AND TECHNOLOGY Department of Electrotechnology EE368 Lab 9Home Networking LabOBJECTIVES: To familiarize the student with Networking they can use at home: Create Users Setup Peer to Peer network Set up and Use Workgroups Se
Mohawk - COMP - EE367
EE368 LAB TEST INFORMATION WINTER 2009The lab test will take place in Weeks 12 and 13. The classes will be divided in half, at the professor=s discretion. The first half will do the test in Week 12, while the second half have the period off. The second h
Mohawk - COMP - EE367
Plot the transfer curve for VGS and ID when Vgs off = -2.7V and IDSS = 6.0 mA. . Draw the load line on the transfer characteristic curve. Label all important points on the curve and load line. Find the gain of this amplifier. VDD = 20 Vdc. R1= 4.7 M, R3 =
Mohawk - COMP - EE367
TLM access, Use a current version of internet explorer Use check browser settings to ensure the TLM will function properly. -WEB ADDRESShttp:/142.222.80.41/tlm40/ use student number without leading zeros as your user name and password to login.