2.1.12 - Construct truth tables using the above operators.

Question 1

How do you construct a truth table for Boolean operators?

Answer 1

To construct a truth table, list input columns on the left, partial outputs in the middle (optional), and the output column on the right. Ensure there is a row for every possible configuration of inputs.

Question 2

Construct a truth table for the AND operator with two inputs.

Answer 2

A | B | A AND B |
|—|—|———|
| 0 | 0 | 0 |
| 1 | 0 | 0 |
| 0 | 1 | 0 |
| 1 | 1 | 1 |

Question 3

Construct a truth table for the OR operator with two inputs.

Answer 3

A | B | A OR B |
|—|—|——–|
| 0 | 0 | 0 |
| 1 | 0 | 1 |
| 0 | 1 | 1 |
| 1 | 1 | 1 |

Question 4

Construct a truth table for the NOT operator with one input.

Answer 4

A | NOT A |
|—|——-|
| 0 | 1 |
| 1 | 0 |

Question 5

Construct a truth table for the NAND operator with two inputs.

Answer 5

A | B | A NAND B |
|—|—|———-|
| 0 | 0 | 1 |
| 1 | 0 | 1 |
| 0 | 1 | 1 |
| 1 | 1 | 0 |

Question 6

Construct a truth table for the NOR operator with two inputs.

Answer 6

A | B | A NOR B |
|—|—|———|
| 0 | 0 | 1 |
| 1 | 0 | 0 |
| 0 | 1 | 0 |
| 1 | 1 | 0 |

Question 7

Construct a truth table for the XOR operator with two inputs.

Answer 7

A | B | A XOR B |
|—|—|———|
| 0 | 0 | 0 |
| 1 | 0 | 1 |
| 0 | 1 | 1 |
| 1 | 1 | 0 |