Q. Loading 32-bit FP number into F4 register can be represented in MIPS as

View solution

Q. Adding 0000 0000 0000 0000 0000 0000 0000 0111two and 0000 0000 0000 0000 0000 0000 0000 0110two will have answer of

View solution

Q. The multiplication of these floating points (1.110)10 x (9.200)10 yields

View solution

Q. Negating 2ten and then checking the result by negating

View solution

Q. Floating-point numbers are normally a multiples of the size of a

View solution

Q. For the operation of multiplication hardware needs minimum ALU of

View solution

Q. In the year 1994 intel claims the flaw that happens once in 27,000 years, for

View solution

Q. The Decimal representation of this binary (1011)two is

View solution

Q. The example of if ($s2 < $s3); s1 = 1; else $s1 = 0 function is

View solution

Q. In the division, the two operands (dividend and divisor) and the answer (quotient) of divide are accompanied by a second answer called the

View solution

Q. Using a 4-bit version of the algorithm dividing 7ten by 2ten will produce the quotient

View solution

Q. For adding immediate unsigned the command we have is

View solution

Q. Negating decimal number 2ten will produce the result of

View solution

Q. MIPS architecture provides a separate pair of 32-bit registers to contain the product of 64-bits called

View solution

Q. MIPS architecture detects the exception of overflow also known as

View solution

Q. Multiplying (1000)10 by (1001t)en will produce the product of

View solution

Q. The given instruction multu $s2,$s3; shows the multiplication of

View solution

Q. The floating point operation is also called

View solution

Q. This binary instruction (1111 1111 1111 1111 1111 1111 1111 1101)two, will be represented in binary no as

View solution

Q. One billion is 1 000 000 000 and it will contain

View solution