1
GATE CSE 2026 Set 2
Numerical
+1
-0

The 32-bit IEEE 754 single precision representation of a number is 0xC2710000. The number in decimal representation is $\_\_\_\_$ . (rounded off to two decimal places)

Your input ____
2
GATE CSE 2026 Set 2
MCQ (Single Correct Answer)
+2
-0

Consider the following 4-variable Boolean function

$$ F(A, B, C, D)=\Sigma m(0,1,2,3,8,9,10,11) $$

Consider $A$ as MSB, $D$ as LSB. Which one of the following options represents the minimal sum of products form for the above function?

Note: + is OR operation, • is AND operation, ' is NOT operation

A

$A^{\prime}+B^{\prime}+C^{\prime}+D^{\prime}$

B

$B^{\prime}$

C

$A^{\prime} \cdot B^{\prime}+A \cdot B$

D

$A^{\prime}$

3
GATE CSE 2026 Set 2
Numerical
+2
-0

Consider the digital circuit shown below with two input lines A and B, two select lines S 0 and S 1 , and an output line Y . The blocks Q and M represent active high $2: 4$ decoder and 4-to-1 multiplexer, respectively. Out of 16 possible input combinations, the number of combinations that produce $\mathrm{Y}=1$ is $\_\_\_\_$ . (answer in integer)

Note: One input combination is an instance of [A B S1 S0].

GATE CSE 2026 Set 2 Digital Logic - Combinational Circuits Question 1 English

Your input ____
4
GATE CSE 2026 Set 2
MCQ (Single Correct Answer)
+1
-0

For two different persons $x$ and $y$, the predicate $M(x, y)$ denotes that $x$ knows $y$. Consider the following statement.

There is a person who does not know anyone else, but that person is known by everyone else.

Which one of the following expressions represents the above statement?

A

$(\exists y)(\forall x)((x \neq y)) \rightarrow(M(x, y) \wedge \neg M(y, x))$

B

$(\forall y)(\exists x)((x \neq y)) \rightarrow(M(x, y) \wedge \neg M(y, x))$

C

$(\exists y)(\exists x)((x \neq y)) \rightarrow(M(x, y) \wedge \neg M(y, x))$

D

$(\forall y)(\forall x)((x \neq y)) \rightarrow(M(x, y) \wedge \neg M(y, x))$