Perform Boolean algebra operations is fundamental for ICT Technicians in Kenya, especially when designing and troubleshooting digital circuits and computer logic systems. Mastery of Boolean algebra enables the simplification of logic expressions, optimization of circuit designs, and effective implementation of ICT hardware components. This chapter develops key skills in handling Boolean variables, logical operations, Boolean expressions, laws, truth tables, and De Morgan's theorem through practical worked examples contextualized in ICT applications.

6.1 Key concepts in Boolean algebra

Boolean algebra forms the mathematical foundation for digital logic, essential in ICT hardware such as microprocessors, memory units, and network devices. Understanding Boolean algebra allows technicians to analyze and simplify digital circuits, reducing complexity and enhancing performance. This section introduces the core concepts necessary for Boolean operations relevant to ICT systems.

6.1.1 Boolean variables

Boolean variables represent binary states used in digital logic, typically taking values of 0 or 1, corresponding to OFF/ON or FALSE/TRUE states in ICT devices. These variables form the basis of logical decisions in hardware and software, enabling control flow and signal processing. Boolean variables are manipulated through logical operations to model and design digital circuits.

$$ x \in \{0,1\} $$

Worked Examples

Example 1: In an ICT system, a sensor output \(A\) can be either high (1) or low (0). If \(A = 1\), what is the value of \(A\) if it represents a Boolean variable?

Given: \(A = 1\)

$$ A = 1 $$

Answer: \(A = 1\) (True)

Example 2: A network switch uses a Boolean variable \(B\) to indicate connectivity: 1 for connected, 0 for disconnected. If \(B = 0\), what is the Boolean value of \(B\)?

Given: \(B = 0\)

$$ B = 0 $$

Answer: \(B = 0\) (False)

Example 3: An ICT device has two Boolean variables \(X\) and \(Y\). If \(X = 0\) and \(Y = 1\), what are their Boolean states?

Given: \(X=0, Y=1\)

$$ X=0, \quad Y=1 $$

Answer: \(X = 0\) (False), \(Y=1\) (True)

6.1.2 Logical operations

Logical operations manipulate Boolean variables to produce new Boolean results. The primary logical operations are AND, OR, and NOT, fundamental to ICT logic circuits and decision-making processes.

• AND operation outputs 1 only if all inputs are 1.
• OR operation outputs 1 if at least one input is 1.
• NOT operation inverts the input value.

The basic formulas for two variables \(A\) and \(B\) are:

$$ A \cdot B \quad \text{(AND)} $$

$$ A + B \quad \text{(OR)} $$

$$ \overline{A} \quad \text{(NOT)} $$

Worked Examples

Example 1: In a security system circuit, two sensors \(A=1\) and \(B=0\) are connected by AND logic. Find the output.

Given: \(A=1, B=0\)

$$ A \cdot B = 1 \cdot 0 $$

$$ = 0 $$

Answer: Output = 0 (False)

Example 2: For the same sensors, find the output if connected by OR logic.

Given: \(A=1, B=0\)

$$ A + B = 1 + 0 $$

$$ = 1 $$

Answer: Output = 1 (True)

Example 3: If sensor \(A=0\), find the NOT of \(A\).

Given: \(A=0\)

$$ \overline{A} = \overline{0} $$

$$ = 1 $$

Answer: Output = 1 (True)

Example 4: If \(A=1\) and \(B=1\), evaluate \(A \cdot B + \overline{A}\).

Given: \(A=1, B=1\)

$$ A \cdot B + \overline{A} = (1 \cdot 1) + \overline{1} $$

$$ = 1 + 0 $$

$$ = 1 $$

Answer: Output = 1 (True)

Example 5: For \(A=0\) and \(B=1\), evaluate \(\overline{A} \cdot B\).

Given: \(A=0, B=1\)

$$ \overline{A} \cdot B = 1 \cdot 1 $$

$$ = 1 $$

Answer: Output = 1 (True)

6.1.3 Boolean expressions

Boolean expressions combine Boolean variables and logical operations to represent complex digital logic functions in ICT devices. Simplifying these expressions reduces circuit complexity and improves efficiency.

Boolean expressions use variables \(A, B, C, \ldots\) and operators AND (\(\cdot\)), OR (+), and NOT (\(\overline{\cdot}\)).

Worked Examples

Example 1: Simplify the expression \(A \cdot B + A \cdot \overline{B}\).

Given: Expression \(F = A \cdot B + A \cdot \overline{B}\)

