Scribd
Upload
27 views7 pages

For Teaching Karnaugh Maps A Level Computer Science

The document provides an overview of Boolean algebra concepts, including Karnaugh maps, flip-flops, and half/full adders. It illustrates how to simplify logical expressions using Karnaugh maps and highlights the importance of certain inputs in determining the output. The document also emphasizes the structure of Karnaugh maps and how to work with them to derive expressions.

Uploaded by

dbeasley
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
27 views7 pages

For Teaching Karnaugh Maps A Level Computer Science

The document provides an overview of Boolean algebra concepts, including Karnaugh maps, flip-flops, and half/full adders. It illustrates how to simplify logical expressions using Karnaugh maps and highlights the importance of certain inputs in determining the output. The document also emphasizes the structure of Karnaugh maps and how to work with them to derive expressions.

Uploaded by

dbeasley
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 7

BOOLEAN ALGEBRA, FLIP

FLOPS,
& HALF/FULL ADDERS
LET’S RECAP!
KARNAUGH MAPS
KARNAUGH MAPS

0 1 0 1 0 1
A A A
B B B

0 0 0

1 1 1
A XOR B A AND B OR NOT NOT A AND (NOT B OR A)
B

AB 00 01 11 10

1
NOT C OR (NOT A AND NOT
KARNAUGH MAPS

AB 00 01 11 10 AB 00 01 11 10

CD CD

00 00

01 01

11 11

10 10
NOT (C OR D) AND (NOT A OR (NOT A OR NOT D) OR NOT (B AND
B) C)
NOT B KARNAUGH MAPS
0 1 0 1 0 1
A A A
B B B

0 1 1 0 1 0 0 1 1

1 0 0 1 0 1 1 0 1

If an input changes K Map boxes can only ever be around 2^n 1s


but it still outputs (1,2,4,8..)
one – that input is
not needed for the
0 1 0 1
expression for that A A
box B B

Work out the 0 1 1 0 0 0


expression by
“Or”ing together
the logic gates 1 1 0 1 1 0
represented by
KARNAUGH MAPS

AB 00 01 11 10 AB 00 01 11 10
CD CD

00 1 1 1 1 00 1 1 1 1

01 0 0 0 0 01 1 1 1 1

11 0 0 1 1 11 0 1 1 0

10 0 0 1 1 10 0 0 1 0
KARNAUGH MAPS

AB 00 01 11 10 AB 00 01 11 10

CD CD

00 0 1 1 1 00 1 0 1 1

01 0 1 1 1 01 1 0 1 1

11 1 0 1 1 11 0 1 1 0

10 0 0 1 1 10 0 0 1 0

You might also like