Computer Science, asked by anitawadhwanip5dx74, 10 months ago

36. Given X= (A, B, C, D) - π(0, 2, 3, 4, 5, 11, 12, 13)

Use Karnaugh's map to reduce this function X using the given POS form. Draw a logic
gate diagram for the reduced POS form. You may use gates with more than two inputs.
Asume that the variables and their complements are available as inputs.​

Answers

Answered by Anonymous
0

Answer:

Simplifying Boolean Expression using K Map

Consider the consecutive 'ones' in the K-map cells and group them (green boxes).

Each group should contain the largest number of 'ones' and no blank cell.

The number of 'ones' in a group must be a power of 2 i.e. a group can contain.

Similar questions