Skip to content
OtisamLMS
Computing

Computing · Quick practice · answer shown after each question

Binary arithmetic and signed numbers

Question 1 of 10

Question 1 of 10

In binary addition, 1 + 1 + 1 equals

Question 2 of 10

Question 2 of 10

The number 39 in BCD is

Question 3 of 10

Question 3 of 10

A left shift by one place divides a binary number by 2.

Question 4 of 10

Question 4 of 10

BCD stores the whole number in pure binary.

Question 5 of 10

Question 5 of 10

In 8-bit two's complement the most negative value is −128.

Question 6 of 10

Question 6 of 10

Find the 8-bit two's complement representation of −37 and show your working.

Question 7 of 10

Question 7 of 10

Add the binary numbers 10110110 and 01101101, showing carries, and say whether overflow occurs in 8 bits.

Question 8 of 10

Question 8 of 10

0111₂ + 0001₂ = ___₂

Question 9 of 10

Question 9 of 10

Overflow happens when a result needs more bits than are available.

Question 10 of 10

Question 10 of 10

The 8-bit two's complement of −1 is ___.

Questions written by OtisamLMS in the style of the WASSCE. They are not WAEC past questions.