Digital Electronics - Digital Arithmetic Operations and Circuits

Exercise :: Digital Arithmetic Operations and Circuits - General Questions

36. 

Solve this binary problem: 01110010 – 01001000 =

A. 00011010
B. 00101010
C. 01110010
D. 00111100

Answer: Option B

Explanation:

No answer description available for this question. Let us discuss.

37. 

What distinguishes the look-ahead-carry adder?

A. It is slower than the ripple-carry adder.
B. It is easier to implement logically than a full adder.
C. It is faster than a ripple-carry adder.
D. It requires advance knowledge of the final answer.

Answer: Option C

Explanation:

No answer description available for this question. Let us discuss.

38. 

Solve this binary problem:

A. 1001
B. 0110
C. 0111
D. 0101

Answer: Option C

Explanation:

No answer description available for this question. Let us discuss.

39. 

Half-adders can be combined to form a full-adder with no additional gates.

A. True
B. False

Answer: Option B

Explanation:

No answer description available for this question. Let us discuss.

40. 

Perform the following hex subtraction: ACE16 – 99916 =

A. 23516
B. 13516
C. 03516
D. 33516

Answer: Option B

Explanation:

No answer description available for this question. Let us discuss.