Question 1
What is the result of the bitwise operation 1010 AND 1100 in binary?
Bitwise AND yields 1 only when both bits are 1: 1010 AND 1100 = 1000.
What is the result of the bitwise operation 1010 AND 1100 in binary?
Bitwise AND yields 1 only when both bits are 1: 1010 AND 1100 = 1000.
What is Booth's algorithm used for in digital computer design?
Booth's multiplication algorithm multiplies two signed binary numbers in 2's complement representation efficiently.
Which of the following techniques is used for error detection in digital data communication?
Hamming code, CRC, and Checksum are all established techniques used for error detection in digital communications.
What is the 8-bit signed 2's complement range for decimal numbers?
For an n-bit signed 2's complement representation, the range of representable integers is from -$2^{n-1}$ to +$2^{n-1}-1$. For n = 8, -$2^7$ = -128 to +$2^7-1$ = +127.
Convert the octal number (345)8 to its decimal equivalent.
$(345)8 = 3*8^2 + 4*8^1 + 5*8^0 = 3*64 + 4*8 + 5*1 = 192 + 32 + 5 = 229.$