# Algebraic Manipulation of Boolean Expressions

Introduction
Examples

Problems

###
Introduction

This is an approach where you can transform one boolean
expression into an equivalent expression by applying Boolean
Theorems.
Minimising terms and expressions can be important because
electrical circuits consist of individual components that are
implemented for each term or literal for a given expression. This
allows designers to make use of fewer components,
thus reducing the cost of a particular system.

It should be noted that there are no fixed rules that can be used
to minimise a given expression. It is left to an individuals
ability to apply Boolean Theorems in order to minimise a function.

###
Example

###
Problems

- Minimise the following functions using algebraic method:

Z = f(A,B,C) =
+ B + AB
+ AC

Z = f(A,B,C) = B + B + BC +
A

- Minimise the following switch circuit:

Click here for answers.

To submit your questions and queries please click here:

*Composed by David Belton - April 98*