Question 1 (3 points) In binary addition, 0111 + 0001 = ________. Question 1 opt

Question

Question 1 (3 points)

In binary addition, 0111 + 0001 = ________.

Question 1 options:

1000

111

1001

1110

Save

Question 2 (4 points)

In binary subtraction, 100 - 001 = ________.

Question 2 options:

00

10

1001

11

Save

Question 3 (4 points)

Perform the following binary subtraction:
11011 - 111 = ________.

Question 3 options:

100010

10111101

0011

10100

Save

Question 4 (3 points)

In binary multiplication, 11 × 110 = ________.

Question 4 options:

11111

10010

10110

11001

Save

Question 5 (4 points)

What is the minimum number of bits required to represent -14310 as a signed binary number in 2's-complement form?

Question 5 options:

9

10

8

7

Save

Question 6 (4 points)

The following is a 2's-complement signed binary number: 100000000. What is its decimal value?

Question 6 options:

-010

-25510

-25610

-12810

Save

Question 7 (4 points)

The 5-bit 2's-complement equivalent of 1210 is:

Question 7 options:

10100

00100

01100

11100

Save

Question 8 (3 points)

When performing subtraction by 2's-complement addition:

Question 8 options:

The minuend and subtrahend are both changed to the 2's-complement.

The minuend and subtrahend are both left in their original form.

The minuend is left in its original form and the subtrahend is changed to its 2's-complement.

The minuend is changed to 2's-complement and the subtrahend are both changed to the 2's-complement.

Save

Question 9 (4 points)

4CA516 + FEA216 = __________

Question 9 options:

15C4716

14B4716

14C4716

2FB4716

Save

Question 10 (3 points)

How many inputs must a full-adder have?

Question 10 options:

5

2

4

3

Save

Question 11 (4 points)

Which of the following represents the 2's-complement of the hexadecimal number 2AF?

Question 11 options:

E50

D51

E51

D50

Save

Question 12 (3 points)

A half adder is normally used when a carry input may be applied.

Question 12 options:

Save

Question 13 (3 points)

In a sign-magnitude format, a "1" in the sign bit position indicates the number is negative.

Question 13 options:

Save

Question 14 (3 points)

Only four possible cases can occur when adding two binary bits.

Question 14 options:

Save

Question 15 (3 points)

The 1's-complement of 1010 is 0101.

Question 15 options:

Save

Question 16 (4 points)

The number -910 is to be stored in an 8-bit register as a signed binary number in 2's-complement form. Which of the following represents the register contents?

Question 16 options:

11111010

00110101

00011101

11110111

Save

Question 17 (3 points)

When using Full-Adder circuit, if in a particular digit position (column) the Augend’s bit is 1, the Addend  bit is 1 and the Carry-in bit is 1, the Sum and Carry-out bits are respectively:

Question 17 options:

Save

Question 18 (3 points)

When using Full-Sbtractor circuit, if in a particular digit position (column) the Minuend’s bit is 1, the Subtradend's  bit is 1 and the Borrow-in bit is 1, the Difference and Borrow-out bits are respectively:

Question 18 options:

Save

Question 19 (4 points)

A computer has a word length of 8 bits (including sign). If 2’s complement is used to represent negative numbers. What range of numbers can be stored in the computer? If 1’s complement is used?

Question 19 options:

Between -127 and 127 in 2's complement and between -127 and 127 in one's complement

Between -128 and 127 in 2's complement and between -127 and 127 in one's complement

Between -127 and 127 in 2's complement and between -127 and 128 in one's complement

Between -127 and 128 in 2's complement and between 0 and 256 in one's complement

Save

Question 20 (4 points)

The figure above depicts the binary subtraction 1101001 – 110110. If each bi represents the value of borrow in (1 if borrow required or 0 if borrow not required) for the respective column. What are the values of the borrow b6, b5, b4, b3, b2 and b1?

Question 20 options:

b6, b5, b4, b3, b2, b1 = 1 0 0 1 0 0

b6, b5, b4, b3, b2, b1 = 0 1 0 1 1 0

b6, b5, b4, b3, b2, b1 = 1 1 0 1 1 1

b6, b5, b4, b3, b2, b1 = 1 1 0 1 1 0

Save

Question 21 (5 points)

Suppose that A=101010 and B=011101 are treated first as 1’s complement numbers and perform the following operations:

a)      A + B and b)   A – B

Now suppose that the given numbers A and B are treated as a 2’s complements and the operations a) and b) are performed in 2’s complement. Regarding overflow in the operations which one of the statements is true? You may choose multiple anwers.

Question 21 options:

A + B     results in overflow when performed in 1’s complement

A – B      results in overflow when performed in 1’s complement

A + B     results in overflow when performed in 2’s complement

A – B      results in overflow when performed in 2’s complement

Neither Operations a) or b) in 1's or 2's complement results in overflow

1000

111

1001

1110

Explanation / Answer

1)0111+0001 -> 1000
2)100-001   ->011
3)11011-00111 ->10100
4)11*110 ->10010
5)10
6)-25510
7)00100
8)The minuend is left in its original form and the subtrahend is changed to its 2's-complement.
9)14B4716
10)3 inputs
11)D51
12)True
13)True
14)True
15)True
16)00110101
17)1,0
18)0,1
19)Between -128 and 127 in 2's complement and between -127 and 127 in one's complement
20)b6, b5, b4, b3, b2, b1 = 1 1 0 1 1 1
21)A – B      results in overflow when performed in 1’s complement

Related Questions

Navigate

• Browse (All)
• Browse Q
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.