adplus-dvertising
frame-decoration

Question

Negating 2ten and then checking the result by negating

a.

(2)10

b.

(-2)10

c.

(-4)10

d.

(10)10

Posted under Computer Architecture

Answer: (a).(2)10

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

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

Similar Questions

Discover Related MCQs

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

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

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

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

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

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

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

Q. For adding immediate unsigned the command we have is

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

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

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

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

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

Q. The floating point operation is also called

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

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

Q. Loading half unsigned instruction can be executed using

Q. A number in scientific notation, that has no leading 0s is called a

Q. The human readable base representation of the numbers is

Q. To handle division of unsigned integers MIPS has instruction of