Curioustab
Aptitude
General Knowledge
Verbal Reasoning
Computer Science
Interview
Aptitude
General Knowledge
Verbal Reasoning
Computer Science
Interview
Home
»
Digital Electronics
»
Digital Arithmetic Operations and Circuits
Solve this BCD problem: 0100 + 0110 =
00010000BCD
00010111BCD
00001011BCD
00010011BCD
Correct Answer:
00010000BCD
← Previous Question
Next Question→
More Questions from
Digital Arithmetic Operations and Circuits
The truth table for a full adder is shown below. What are the values of X, Y, and Z?
Convert each of the following signed binary numbers (two's-complement) to a signed decimal number. 00000101 11111100 11111000
Subtract the following binary numbers. 0101 1000 1010 0011 1101 1110 –0010 0011 –0011 1000 –0101 0111
The 2's-complement system is to be used to add the signed binary numbers 11110010 and 11110011. Determine, in decimal, the sign and value of each number and their sum.
Find the 2's complement of –1101102.
The carry propagation delay in full-adder circuits:
Why is a fast-look-ahead carry circuit used in the 7483 4-bit full-adder?
Convert each of the signed decimal numbers to an 8-bit signed binary number (two's-complement). +7 –3 –12
What are constants in VHDL code?
What distinguishes the look-ahead-carry adder?
Discussion & Comments
No comments yet. Be the first to comment!
Name:
Comment:
Post Comment
Join Discussion
Discussion & Comments