Digital Arithmetic Operations and Circuits MCQs

Question 1

If B[7..0] = 10100101, what is the value of B[6..2]?

Accepted Answer

01001

Answer

10100

Answer

10010

Answer

00101

Question 2

How many inputs must a full-adder have?

Accepted Answer

3

Answer

4

Answer

2

Answer

5

Question 3

Determine the two's-complement of each binary number. 00110 00011 11101

Accepted Answer

11010 11101 00011

Answer

11001 11100 00010

Answer

00111 00010 00010

Answer

00110 00011 11101

Question 4

Solve this binary problem: 01110010 – 01001000 =

Accepted Answer

00101010

Answer

00011010

Answer

01110010

Answer

00111100

Question 5

What distinguishes the look-ahead-carry adder?

Accepted Answer

It is faster than a ripple-carry adder.

Answer

It is slower than the ripple-carry adder.

Answer

It is easier to implement logically than a full adder.

Answer

It requires advance knowledge of the final answer.

Question 6

Perform the following hex subtraction: ACE16 – 99916 =

Accepted Answer

13516

Answer

23516

Answer

03516

Answer

33516

Question 7

Which of the following is correct for full adders?

Accepted Answer

In a parallel full adder, the first stage may be a half adder.

Answer

Full adders have the capability of directly adding decimal numbers.

Answer

Full adders are used to make half adders.

Answer

Full adders are limited to two inputs since there are only two binary digits.

Question 8

Convert each of the signed decimal numbers to an 8-bit signed binary number (two's-complement). +7 –3 –12

Accepted Answer

0000 0111 1111 1101 1111 0100

Answer

1000 0111 0111 1101 0111 0100

Answer

0000 0111 0000 0011 0000 1100

Answer

0000 0111 1000 0011 1000 1100

Question 9

What is one disadvantage of the ripple-carry adder?

Accepted Answer

It is slow due to propagation time.

Answer

The interconnections are more complex.

Answer

More stages are required to a full adder.

Answer

All of the above.