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
The solution to the binary problem 0101 + 1111 is 10100.
True
Correct Answer:
True
← Previous Question
Next Question→
More Questions from
Digital Arithmetic Operations and Circuits
The solution to the BCD problem 0101 + 0100 is 00001001BCD.
The solution to the binary problem 1011 × 0110 is 01100110.
A sign bit of "1" in the difference of a 2's-complement subtraction problem indicates the magnitude is negative and in true binary form.
Hexadecimal is a base 4 numbering system.
This logic gate is used to produce an arithmetic sum XOR.
The solution to the binary problem 1011 – 0111 is 1000.
10011100 in two's-complement notation has a decimal value of –100.
Binary division and decimal division use the same procedure.
A half-adder circuit would normally be used each time a carry input is required in an adder circuit.
The inputs of a full adder are labeled A1, B1, and Cin.
Discussion & Comments
No comments yet. Be the first to comment!
Name:
Comment:
Post Comment
Join Discussion
Discussion & Comments