Answer would be (B) "3 Gate will be needed to design the o/p see below

The Gateway to Computer Science Excellence

First time here? Checkout the FAQ!

x

+10 votes

A circuit outputs a digit in the form of $4$ bits. $0$ is represented by $0000$, $1$ by $0001$, …, $9$ by $1001$. A combinational circuit is to be designed which takes these $4$ bits as input and outputs $1$ if the digit $\geq$ $5$, and $0$ otherwise. If only AND, OR and NOT gates may be used, what is the minimum number of gates required?

- $2$
- $3$
- $4$
- $5$

+27 votes

Best answer

Answer should be **(B).** As according to question, truth table will be like:

$A B C D$ $f$

$0 0 0 0$ $0$

$0 0 0 1$ $0$

$0 0 1 0$ $0$

$0 0 1 1$ $0$

$0 1 0 0$ $0$

$0 1 0 1$ $1$

$0 1 1 0$ $1$

$0 1 1 1$ $1$

$1 0 0 0$ 1

$1 0 0 1$ 1

$1 0 1 0$ do not care

$1 0 1 1$ do not care

$1 1 0 0$ do not care

$1 1 0 1$ do not care

$1 1 1 0$ do not care

$1 1 1 1$ do not care

Using this truth table we get $3$ sub cube which are combined with following minterms $A (8,9,10,11,12,13,14,15)$, $BD( 5,13,7,15)$ and $BC(6,7,14,15)$

So, $f = A+ BD +BC= A+ B(C+D)$

So, minimum gate required $2$ OR gate and $1$ AND gate $= 3$ minimum gate..

0

flash12 **Don't care (X) **refers to the set of input for which the output of the function does not matter or a set of inputs that is known to never occur. Now, that being said, technically it leaves a function non-deterministic as we do not know what output the function will give on these set of inputs. However, when a circuit is realized it can only be deterministic; meaning you're in a way forced to define the output for the function even at those positions for which the input is known not to occur.

Now, we do something clever, in order to minimize our circuitry we assume the values of these don't cares in such a way that the overall expression for the function has minimum literals and minterms and thus a smaller circuit.

Coming back to the question, if you closely look, you'll see that the octet formed for deriving term **A** in the answers just takes all those don't cares to be 1. This does not mean you have changed the function. The function is known to never take those values and we can thus play with them for our benefit. Just draw K-Map and you'll see.

Please note, this a very intuitive yet useful way of thinking about don't cares. I suggest that you read more about them from standard text

0

10-15 is taken as don't care because the question says that if the "**digit"** >=5. From 10 to 15 they are not a digit number. So we don't care about them.

+2 votes

We should get output 1 for values>=5

Making truth table for problem

A B C D Op

0 0 0 0 0

0 0 0 1 0

0 0 1 0 0

0 0 1 1 0

0 1 0 0 0

0 1 0 1 1

0 1 1 0 1

0 1 1 1 1

1 0 0 0 1

1 0 0 1 1

1 0 1 0 X

1 0 1 1 X

1 1 0 0 X

1 1 0 1 X

1 1 1 0 X

1 1 1 1 X

Putting this in kmap and solving

49

Here crucial point is that we need to make pair of 8 elements using don’t cares also…so final expression is

A+BD+BC

A+B(C+D)

Hence we’ll use two OR gate and one AND gate so total 3 gates.

Ans (B) part.

Making truth table for problem

A B C D Op

0 0 0 0 0

0 0 0 1 0

0 0 1 0 0

0 0 1 1 0

0 1 0 0 0

0 1 0 1 1

0 1 1 0 1

0 1 1 1 1

1 0 0 0 1

1 0 0 1 1

1 0 1 0 X

1 0 1 1 X

1 1 0 0 X

1 1 0 1 X

1 1 1 0 X

1 1 1 1 X

Putting this in kmap and solving

49

Here crucial point is that we need to make pair of 8 elements using don’t cares also…so final expression is

A+BD+BC

A+B(C+D)

Hence we’ll use two OR gate and one AND gate so total 3 gates.

Ans (B) part.

+2 votes

We should get output 1 for values>=5

Making truth table for problem

A | B | C | D | Op |

0 | 0 | 0 | 0 | 0 |

0 | 0 | 0 | 1 | 0 |

0 | 0 | 1 | 0 | 0 |

0 | 0 | 1 | 1 | 0 |

0 | 1 | 0 | 0 | 0 |

0 | 1 | 0 | 1 | 1 |

0 | 1 | 1 | 0 | 1 |

0 | 1 | 1 | 1 | 1 |

1 | 0 | 0 | 0 | 1 |

1 | 0 | 0 | 1 | 1 |

1 | 0 | 1 | 0 | X |

1 | 0 | 1 | 1 | X |

1 | 1 | 0 | 0 | X |

1 | 1 | 0 | 1 | X |

1 | 1 | 1 | 0 | X |

1 | 1 | 1 | 1 | X |

Putting this in kmap and solving

Here crucial point is that we need to make pair of 8 elements using don’t cares also…so final expression is

A+BD+BC

- A+B(C+D)

Hence we’ll use two OR gate and one AND gate so total 3 gates.

Ans (B) part.

- All categories
- General Aptitude 1.4k
- Engineering Mathematics 5.9k
- Digital Logic 2.3k
- Programming & DS 4.2k
- Algorithms 3.6k
- Theory of Computation 4.6k
- Compiler Design 1.7k
- Databases 3.3k
- CO & Architecture 2.9k
- Computer Networks 3.3k
- Non GATE 1.2k
- Others 1.3k
- Admissions 506
- Exam Queries 480
- Tier 1 Placement Questions 22
- Job Queries 64
- Projects 15

40,748 questions

47,471 answers

145,584 comments

62,234 users