Question 31 If the numerical value of a 2-byte unsigned integer on a little endian computer is 255 more than that on a big endian computer, […]

Question 37 When multiplicand Y is multiplied by multiplier X = xn-1xn-2 …x0 using bit-pair recoding in Booth’s algorithm, partial products are generated according to the […]

Question 39 (C012.25)H – (10111001110.101)B = A (135103.412)O B (564411.412)O C (564411.205)O D (135103.205)O Digital-Logic-DesignNumber-SystemsGATE 2007-IT Question 39 Explanation:  (C012.25)H – (10111001110.101)B = 1100000000010010.00100101 – 0000010111001110.10100000 = 1011101001000011.10000101 = […]

Question 40 The two numbers given below are multiplied using the Booth’s algorithm. Multiplicand : 0101 1010 1110 1110 Multiplier: 0111 0111 1011 1101 How many […]