1. F = ABCD
2. F = A + B + C + D
3. F = (A' + B')(C' + D')
4. F = AB(C + D)
5. F = (A + B)(C + D)
   
   
   
   

2 is CORRECT. The technique is the same as the earlier similar problem. Redraw the leading NAND gate with its equivalent symbol (a OR with two bubbles on its inputs--see question 2), results in a all OR network. Thus F = A + B + C + D.

[ Go Back To Question 12 ]

[ Go Back To The Beginning Of Quiz ]