Objective

By the end of this module, you will be able to: 
 
 Understand the purpose of a Karnaugh Map (K-Map) as a visual tool for simplifying digital logic. 
 Correctly create a K-Map for functions with 2, 3, or 4 input variables. 
 Translate a Boolean function or a truth table into its corresponding K-Map representation. 
 Apply the rules for grouping adjacent cells to find the simplest possible logic expression. 
 Use "don't care" conditions (X) effectively to achieve better simplification. 
 Derive the simplified Sum-of-Products (SOP) boolean function from a completed K-Map. 
 Recognize that a simplified function results in a more efficient electronic circuit with fewer logic gates.