Write two program segments (functions) that accomplish each of the following:
a) A function that Calculates the integer part of the quotient when integer a is divided by integer b.
b) A function that Calculates the integer remainder when integer a is divided by integer b.

Use the functions developed in (a) and (b) to write a function that inputs an integer between 1 and 32767 and prints it as a series of digits, each pair of which is separated by two spaces. For example, the integer 4562 should print as follows: 4 5 6 2

4
Contributors
5
Replies
6
Views
8 Years
Discussion Span
Last Post by latour1972

Do you know what quotient and remainder mean?

they've actually given you the psuedocode for it, if it helps to get you started, just pick two numbers and do the math operation on paper and that will help you write your functions...make sure you use the correct operators indicated by the results the psuedocode asks for. Your instructor should have shown you how to do spaces in a cout statement for your spacing problem.

I know quotient and remainder mean but I still cant figure that out.....

Hi latour1972,

``````// Two function to computing quotient and remainder
int quotient (int z ) { return z / 10; }
int reminder ( int z ) { return z % 10; }

// Simple solution to split int number into its digits
void demon ()
{  int n, d0, d1, d2, d3, d4;
cout << "Enter an integer between 1 and 32767: ";
cin >> n;
cout << n << endl;
d4 = reminder(n); n = quotient(n);
d3 = reminder(n); n = quotient(n);
d2 = reminder(n); n = quotient(n);
d1 = reminder(n); d0= quotient(n);
cout << d0 << "  " << d1 << "  " << d2 << "  " << d3 << "  " << d4 << endl;
}

//  Below solution works recursively. Do you understand this?
//  if you call split (4562), result is 4 5 6 2
void split(int n){
int d = n % 10; n = n / 10;
if ( n > 0) split (n);
cout << d << "  ";
}``````

krs,
tesu

tks.....
I am working on this.....and it helps me to understand....

Hi latour1972,

``````// Two function to computing quotient and remainder
int quotient (int z ) { return z / 10; }
int reminder ( int z ) { return z % 10; }

// Simple solution to split int number into its digits
void demon ()
{  int n, d0, d1, d2, d3, d4;
cout << "Enter an integer between 1 and 32767: ";
cin >> n;
cout << n << endl;
d4 = reminder(n); n = quotient(n);
d3 = reminder(n); n = quotient(n);
d2 = reminder(n); n = quotient(n);
d1 = reminder(n); d0= quotient(n);
cout << d0 << "  " << d1 << "  " << d2 << "  " << d3 << "  " << d4 << endl;
}

//  Below solution works recursively. Do you understand this?
//  if you call split (4562), result is 4 5 6 2
void split(int n){
int d = n % 10; n = n / 10;
if ( n > 0) split (n);
cout << d << "  ";
}``````

krs,
tesu

This topic has been dead for over six months. Start a new discussion instead.
Have something to contribute to this discussion? Please be thoughtful, detailed and courteous, and be sure to adhere to our posting rules.