Assignment

1
Assignment 10

• Noorisha Nawaz

2
Problem 11.14

• Error Checking

3
PSEUDOCODEProblem

• Enter the phone number
• Unload the operators
• Do error checking
• Return phone number
• End program

4
Flow ChartProblem 11.14
Start
Enter Number
Go into member file
End
Return the number
5
Header Source Codeerror.h
ifndef P11_14_H define P11_14_H include
ltiostream.hgt include ltiomanip.hgt include
ltstring.hgt include ltstdlib.hgt class PhoneNumber
friend ostream operatorltlt( ostream,
PhoneNumber ) friend istream operatorgtgt(
istream, PhoneNumber )
public PhoneNumber() private char phone
15 char areaCode 4 char exchange 4
char line 5 endif
6
Member File Source Code
include error.h" PhoneNumberPhoneNumber()
phone 0 '\0' areaCode 0 '\0'
exchange 0 '\0' line 0
'\0' ostream operatorltlt( ostream output,
PhoneNumber number ) output ltlt "(" ltlt
number.areaCode ltlt ") " ltlt number.exchange
ltlt "-" ltlt number.line ltlt '\n' return
output istream operatorgtgt( istream input,
PhoneNumber number ) cin.getline(
number.phone, 15 ) if ( strlen( number.phone
) ! 14 ) cin.clear( iosfailbit )
7
Member File Source Code
if ( number.phone 1 '0' number.phone 6
'0' number.phone 1 '1'
number.phone 6 '1') cin.clear(
iosfailbit ) if ( number.phone 2 ! '0'
number.phone 2 ! '1' ) cin.clear(
iosfailbit ) if ( !cin.fail() )
for ( int loop 0 loop lt 2 loop )
number.areaCode loop number.phone loop 1
number.exchange loop
number.phone loop 6
8
Member File Source Code
number.areaCode loop number.exchange loop
'\0' for ( loop 0 loop lt 3 loop
) number.line loop number.phone
loop 10 number.line loop '\0'
else cerr ltlt "Invalid phone number
entered.\n" exit( 1 ) return
input
9
Driver File Source Code
include error.h" int main() PhoneNumber
telephone cout ltlt "Enter a phone number in
the form [phone]\n" cin gtgt
telephone cout ltlt "The phone number entered
was " ltlt telephone ltlt endl return 0
10
OutputProblem 11.14
11
Problem 12.3

• Sorting

12
PSEUDOCODEProblem 12.3

• Write Sort Routine
• if number greater hold value then move up
• if number less then hold value then move down
• Set up the Array
• Give it values (in Int and Float Formats)
• Use the Sort Program
• Return Sorted Values

13
Flow ChartProblem 12.3
START
Enter Array
Sort
Sort Values
Return Values
END
14
Source Codetemplate
include ltiostream.hgt include ltiomanip.hgt //
Function template for bubbleSort template lt class
T gt void bubbleSort( T const array, int size
) void swap( T const, T const ) for
( int pass 1 pass lt size pass ) for (
int j 0 j lt size - pass j ) if (
array j gt array j 1 ) swap(
array j , array j 1 )
template lt class T gt void swap( T const
element1Ptr, T const element2Ptr ) T temp
element1Ptr element1Ptr element2Ptr elem
ent2Ptr temp
15
Driver File Source Code
int main() const int arraySize 10 int
a arraySize 10, 9, 8, 7, 6, 5, 4, 3, 2, 1
, i // Process an array of integers cout
ltlt "Integer data items in original order\n"
for ( i 0 i lt arraySize i ) cout ltlt
setw( 6 ) ltlt a i bubbleSort( a, arraySize
) // sort the array cout ltlt
"\nInteger data items in ascending order\n"
for ( i 0 i lt arraySize i ) cout ltlt
setw( 6 ) ltlt a i cout ltlt "\n\n" //
Process an array of floating point values
float b arraySize 10.1, 9.9, 8.8, 7.7,
6.6, 5.5, 4.4, 3.3,
2.2, 1.1
16
OutputProblem 11.14