Answer:
input number
calculate modulus of the number and 5
compare outcome to 0
if 0 then output "divisible by 5"
else output "not divisible by 5"
Explanation:
The modulo operator is key here. It returns the remainder after integer division. So 8 mod 5 for example is 3, since 5x1+3 = 8. Only if the outcome is 0, you know the number you divided is a multiple of 5.
Answer:
B. 11110111
Explanation:
Binary representation of number 9 = 00001001
Binary representation of -9 would involve calculating the twos complement representation of 00001001
First we compute the ones complement of this number by reversing the bits.
00001001 => 11110110
Next we calculate the twos complement representation by adding 1 to the ones complement.
11110110+1 = 11110111
So the final representation is 11110111.
It's often Linux since Linux is free, but it could be Windows.
Sjsjsjsjsjdhshshshshususs
