Page 219 - FUNDAMENTALS OF COMPUTER

NPP

NPP Number System, Boolean Algebra and Logic Circuits 219

It contains four minterms of four variables Mma _| {_ÝQ>_© h¡ Omo {ZåZmZwgma g§»`mAm| go g§~Õ
which corresponds to as follows:
h¡…
→
4    0100
2  → 0010

9  → 1001

15  → 1111

Filling four 1’s for the above values we get Cnamoº$ _mZm| hoVw 1 VWm AÝ` hoVw 0 {bIZo na …
the Karnaugh map:
PQ R Z 00 01 11 10

00 0 0 0 1

01 1 0 0 0

11 0 0 1 0

10 0 1 0 0

(c) The given expression is Y= πM(1, 6, 7) (c) Y= πM(1, 6, 7) ì`§OH$ _| VrZ _oŠgQ>_© h¢ Omo
The expression contains three Maxterms which {ZåZmZwgma g§»`mAm| go g§~Õ h¡…
corresponds to the input combinations as fol-
lows:

1  → 001
6  → 110

7  → 111
The Karnaugh map will contain 0’s for the BZHo$ ñWmZm| na 0 VWm ~mH$s g^r ñWmZm| na 1
maxterms, and it will be drawn as follows: aIZo na:

A B C 00 01 11 10

0 1 0 1 1

1 1 1 0 0