Question

7 minutes add the following regular unsigned base - 2 numbers using binary arithmetic - the answer boxes must show the correct bits and all carry bits must be in the correct boxes to receive full credit. the boxes are labeled a through x. keep in mind, every box entry should be a 1 or 0. suggestion: in saving time and keeping your answer organized, first work the problem using pencil and paper in determining the bits for a through x, then enter answers afterwards.

a c e g i k m o
b d f h j l n p

0 0 1 0 1 0 1 0
0 0 1 0 1 0 0 1
0 0 1 1 0 1 1 0
+0 0 1 1 1 0 0 0

q r s t u v w x

Explanation:

Step1: Start from right - most bit

0+1+0+0 = 1, no carry. So X = 1.

Step2: Second bit from right

0+0+1+0 = 1, no carry. So W = 1.

Step3: Third bit from right

1+0+1+0 = 0, carry 1. So V = 0, M = 1.

Step4: Fourth bit from right

0+1+0+1+1 (carry) = 1, carry 1. So U = 1, K = 1.

Step5: Fifth bit from right

1+1+1+1+1 (carry) = 1, carry 1. So T = 1, I = 1.

Step6: Sixth bit from right

0+0+1+1+1 (carry) = 1, carry 1. So S = 1, G = 1.

Step7: Seventh bit from right

0+0+1+1+1 (carry) = 1, carry 1. So R = 1, E = 1.

Step8: Eighth bit from right

0+0+0+0+1 (carry) = 1. So Q = 1, A = 0, C = 0, D = 0, F = 0, H = 0, J = 0, L = 0, N = 0, P = 0.

Answer:

A: 0, B: 0, C: 0, D: 0, E: 1, F: 0, G: 1, H: 0, I: 1, J: 0, K: 1, L: 0, M: 1, N: 0, O: 0, P: 0, Q: 1, R: 1, S: 1, T: 1, U: 1, V: 0, W: 1, X: 1