$$ F = A \cdot B + A \cdot \overline{B} $$

$$ = A \cdot (B + \overline{B}) $$

$$ = A \cdot 1 $$

$$ = A $$

Answer: \(F = A\)

Example 2: Simplify \(F = \overline{A} \cdot B + A \cdot B\).

Given: \(F = \overline{A} \cdot B + A \cdot B\)

$$ F = B \cdot (\overline{A} + A) $$

$$ = B \cdot 1 $$

$$ = B $$

Answer: \(F = B\)

Example 3: Simplify \(F = A \cdot (B + C) + \overline{A} \cdot B\).

Given: \(F = A \cdot (B + C) + \overline{A} \cdot B\)

$$ F = A \cdot B + A \cdot C + \overline{A} \cdot B $$

$$ = B \cdot (A + \overline{A}) + A \cdot C $$

$$ = B \cdot 1 + A \cdot C $$

$$ = B + A \cdot C $$

Answer: \(F = B + A \cdot C\)

Example 4: Simplify \(F = (A + B) \cdot (A + \overline{B})\).

Given: \(F = (A + B) \cdot (A + \overline{B})\)

$$ F = A + B \cdot \overline{B} $$

$$ = A + 0 $$

$$ = A $$

Answer: \(F = A\)

Example 5: Simplify \(F = \overline{A + B} + A \cdot B\).

Given: \(F = \overline{A + B} + A \cdot B\)

$$ F = \overline{A} \cdot \overline{B} + A \cdot B $$

No further simplification possible.

Answer: \(F = \overline{A} \cdot \overline{B} + A \cdot B\)

6.1.4 Laws and rules of Boolean algebra

Boolean algebra follows specific laws and rules that govern the manipulation and simplification of expressions. These fundamental principles allow ICT technicians to optimize logic circuits effectively.

Some key laws include:

• Commutative Law: \(A + B = B + A\), \(A \cdot B = B \cdot A\)
• Associative Law: \((A + B) + C = A + (B + C)\), \((A \cdot B) \cdot C = A \cdot (B \cdot C)\)
• Distributive Law: \(A \cdot (B + C) = A \cdot B + A \cdot C\)
• Identity Law: \(A + 0 = A\), \(A \cdot 1 = A\)
• Null Law: \(A + 1 = 1\), \(A \cdot 0 = 0\)
• Idempotent Law: \(A + A = A\), \(A \cdot A = A\)
• Complement Law: \(A + \overline{A} = 1\), \(A \cdot \overline{A} = 0\)

Worked Examples

Example 1: Using the distributive law, simplify \(F = A \cdot (B + C)\).

Given: \(F = A \cdot (B + C)\)

$$ F = A \cdot B + A \cdot C $$

Answer: \(F = A \cdot B + A \cdot C\)

Example 2: Using complement law, simplify \(F = A + \overline{A} \cdot B\).

Given: \(F = A + \overline{A} \cdot B\)

$$ F = (A + \overline{A}) \cdot (A + B) $$

$$ = 1 \cdot (A + B) $$

$$ = A + B $$

Answer: \(F = A + B\)

Example 3: Apply the identity law to simplify \(F = A \cdot 1 + B \cdot 0\).

Given: \(F = A \cdot 1 + B \cdot 0\)

$$ F = A + 0 $$

$$ = A $$

Answer: \(F = A\)

Example 4: Use the null law to simplify \(F = A + 1\).

Given: \(F = A + 1\)

$$ F = 1 $$

Answer: \(F = 1\)

Example 5: Use the idempotent law to simplify \(F = B + B\).

Given: \(F = B + B\)

$$ F = B $$

Answer: \(F = B\)

6.1.5 Truth tables

Truth tables systematically list all possible input combinations of Boolean variables and their corresponding output values. They are essential for verifying and designing digital circuits in ICT.

Truth tables help technicians understand and test logic functions before hardware implementation.

Worked Examples

Example 1: Construct a truth table for \(F = A \cdot B\).

Example 2: Construct a truth table for \(F = A + B\).

Example 3: Construct a truth table for \(F = \overline{A}\).

Example 4: Construct a truth table for \(F = A \cdot \overline{B} + \overline{A} \cdot B\).

Example 5: Construct a truth table for \(F = (A + B) \cdot \overline{C}\).

Additional Worked Example Details

Example 1 (Expanded): Construct a truth table for \(F = A \cdot B\).

For each row:

