GATE CSE 2020 | Boolean Algebra Question 11 | Digital Logic

PREVIOUS NEXT

GATE CSE 2020

MCQ (Single Correct Answer)

-0.67

Consider the Boolean function z(a,b,c).

GATE CSE 2020 Digital Logic - Boolean Algebra Question 11 English

Which one of the following minterm lists represents the circuit given above?

z = $$\sum {\left( {0,1,3,7} \right)} $$

z = $$\sum {\left( {1,4,5,6,7} \right)} $$

z = $$\sum {\left( {2,4,5,6,7} \right)} $$

z = $$\sum {\left( {2,3,5} \right)} $$

GATE CSE 2019

MCQ (Single Correct Answer)

-0.67

Consider three 4-variable functions f₁, f₂ and f₃, which are expressed in sum-of-minterms as

f₁ = Σ(0, 2, 5, 8, 14),

f₂ = Σ(2, 3, 6, 8, 14, 15),

f₃ = Σ(2, 7, 11, 14)

For the following circuit with one AND gate and one XOR gate, the output function f can be expressed as : GATE CSE 2019 Digital Logic - Boolean Algebra Question 12 English

GATE CSE 2019 Digital Logic - Boolean Algebra Question 12 English

Σ (2, 14)

Σ (7, 8, 11)

Σ (2, 7, 8, 11, 14)

Σ (0, 2, 3, 5, 6, 7, 8, 11, 14, 15)

GATE CSE 2018

MCQ (Single Correct Answer)

-0.6

Let $$ \oplus $$ and $$ \odot $$ denote the Exclusive OR and Exclusive NOR operations, respectively.

Which one of the following is NOT CORRECT?

$$\overline {P \oplus Q} = P \odot Q$$

$$\overline P \oplus Q = P \odot Q$$

$$\overline P \oplus \overline Q = P \oplus Q$$

$$\left( {P \oplus \overline P } \right) \oplus Q = \left( {P \odot \overline P } \right) \odot \overline Q $$

GATE CSE 2016 Set 1

MCQ (Single Correct Answer)

-0.6

Consider a carry lookahead adder for adding two $$n$$-bit integers, built using gates of fan-in at most two. The time to perform addition using this adder is

$$\Theta \left( 1 \right)$$

$$\Theta \left( {\log \left( n \right)} \right)$$

$$\Theta \left( {\sqrt n } \right)$$

$$\Theta \left( n \right)$$

PREVIOUS NEXT