Q. In, subtraction of positive numbers using radix complement representation (M – N), If number of digits are not same in M and N how can you make them equal?

View solution

Q. Which sign bit is used for representing the positive sign in floating point representation?

View solution

Q. For every x, y in B,
n x + y = y + x
n x. y = y. x

View solution

Q. Every valid Boolean expression (equality) remains valid if the operators and identity elements are interchanged.

View solution

Q. It is a sum term or a logical product (AND) of several sum terms.

View solution

Q. Maxterm is the sum of __________of the corresponding Minterm with its literal complemented.

View solution

Q. Canonical form is a unique way of representing________________.

View solution

Q. Maxterms of a function are the terms for which the result is_________.

View solution

Q. ___________________ can be performed through addition using the 2’s complement method.

View solution

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