• Row 1: \(A = 0, B = 0\)$$ F = 0 \cdot 0 = 0 $$
• Row 2: \(A = 0, B = 1\)$$ F = 0 \cdot 1 = 0 $$
• Row 3: \(A = 1, B = 0\)$$ F = 1 \cdot 0 = 0 $$
• Row 4: \(A = 1, B = 1\)$$ F = 1 \cdot 1 = 1 $$

Example 2 (Expanded): Construct a truth table for \(F = A + B\).

For each row:

• Row 1: \(A = 0, B = 0\)$$ F = 0 + 0 = 0 $$
• Row 2: \(A = 0, B = 1\)$$ F = 0 + 1 = 1 $$
• Row 3: \(A = 1, B = 0\)$$ F = 1 + 0 = 1 $$
• Row 4: \(A = 1, B = 1\)$$ F = 1 + 1 = 1 $$

Example 3 (Expanded): Construct a truth table for \(F = \overline{A}\).

For each row:

• Row 1: \(A = 0\)$$ F = \overline{0} = 1 $$
• Row 2: \(A = 1\)$$ F = \overline{1} = 0 $$

Example 4 and 5 already show stepwise calculation for each row.

6.1.6 De Morgan's theorem

De Morgan's theorem provides rules for transforming the complement of logical expressions, crucial for circuit simplification and design in ICT. The two main theorems are:

$$ \overline{A \cdot B} = \overline{A} + \overline{B} $$

$$ \overline{A + B} = \overline{A} \cdot \overline{B} $$

These allow conversion between NAND and NOR logic forms.

Worked Examples

Example 1: Verify \(\overline{A \cdot B} = \overline{A} + \overline{B}\) for \(A=0, B=1\).

Given: \(A=0, B=1\)

Calculate left side:

$$ \overline{A \cdot B} = \overline{0 \cdot 1} = \overline{0} = 1 $$

Calculate right side:

$$ \overline{A} + \overline{B} = 1 + 0 = 1 $$

Answer: Both sides equal 1

Example 2: Verify \(\overline{A + B} = \overline{A} \cdot \overline{B}\) for \(A=1, B=0\).

Given: \(A=1, B=0\)

Calculate left side:

$$ \overline{A + B} = \overline{1 + 0} = \overline{1} = 0 $$

Calculate right side:

$$ \overline{A} \cdot \overline{B} = 0 \cdot 1 = 0 $$

Answer: Both sides equal 0

Example 3: Simplify \(\overline{(A + B) \cdot C}\) using De Morgan's theorem.

Given: Expression \(\overline{(A + B) \cdot C}\)

Apply De Morgan's theorem:

$$ \overline{(A + B) \cdot C} = \overline{A + B} + \overline{C} $$

$$ = (\overline{A} \cdot \overline{B}) + \overline{C} $$

Answer: \(\overline{A} \cdot \overline{B} + \overline{C}\)

Example 4: Simplify \(\overline{\overline{A} + B}\) using De Morgan's theorem.

Given: \(\overline{\overline{A} + B}\)

Apply De Morgan's theorem:

$$ = \overline{\overline{A}} \cdot \overline{B} $$

$$ = A \cdot \overline{B} $$

Answer: \(A \cdot \overline{B}\)

Example 5: For \(A=1, B=1, C=0\), verify \(\overline{A \cdot (B + C)} = \overline{A} + \overline{B + C}\).

Given: \(A=1, B=1, C=0\)

Calculate left side:

$$ B + C = 1 + 0 = 1 $$

$$ A \cdot (B + C) = 1 \cdot 1 = 1 $$

$$ \overline{A \cdot (B + C)} = \overline{1} = 0 $$

Calculate right side:

$$ \overline{A} + \overline{B + C} = 0 + \overline{1} = 0 + 0 = 0 $$

Answer: Both sides equal 0

Chapter Summary

This chapter introduced the fundamental concepts of Boolean algebra, starting with the definition and characteristics of Boolean variables that take values of either true or false. It then explored the primary logical operations including AND, OR, and NOT, which form the basis for manipulating Boolean expressions. The chapter examined how Boolean expressions are constructed and simplified using these operations. Essential laws and rules of Boolean algebra were presented to enable systematic simplification and analysis of such expressions. Truth tables were discussed as a tool to represent and verify the output of logical operations and expressions for all possible input combinations. Finally, De Morgan's theorem was explained, highlighting its importance in transforming and simplifying complex Boolean expressions by relating AND and OR operations through negation. Together, these topics provide a comprehensive foundation for performing Boolean algebra operations effectively.