# Computer Arithmetic - Multiple Choice Questions

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

B. Complement

C. Sign Magnitude

D. Encode

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

A. True

B. False

C. Nothing Can be said

D. None of the mentioned

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

A. 1.

B. 0.

C. 1001.

D. 1110.

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

A. 10.

B. 1.

C. 0.

D. 111.

5. The sign magnitude representation of -9 is  ___________.

A. 1001.

B. 11111001.

C. 10001001.

D. 11001.

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

A. -2n+1 to +2n+1.

B. -2n-1 to +2n-1.

C. -2n-1 to +2n+1.

D. -2n-1 to +2n-1-1.

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

A. LSB.

B. MSB.

C. 0.

D. 1.

8. Single Precision format comprises of _________ bits

A. 4.

B. 8.

C. 16.

D. 32.

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

A. m=n’.

B. m=n’+1.

C. m=n’-1.

D. m=n

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

A. 128.

B. 8.

C. 24.

D. 256.

11. Which of the following is used for binary multiplication.

A. Restoring Multiplication

B. Booth’s Algorithm

C. Pascal’s Rule

D. Digit-by-digit multiplication

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

A. True

B. False

C. Nothing Can be said

D. None of the mentioned

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

A. 11101.

B. 10100.

C. 1101.

D. 1000.

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

A. 1000.

B. 1111.

C. 11.

D. 11111.

15. Booth’s Algorithm is applied on _____________.

A. decimal numbers

B. binary numbers

D. octal Numbers

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

A. accumulator

B. multiplicand

C. quotient

D. multiplier

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

A. 0.

B. 1.

C. 0.

D. 0.

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

A. 2.

B. 3.

C. 4.

D. 0.

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

A. 6.

B. -6.

C. -2.

D. -3.

20. What does the data transfer instruction STA stand for.

A. Store Accumulator

B. Send Accumulator

C. Send Action

D. Store Action

21. Perform binary addition of 1101 + 0010 is ________.

A. 1110.

B. 1111.

C. 111.

D. 11101.

22. The addition 1+1 gives 0 as a result.

A. True

B. False

C. Nothing Can be said

D. None of the mentioned

23. The result of 0*1 in binary is ____________.

A. 0.

B. 1.

C. invalid

D. 10.

24.  The multiplication of 110 * 111 is performed What is a general term used for 111.

A. Dividend

B. Quotient

C. Multiplicand

D. Multiplier

25. The result obtained on binary multiplication of 1010 * 1100 is _____________.

A. 1111.

B. 11111.

C. 1111100.

D. 1111000.

26. Which of the following is often called the double precision format.

A. 64-bit

B. 8-bit

C. 32-bit

D. 128-bit

27. What do you call the intermediate terms in binary multiplication.

A. Multipliers

B. Mid terms

C. Partial Products

D. Multiplicands

28. The result that is smaller than the smallest number obtained is referred to as  ___________.

A. NaN.

B. Underflow

C. Smallest

D. Mantissa

29. The number of sign bits in a 32-bit IEEE format is _______.

A. 1.

B. 11.

C. 9.

D. 23.

30. Express the decimal format of the signed binary number (101010)2 ..

A. 10.

B. 12.

C. -12.

D. -10.

31. Binary addition of 1 + 1 gives the result  _____________.

A. 0.

B. 1.

C. 2.

D. 10.

32. 4-bit is a valid IEEE- format.

A. True

B. False

C. Nothing Can be said

D. None of the mentioned

Answer = None of the mentioned

33. The result of 0 – 1 in binary is ______________.

A. 0.

B. 1.

C. 11.

D. 10.

34.  The complement of any number can be given by a general term _______________.

A. Bn –  1 – N.

B. Bn -1 + N.

C. Bn +1 – N.

D. Bn +1 + N.

Answer = Bn –  1 – N

35. The IEEE standard followed by almost all the computers for floating point arithmetic _____.

A. IEEE 260.

B. IEEE 488.

C. IEEE 754.

D. IEEE 610.

36. Which of the following is often called the double precision format.

A. 64-bit

B. 8-bit

C. 32-bit

D. 128-bit

37. What is NaN in IEEE standards.

A. Not arithmetic

B. Not a negation

C. Not a number

D. Not a Node

38. The result that is smaller than the smallest number obtained is referred to as  ___________.

A. NaN.

B. Underflow

C. Smallest

D. Mantissa

39. The number of sign bits in a 32-bit IEEE format _________.

A. 1.

B. 11.

C. 9.

D. 23.

40. Express the decimal format of the signed binary number (101010)2 ..

A. 10.

B. 12.

C. -12.

D. -10.

41. What is the 1’s complement of 11010.

A. 11010.

B. 11011.

C. 110.

D. 101.

42. 2’s complement is obtained by adding 1 to 1’s complement of a number.

A. True

B. False

C. Nothing Can be said

D. None of the mentioned

43. The 10’s complement of 562 is __________.

A. 4.

B. 3.

C. 7.

D. 8.

44.  The 9’s complement of 6578 is ___________.

A. 1234.

B. 3421.

C. 3124.

D. 3420.

45. >> operator is used to denote  _________.

A. left shift

B. right shift

C. greater than

D. less than

46. The subtraction  using 1’s complement of 110 – 100 will give the result  ___________.

A. -11.

B. 11.

C. 10.

D. -10.

47. The result obtained on subtraction using 2’s complement of 1111-0010 will be  _________.

A. 11101.

B. 11011.

C. 1101.

D. 1011.

48. Since carry is generated, it is discarded and the answer is positive.

A. The 1’s complement of 1111111110.101 is _______________.

B. 1.01.

C. 0.01.

D. 1111111110.101.

Answer = The 1’s complement of 1111111110.101 is _______________

49. 7’s complement of 432 is _________________.

A. 432.

B. 543.

C. 345.

D. 777.