Write pseudocode that reads two numbers and divide one by another and display the quotient.

Exercise · Q1

Q. Write pseudocode that reads two numbers and divide one by another and display the quotient.

CBSENCERTSubjective· 2mImportance★★★★★est

42% · 15/36 Questions

✓ Free question

Concept understanding — Division Algorithm

The Division Algorithm: From Sharing to a Precise Rule

Think about what division really means. When you divide 17 apples among 5 friends, you can't give everyone a whole number of apples and have nothing left — unless you start cutting fruit. Each friend gets 3 apples, and 2 apples remain. That's the heart of the division algorithm: you can always split a number into equal groups, with a remainder smaller than the group size.

The word "algorithm" sounds intimidating, but it's just a step-by-step process. Here, the process is: given any two positive integers (the dividend and the divisor), you can find a unique quotient and a unique remainder. The remainder must be smaller than the divisor — otherwise you could give out one more whole group.

The Intuition

Imagine a number line. You start at 0 and take jumps of size $b$ (the divisor). You want to land as close as possible to $a$ (the dividend) without overshooting. The number of jumps you take is the quotient $q$ , and the distance you still need to cover to reach $a$ is the remainder $r$ .

For $a = 17$ and $b = 5$ :

Jump 1: 0 → 5
Jump 2: 5 → 10
Jump 3: 10 → 15
Jump 4 would take you to 20, which overshoots 17.

So $q = 3$ jumps, and you've covered $3 \times 5 = 15$ . The remaining distance is $17 - 15 = 2$ , so $r = 2$ . Notice $2 < 5$ — you can't make another full jump.

The Precise Statement

a

Two things make this powerful: existence (you can always find such $q$ and $r$ ) and uniqueness (there is only one correct pair). The condition $0 \le r < b$ is what forces uniqueness — if you allowed $r$ to be as large as $b$ or more, you could "steal" one more group and get a different $q$ .

Why "Algorithm"?

The name comes from the process you use to find $q$ and $r$ : keep subtracting $b$ from $a$ until what's left is less than $b$ . The number of subtractions is $q$ , and what's left is $r$ . For large numbers, you'd use long division instead, but the idea is identical.

Tip

A quick check: if $r = 0$ , then $b$ divides $a$ exactly. If $r > 0$ , the division is not exact. The remainder is always the "leftover" after making as many full groups as possible.

A Simple Example

Divide 43 by 6.

How many full groups of 6 fit into 43? $6 \times 7 = 42$ , and $6 \times 8 = 48$ is too big. So $q = 7$ .
Remainder: $43 - 42 = 1$ .
Check: $1 < 6$ , so it's valid.
Result: $43 = 6 \times 7 + 1$ .

What About Negative Numbers?

The division algorithm extends to negative dividends too, but the condition $0 \le r < b$ stays the same. For $a = -17$ and $b = 5$ :

You want $r$ between 0 and 4. The largest multiple of 5 that is less than or equal to $-17$ is $-20$ (since $-15$ is greater than $-17$ ). So $q = -4$ and $r = (-17) - (-20) = 3$ . Check: $-17 = 5 \times (-4) + 3$ , and $0 \le 3 < 5$ .

Watch out

A common mistake is to write $-17 = 5 \times (-3) + (-2)$ . Here $r = -2$ violates $0 \le r < b$ . The remainder must never be negative.

Why This Matters

The division algorithm is the foundation of:

Number theory (Euclid's algorithm for GCD, modular arithmetic)
Polynomial division (same idea, but with polynomials instead of integers)
Computer science (integer division and modulo operations in programming)

Every time you use long division, find a remainder, or work with modular arithmetic, you are applying the division algorithm — whether you realise it or not.

Important

The division algorithm is not a formula to memorise — it's a guarantee: any integer can be expressed uniquely as a multiple of another integer plus a remainder smaller than that integer. This simple fact unlocks most of elementary number theory.

Read the two numbers, divide, print the quotient:

INPUT num1
INPUT num2
COMPUTE quotient = num1 / num2
PRINT quotient

Equivalent Python check:

num1 = float(input())   # 20
num2 = float(input())   # 4
print(num1 / num2)

5.0

Watch out

If num2 is 0 the division is undefined — a careful version tests for it first.

✓Final answer

Pseudocode: input num1, num2; compute quotient = num1 / num2; print quotient (e.g. 20 and 4 give 5.0).

Input two numbers, compute num1 / num2, output the quotient — a four-line input–process–output pseudocode.

The idea. Pseudocode expresses the logic of a solution in plain structured English, free of any language's syntax. Every simple computation follows the same skeleton: input → process → output. Here the process is a single division whose result is called the quotient.

Pseudocode

DIVIDE_TWO_NUMBERS
    INPUT num1
    INPUT num2
    COMPUTE quotient = num1 / num2
    PRINT quotient
END

A safer version guards against division by zero:

DIVIDE_TWO_NUMBERS_SAFE
    INPUT num1
    INPUT num2
    IF num2 == 0 THEN
        PRINT "Division by zero is not possible"
    ELSE
        COMPUTE quotient = num1 / num2
        PRINT quotient
    END IF
END

Python verification

num1 = float(input("Enter first number: "))
num2 = float(input("Enter second number: "))
if num2 == 0:
    print("Division by zero is not possible")
else:
    print("Quotient =", num1 / num2)

Sample run

Enter first number: 20
Enter second number: 4
Quotient = 5.0

Watch out

Forgetting the num2 == 0 check is the classic pitfall — dividing by zero is undefined and crashes a real program (ZeroDivisionError in Python).

✓Final answer

The pseudocode reads num1 and num2, computes quotient = num1 / num2, and prints the quotient — e.g. inputs 20 and 4 print 5.0.

←Previous section · summarySummary →Next questionQ2 — Two friends decide who gets the last slice of a cake by flipping a coi…

Q.Write pseudocode that reads two numbers and divide one by another and display the quotient.

🎓Unlock everything free for 14 days

Unlock everything free for 14 days