GATE CSE 2015 Set 1 | Boolean Algebra Question 22 | Digital Logic

GATE CSE 2015 Set 1

MCQ (Single Correct Answer)

-0.6

The binary operator $$ \ne $$ is defined by the following truth table.

p	q	p$$ \ne $$q
0	0	0
0	1	1
1	0	1
1	1	0

Which one of the following is true about the binary operator $$ \ne $$?

Both commutative and associative

Commutative but not associative

Not commutative but associative

Neither commutative nor associative

GATE CSE 2014 Set 3

MCQ (Single Correct Answer)

-0.6

Let $$ \oplus $$ denote the exclusive $$OR\left( {XOR} \right)$$ operation. Let $$'1'$$ and $$'0'$$ denote the binary constants. Consider the following Boolean expression for $$F$$ over two variables $$P$$ and $$Q$$:
$$F\left( {P,Q} \right) = \left( {1 \oplus P} \right) \oplus \left( {P \oplus Q} \right) \oplus \left( {P \oplus Q} \right) \oplus \left( {Q \oplus 0} \right)$$

The equivalent expression for $$F$$ is

$$P+Q$$

$$\overline {P + Q} $$

$${P \oplus Q}$$

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

GATE CSE 2010

MCQ (Single Correct Answer)

-0.6

What is the Boolean expression for the output f of the combinational logic circuit of NOR gates given below? GATE CSE 2010 Digital Logic - Boolean Algebra Question 32 English

GATE CSE 2010 Digital Logic - Boolean Algebra Question 32 English

$$\overline {Q + R} $$

$$\overline {P + Q} $$

$$\overline {P + R} $$

$$\overline {P+Q + R} $$

GATE CSE 2008

MCQ (Single Correct Answer)

-0.6

If $$P, Q, R$$ are Boolean variables, then $$\left( {P + \overline Q } \right)$$ $$\left( {P.\overline Q + P.R} \right)\left( {\overline P .\overline R + \overline Q } \right)$$ Simplifies to

$${P.\,\,\overline Q }$$

$${P.\,\,\overline R }$$

$${P.\,\,\overline Q + R}$$

$${P.\,\,\overline R + Q}$$

PREVIOUS NEXT