The GATE Grind

GATE 2019 IN – Question 45

Digital Electronics · Number systems and combinational logic: Number systems, multiplexer and demultiplexer, truth tables, minimization of Boolean functions, IC families (ECL, TTL, CMOS), CMOS logic gates, arithmetic circuits · 2 marks · Multiple choice

X = X1X0 and Y = Y1Y0 are 2-bit binary numbers. The Boolean function S that is 1 when X>Y, in minimized form, is

  1. X1*not(Y1) + X0*not(Y0)
  2. X1*not(Y1) + X0*not(Y0)*Y1 + X0*not(Y0)*X1
  3. X1*not(Y1)*X0*not(Y0)
  4. X1*Y1 + X0*not(Y0)*Y1 + X0*not(Y0)*not(X1)

Practise this question in The GATE Grind →

Show answer and explanation

Correct answer: (B) X1*not(Y1) + X0*not(Y0)*Y1 + X0*not(Y0)*X1

Explanation

We are sorry we couldn't write detailed soluition for this, we are working on it!, please consider asking your own AI, its just 2-3 clicks with very minimum effort

More Number systems and combinational logic: Number systems, multiplexer and demultiplexer, truth tables, minimization of Boolean functions, IC families (ECL, TTL, CMOS), CMOS logic gates, arithmetic circuits questions

All Number systems and combinational logic: Number systems, multiplexer and demultiplexer, truth tables, minimization of Boolean functions, IC families (ECL, TTL, CMOS), CMOS logic gates, arithmetic circuits questions →