Ultimate A-Level Computer Science Podcast

S9:E3 Karnaugh Maps: Simplifying Boolean Expressions


Listen Later

This episode introduces Karnaugh maps as a method for simplifying Boolean expressions, serving as an alternative to truth tables and Boolean algebra. It outlines how to construct a Karnaugh map from a truth table or a given expression, emphasising the correspondence between the two. The materials demonstrate how to identify and group terms within a map, including examples with two, three, and four variables, even showcasing "wrapping" groups for more complex scenarios. Ultimately, the goal is to interpret these groupings to derive a simplified Boolean expression.

...more
View all episodesView all episodes
Download on the App Store

Ultimate A-Level Computer Science PodcastBy Teacher of Computing - AHC