Question

Hi
Can anyone help with a diagram of the above question? It it stated thus:Starting with the following statement: (A+B).(A+C), show how this can be implemented using NAND gates using De Morgans law.

By double negating, I obtain (A.B) + (A.C). But what would the diagram look like?

Please, any help is appreciated. Thanks. I have really struggled with the solution. Its very difficult as I self study. Please help with any possible solutions.

Answer 1

Nice job to get as far as (ab)+(ac), but you should take it one more step further. You need to show how to implement the statement using NAND gates and right now, you need two AND gates and an OR gate. Try applying De Morgan one more time.

How to draw a diagram? You could start with the '+', since that will be the gate that will give you your output signal. So you'd draw an OR gate. Next, you need to check what is on each input of the gate. That'd be 'ab' and 'ac'. So you need to draw a n AND gate connected to the OR for each of them. And so on until you have drawn the entire diagram.