Page 176 - FUNDAMENTALS OF COMPUTER

NPP

176 Fundamentals of Computers NPP

Solution: hc:

(a) F = AB C +.. AB C+. + AB + C (b) F = ( A + AB + C ) . A B + . C

F = A BC +.. A B C +. .   A +  B + C F = ( A.A B . C . )  A.   B . C .   

F = A BC +.. ( A B C+ ) . + ( A B+ ) + C F = A A BC A BC. . . . . .

F = ABC + A C + B C + A + B + C F = 0 ( Since C C. = ) 0

F= B (AC+ 1 ) (CA+ + 1 ) (B++ 1 )C

F = B + A + C
3.15 Implementation Using Basic Gates 3.15 _yb^yV JoQ>m| go Bpånb_|Q>oeZ

Note: ZmoQ:>
1. Whenever you see a . (dot) between two or 1. O~ Xmo am{e`m| Ho$ ~rM . (S>m°Q>) {XIo, EH$ AND
more variables put an AND Gate.
JoQ> H$m Cn`moJ H$amo &
2. Whenever you see a + (plus) between two 2. O~ + (YZ) H$m {M• XoImo, Vmo EH$ OR JoQ> H$m
or more variables put an OR Gate.
Cn`moJ H$amo &
3. Whenever you see a – (Bar) put a NOT 3. O~ (-) ~ma XoImo, Vmo EH$ NOT JoQ> H$m Cn`moJ
Gate. H$amoŸ& Ÿ

Basic Gates _yc^yV JoQ>

AND OR A NOT
A B A
A+B A
B A.B

Problem 3.28 àíZ 3.28
Implement following Boolean expres- {ZåZ ì`§OH$m| hoVw _yb^yV JoQ>m| H$s ghm`Vm go
sion into logic circuit using Basic gates: Vm{H©$H$ n[anW ~ZmAmo…
Solution: hc:

(a) y = A . B (b) F= (A+ B )C.

A A (A + B)
A
B A.B B
(A + B) . C
C
C