Question

Draw the flowchart of the program that will find the remainder of a positive integer entered by the user with another integer to be entered by the user, without using the remaining operator (%).

Answer 1

First, we will look at the algorithm that will find the remainder of a positive integer entered by the user with another integer to be entered by the user, without using the remaining operator (%). The algorithm is as follows:

1. Declare three variables number, divisor and remainder
2. Read the positive integer in a variable number and the number by which we have to divide the positive integer entered by the user in a variable 'divisor'
3. Keep on subtracting the divisor from the number and set/assign the calculated value after subtraction to the variable number, until the number becomes less than the divisor.
4. When/if the number becomes less than the divisor, it is the required remainder and hence assign the number to the remainder variable.
5. Print the remainder as the result.

The flowchart for the program is given below:

Start Declare integer variables number, divisor, and remainder Input and read number and divisor Yes if number< divisor NO remainder = number number = number - divisor (means subtract divisor from number) Print Remainder Stop

Thanks!