Start
set num = 0
display " enter the number"
read num
if ( remainder (num / 2 ) = 0 )
display "yes"
else
display "no"
end
If the output of the above algorithm is "yes", it indicates that num is:

Correct option is A

1. Even test: num % 2 == 0 ⇔ even; num % 2 == 1 (or != 0) ⇔ odd (for nonnegative integers).
2. Negative numbers: Even/odd parity still holds: e.g., -4 % 2 == 0 → even.
3. No primality check: Primality requires divisibility tests beyond 2; not done here.
4. No Armstrong check: Armstrong (narcissistic) numbers involve sum of powered digits; unrelated.
5. I/O flow: Prompt → read → parity check → print "yes"/"no".
6. Edge case: num = 0 is even since 0 % 2 == 0.

Knowledge Booster

• Why not (b) Armstrong? Needs digit-power sum equality (e.g., 153); modulus by 2 says nothing about that.
• Why not (c) Odd? Odd numbers give remainder 1 (or -1), producing "no".
• Why not (d) Prime? Many even numbers aren’t prime (only 2 is even and prime); parity check doesn’t establish primality.