Boolean Algebra 2 (Karnaugh Maps)

Karnaugh Maps are used to represent and (a)   Boolean expressions

When ordering binary numbers for a Karnaugh Map, which of the following is the correct sequence?​

• 00, 01, 11, 10

• 00, 11, 10, 01​

• 11, 10, 01, 00

• 00, 01, 10, 11

Write out the Boolean expression for this Karnaugh Map

• A^¬B

• A^B

• ¬A^¬B

• ¬A^B

Simplification of the Boolean expression for a logic circuit would result in a circuit that contains: 

• Fewer gates but more connections

• Fewer gates and connections

• Fewer gates only

• Fewer connections only

Write out the Boolean expression for this Karnaugh Map

• ¬A^¬B

• A^¬B

• ¬A^B

• A^B

Select all correct methods of representing a digital logic circuit

4 correct answers

• Truth Table

• Circuit Diagram

• Karnaugh Map

• Boolean Notation

• Mealy Machine

When creating Karnaugh Maps, you break up the expression at the (a)  

Select all correct rules when creating/drawing Karnaugh Maps

4 correct answers

• Place the variables across the top and left of the map

• The order of the variables does not matter

• Add the possible states for each variable

• Add 1s to match the logic of each expression

• You must add 0s to match the 1s

Select all correct rules when using Karnaugh Maps to simplify expressions

4 correct answers

• Draw square or rectangular boxes around the 1s in the map

• Ensure boxes are only for 2ⁿ 1s

• Keep variables where the variable changes and discard where the variable remains the same

• If the consistent variable is a 0 - keep the NOT of that variable

• Keep variables where the variable remains the same and discard where the variable changes

¬A and ̅A are both ways of representing (a)   logic