Scribd
Upload
73 views7 pages

Digital Electronics Module 6 Activity

The document provides 4 questions involving completing Karnaugh maps according to truth tables and generating simplified Boolean expressions and logic circuits from the maps. Question 1 involves a 3-input truth table and map. Question 2 a 4-input truth table and map. Question 3 uses a map to generate an expression and draw an equivalent relay logic circuit. Question 4 does the same for a gate circuit.

Uploaded by

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

Digital Electronics Module 6 Activity

The document provides 4 questions involving completing Karnaugh maps according to truth tables and generating simplified Boolean expressions and logic circuits from the maps. Question 1 involves a 3-input truth table and map. Question 2 a 4-input truth table and map. Question 3 uses a map to generate an expression and draw an equivalent relay logic circuit. Question 4 does the same for a gate circuit.

Uploaded by

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

Karnaugh Mapping Worksheet

Question #1

Here is a truth table for a specific three-input logic circuit:

Complete the following Karnaugh map, according to the values found in the above truth table:

AB\C 0 1

00 1 1

01 1

11

10 1
Question #2

Here is a truth table for a specific four-input logic circuit

Complete the following Karnaugh map, according to the values found in the above truth table:

AB \ CD 00 01 11 10

00 1

01 1

11 1 1

10 1 1 1
Question #3

Use a Karnaugh map to generate a simple Boolean expression for this truth table, and
draw a relay logic circuit equivalent to that expression:

Let: F = I

Answer: F = B.C’

It is the same from the presentation’s logic equivalent in the example from the don’t care
condition part, unused inputs are neglected.
or at TTL Logic, unused inputs are connected to “1” making it an enable circuit
Question #4

Use a Karnaugh map to generate a simple Boolean expression for this truth table, and
draw a gate circuit equivalent to that expression:

Let: Y = I + II
Y = A . C + B . C . D’

You might also like