Q. What is the result of evaluating the following two expressions using three-digit floating point arithmetic with rounding?

(113.+−111.)+7.51
113.+(−111.+7.51)

View solution

Q. (1217)₈ is equivalent to

View solution

Q. P is a 16 – bit signed integer. The 2’s complement representation of P is (F87B)₁₆. The 2’s complement representation of 8 * p is

View solution

Q. Find the radix 5 representation for the following decimal representation:
(39)₁₀ = ( ) ₅

View solution

Q. Find the value of radix r, with the following equality is matached.

√(21)ᵣ = (11)ᵣ

View solution

Q. How many bits are needed to represent 20 digit decimal number in binary?

View solution

Q. Consider the following subtraction and Identify the correct answer.

(C012.25)₄ – (10111001110.101)₈

View solution

Q. Let A = 11111010 and B = 00001010 be two 8 – bit 2's complement numbers. Their product in 2's complement is

View solution

Q. The range of integers that can be represented by an n – bit 2's complement number system is

View solution

Q. The switching expression corresponding to f(A, B,C, D) = Σ (1, 4, 5, 9, 11,12) is

View solution

Q. What is the maximum number of different Boolean functions involving n boolean variables?

View solution

Q. How many Boolean functions are possible with 2 trinary variables?

View solution

Q. How many minimum 2-input nor gates are needed to realize A+BC?

View solution

Q. Which of the following statement is true regarding ‘HAZARD’?

View solution

Q. The min term expansion of f(P,Q,R) = PQ + QR̅ + PR̅ is

View solution

Q. How many Boolean functions are possible with 3 Boolean variables such that the number of min terms are either one or two?

View solution

Q. Which of the following statement is FALSE regarding functionally completeness, (FC).

View solution

Q. Which of the following is the minimization expression for A+A'B+A'B'C+A'B'C'D?

View solution

Q. Consider a hypothetical k-map in which essential prime implicants covering all the min – terms except two. Each of the left over min – term is covered by 3 different redundant prime implicants. What would be the no of minimal expressions denoted by the map?

View solution

Q. The literal count of a Boolean expression is the sum of the number of times each literal appears in the expression. For example, the literal count of (x y + x z) is 4. What are the minimum possible literal counts of the product – of – sum and sum – of – product representations respectively of the function given by the following karnaugh map? Here, x denotes “don’t care”.

View solution