Given a diagram of a particular switching circuit, we start by identifying a Boolean function to represent it. We then find the negation of the switching circuit and finally, the simplest possible expression for it using Boolean algebra and a Karnaugh map

Negating and Simplifying Switching Circuits (MathsCasts)

These MathsCasts were produced by the mathematics support centres at Swinburne University, the University of Limerick and Loughborough University. They were part of a collaborative research project to develop high quality resources and investigate the effectiveness of MathsCasts to support mathematics learning. The full set of resources are available at http://commons.swin.edu.au/s/mathscasts MathsCasts are licensed under a Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported License

Share Negating and Simplifying Switching Circuits (MathsCasts)

Sign up to save your podcasts

Negating and Simplifying Switching Circuits (MathsCasts)

Negating and Simplifying Switching Circuits (MathsCasts)