+1-315-636-4485
+91 98151-74050 
This quiz contains multiple-choice problems on computer fundamentals subtopics like sign-magnitude, Booth’s algorithm, complements, IEEE 32- and 64- bits, binary multiplication, and division.
The additive inverse of a number is the number that gives one as a result when added to the original number. True or false?
True
False
The 1’s complement of 1 in 4 bits is
0001
0
1001
1110
The binary number 111 in its 2’s complement form is
010
001
000
111
In both signed magnitude and 2’s complement, the positive and negative numbers are separated using
LSB
MSB
0
1
The signed magnitude representation of -9 is
00001001
11111001
10001001
11001
The single-precision format comprises of
4 bits
8 bits
16 bits
32 bits
If m is the 2’s complement and n is the binary number, then
m = n’
m = n’+1
m = n’-1
m = n
The possible number of bit patterns with 8 bits is
128
8
24
256
Which of the following is used for binary multiplication?
Restoring multiplication
Booth’s algorithm
Pascal’s rule
Digit-by-digit multiplication
The binary number obtained after applying RSC on 11010 will be
11101
10100
01101
01000
The result of >> of 11001 by 3-bits will be
01000
01111
00011
11111
Booth’s algorithm applies for
Decimal numbers
Binary numbers
Hexadecimal numbers
Octal numbers
If one performs Booth’s multiplication on the numbers 22*3, then 3 is referred to as the
Accumulator
Multiplicand
Quotient
Multiplier
What is the default value of the accumulator in Booth’s multiplication of two 4-bit binary numbers?
0
1
0000
00000
__ is a straightforward method of representing positive and negative numbers.
Radix
Complement
Signed magnitude
Encode
