Digital Arithmetic Operations and Circuits Questions

• A binary sum is made up of only 1s and 0s.
• Full adders can add two numbers and need not have a carry input or a carry output.
• ALU circuits cannot be cascaded to perform functions on more than four bits.
• Constants must be included in a package.
• The carry-out of a binary adder is identified using the summation symbol, sigma.
• If [A] = 10 and [B] = 01, then [A] + [B] = [ ].
• Digital computers use an easier method to subtract binary numbers, called one's complement.
• A 74HC283 can be used to implement a 4-bit full adder.
• The solution to the binary problem 0101 + 1111 is 10100.
• 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.
• When the 2's-complement system is used, the number to be subtracted is changed to its 2's complement and then added to the minuend.