Digital Electronics - Digital Arithmetic Operations and Circuits

Exercise : Digital Arithmetic Operations and Circuits - General Questions
36.
Solve this binary problem: 01110010 – 01001000 =
00011010
00101010
01110010
00111100
Answer: Option
Explanation:
No answer description is available. Let's discuss.

37.
What distinguishes the look-ahead-carry adder?
It is slower than the ripple-carry adder.
It is easier to implement logically than a full adder.
It is faster than a ripple-carry adder.
It requires advance knowledge of the final answer.
Answer: Option
Explanation:
No answer description is available. Let's discuss.

38.
Solve this binary problem:
1001
0110
0111
0101
Answer: Option
Explanation:
No answer description is available. Let's discuss.

39.
Half-adders can be combined to form a full-adder with no additional gates.
True
False
Answer: Option
Explanation:
No answer description is available. Let's discuss.

40.
Perform the following hex subtraction: ACE16 – 99916 =
23516
13516
03516
33516
Answer: Option
Explanation:
No answer description is available. Let's discuss.