StudySmarter AI is coming soon!

- :00Days
- :00Hours
- :00Mins
- 00Seconds

A new era for learning is coming soonSign up for free

Suggested languages for you:

Americas

Europe

Q46E

Expert-verifiedFound in: Page 36

Book edition
7th

Author(s)
Kenneth H. Rosen

Pages
808 pages

ISBN
9780073383095

**Construct a truth table for the logical operator NAND**

For NAND logical operator, the output is true if one of the inputs.or both the inputs such as of p and q are false. Use this concept for the construction of truth table for NAND.

A logic gate **truth table **depicts each feasible input sequence to the gate or circuit, as well as the resulting output based on the combination of these inputs.

Take two variables as inputs such as p and q.

p NAND q is denoted by ${\mathbf{p}}|\mathbf{q}$ .

Prepare the truth table for ${\mathbf{p}}|\mathbf{q}$ .

\({\rm{p}}\) | \({\rm{q}}\) | \({\bf{p}}\left| {\bf{q}} \right.\) |

\({\rm{T}}\) | \({\rm{T}}\) | \({\rm{F}}\) |

\({\rm{T}}\) | \({\rm{F}}\) | \({\rm{T}}\) |

\({\rm{F}}\) | \({\rm{T}}\) | \({\rm{T}}\) |

\({\rm{F}}\) | \({\rm{F}}\) | \({\rm{T}}\) |

Truth Table

Therefore, the truth has been constructed for NAND logical operator.

94% of StudySmarter users get better grades.

Sign up for free