Q. A decoder is required in case of a ______________

View solution

Q. __________________ is a straightforward method of representing positive and negative numbers.

View solution

Q. The additive inverse of a number is the number which when added to the original number gives 1 as a result.

View solution

Q. The 1’s complement of 1 in 4 bits is __________

View solution

Q. The binary number 111 in its 2’s complement form is ____________

View solution

Q. The sign magnitude representation of -9 is ___________

View solution

Q. If you are given a word of size n bits, the range of 2’s complement of binary numbers is ________

View solution

Q. In both signed magnitude and 2’s complement , positive and negative numbers are separated using ______________

View solution

Q. Single Precision format comprises of _________ bits.

View solution

Q. If m is the 2’s complement and n is the binary number, then ______________

View solution

Q. The possible number of bit patterns with 8 bits ________________

View solution

Q. Which of the following is used for binary multiplication?

View solution

Q. One extra bit is added on the left of a binary number, in case of Binary Multiplication using Booth’s Algorithm.

View solution

Q. The binary number obtained after applying RSC on 11010 will be ___________

View solution

Q. The result of >> of 11001 by 3-bits will be ______________

View solution

Q. Booth’s Algorithm is applied on _____________

View solution

Q. If Booth’s Multiplication is performed on the numbers 22*3, then what is 3 referred to as __________

View solution

Q. What is the default value of accumulator in booth’s multiplication of two 4-bit binary numbers?

View solution

Q. What is the value of n in multiplication of 110* 1000?

View solution

Q. What will be the value obtained after multiplication of (-2) * (-3) using Booth’s Algorithm?

View solution