TRB - Computer Instructor - Computer Science - Computer Systems Architecture

Buy Computer Instructors Grade I -Tamil Nadu Board Practice test pack

Question - 1

Booth's algorithm for integer multiplication gives worst perfoemance when the multiplication gicves worst performance when the multiplier pattern is 

  • A 101010....1010
  • B 10000...001
  • C 111...1111
  • D 0111111...111110

Question - 2

Consider the following floating point number representation

   Exponent     Mantissa 

The exponent is in 2's complement representaion and mantissa is in the sign magnitude representation. The range of the magnitude of the normalized number in this representation is

  • A 0 to 1
  • B 0.5 t0 1
  • C 2-23 to 0.5
  • D 0.5 to (1-2-23)

Question - 3

Zero has one representation in

  • A sign magnitude
  • B 1's complement
  • C 2's complement
  • D None of these

Question - 4

Which of the following statements is correct about Booth's algorithm in general form .......

  • A In general in the booth scheme-1 times shifted multiplicated is selected when moving from 0 to 1
  • B In general in the booth scheme-1 times shifted multiplicated is selected when moving from 1 to 0
  • C Neither (a) nor (b)
  • D Both (a) and (b)

Question - 5

Floating point number in a computer are represented by a 10-bit mantissa (including sign bit) and a 6-bit exponent (including a sign bit). The approximate value of maximum number that can be represented is

  • A 264
  • B 232
  • C 263
  • D 231

Question - 6

In 2's complement rep[resentation, if two numbers with the same sign are added, then

  • A overflow occur if and only if the result has the opposite sign
  • B overflow occur if and only if the result has same sign
  • C overflow does not occur
  • D Both (a) and (b)

Question - 7

Which of the following is not an advantage of both alogorithm?
(i) Booth's algorithm handlles both positive and negative multipliers uniformly
(2) Booth's algorithm achieves same efficiency in the number of additions required when the multiplier has a few larger block of 1's.
(3) The speed of doing multiplication by booth's algorithm is more than the normal algorithm of average.

  • A 2, 1
  • B 3
  • C 2, 3
  • D 1, 2, 3

Question - 8

The booth algorithm 
(1) generates a 2n-bit product.
(2) treats both positive and negative 2's complements n-bit operand uniformly.

  • A 1
  • B 1, 2
  • C 2
  • D Neither (1) nor (2)

Question - 9

The bandwidth of memory system is given by

  • A number of bit/total time
  • B total time/number of bit
  • C number of bit x total time
  • D All of the above

Question - 10

The most appropriate matching for the following pairs:
X : Indirect addressing                          1. Loop
Y : Immediate addressing                     2. Pointers
Z : Auto decrement addressing            3. constants

  • A X-3, Y-2, Z-1
  • B X-1, Y-3, Z-2
  • C X-2, Y-3, Z-1
  • D X-3, Y-1, Z-2