Scribd
Upload
4 views8 pages

Boolean From Truth Table

The document explains how to derive Boolean expressions from truth tables by focusing on rows with an output of 1 and combining corresponding input conditions using AND and OR operators. It also discusses the creation of logic circuits based on these expressions, detailing the use of AND, OR, and NOT gates. Additionally, it presents a safety system example that uses three inputs to activate an alarm based on specific conditions.

Uploaded by

levi makokha
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
4 views8 pages

Boolean From Truth Table

The document explains how to derive Boolean expressions from truth tables by focusing on rows with an output of 1 and combining corresponding input conditions using AND and OR operators. It also discusses the creation of logic circuits based on these expressions, detailing the use of AND, OR, and NOT gates. Additionally, it presents a safety system example that uses three inputs to activate an alarm based on specific conditions.

Uploaded by

levi makokha
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 8

Example 5

A. IDENTIFYING THE BOOLEAN EXPRESSION FROM A TRUTH TABLE

• Tabble below is used to determine the Boolean expression.

• Input values (A, B, C) and the Output (X) are provided in the table.

Steps for Deriving the Boolean Expression:

1. Focus on rows with output = 1 (highlighting "true" conditions).

2. The corresponding input combinations lead to three expressions:

▪ (NOT A AND NOT B AND NOT C)


▪ (A AND NOT B AND NOT C)
▪ (A AND B AND NOT C)

3. These expressions are joined using the OR operator:


Final Expression:
(NOT A AND NOT B AND NOT C) OR (A AND NOT B AND NOT C) OR (A AND
B AND NOT C)
b. Identifying Boolean Expressions and Comparing Outputs

• Table below shows another truth table with inputs (A, B, C) and output (X).

• Rows with output = 1 are analyzed to form logic expressions:

▪ (NOT A AND B AND C)


▪ (A AND NOT B AND C)
▪ (A AND B AND NOT C)
▪ (A AND B AND C)

Final Boolean Expression:

(NOT A AND B AND C) OR (A AND NOT B AND C) OR (A AND B AND NOT C) OR (A


AND B AND C)

Comparing Results in the Table below:


• A new column is added for (B AND C) OR (A AND C) OR (A AND B).

• Outputs in the new column match the original truth table.

• Conclusion:
(B AND C) OR (A AND C) OR (A AND B) gives the same output as the
Boolean expression derived earlier.

Activity

Qn 1.Logic Expression and Circuit

Given the expression:


(NOT A AND B) AND (NOT B OR C)

• Produce a truth table and a logic circuit.

Qn2. Produce Truth Table and Logic Circuit

• Input: Truth table provided for the expression:


(A XOR B) OR ((B NOR C) AND B)

• Show columns and outputs for each condition.


Qn3. Write Logic Expressions for Truth Tables

Tables with three inputs (A, B, C) and output (X) are provided:

• Analyze rows where X = 1.

• Write corresponding Boolean expressions.

Note the following:


1. Truth Tables:

▪ Each truth table lists combinations of input variables (e.g A, B,


C) and the resulting output (X).
▪ Highlighted rows where X = 1 help identify the conditions that
satisfy the logic.

2. Logic Expressions:

▪ Derived by analyzing rows with X = 1.


▪ Inputs are combined using AND, OR, and NOT operators.

3. Logic Circuits:

▪ A visual representation of the Boolean expression using logic


gates:
a) AND Gate: Outputs true if all inputs are true.
b) OR Gate: Outputs true if at least one input is true.
c) NOT Gate: Inverts the input.

Example 6

1. Problem Description

• A safety system uses three inputs to a logic circuit:

▪ Input A represents ON.


▪ Input B represents OFF.
▪ Input C represents OFF.

• The output, X, activates the alarm when either:

▪ A is ON and B is OFF.
▪ OR B is ON and C is OFF.

2. Boolean Expression

The conditions are expressed as:


(A AND NOT B) OR (B AND NOT C)

• Explanation:

▪ (A AND NOT B) → "A is ON and B is OFF."


▪ (B AND NOT C) → "B is ON and C is OFF."

• The final expression:

3. Logic Circuit Diagrams

The logic circuit is split into two parts based on the Boolean expression:

• Part 1:

▪ Input A is passed directly.


▪ Input B goes through a NOT gate (to produce NOT B).
▪ The two outputs are joined using an AND gate to produce A
AND NOT B.
• Part 2:

▪ Input B is passed directly.


▪ Input C goes through a NOT gate (to produce NOT C).
▪ The two outputs are joined using an AND gate to produce B
AND NOT C.

• Both parts are combined using an OR gate to produce the final output X.

• Complete circuit diagram includes:

▪ NOT gates to invert inputs.


▪ AND gates for intermediate conditions.
▪ OR gate for the final output.

The truth table verifies the Boolean expression and the circuit design:
The Columns:

• Inputs: A, B, C represent possible states.


• Intermediate values:
a) (A AND NOT B) → checks the condition where A is ON
and B is OFF.
b) (B AND NOT C) → checks the condition where B is ON
and C is OFF.
• Output (X): Combines the intermediate values using the OR
gate.

You might also like