1.

Minimum number of 2-input NAND gates required to implement the Boolean function given below is _______.f=(¯¯¯¯A+¯¯¯¯B)(C+D)4

Answer» Minimum number of 2-input NAND gates required to implement the Boolean function given below is _______.



f=(¯¯¯¯A+¯¯¯¯B)(C+D)
  1. 4


Discussion

No Comment Found

Related InterviewSolutions