MODULE 4 - Boolean Algebra Part - 1
MODULE 4 - Boolean Algebra Part - 1
Abacus
find topalasg device.
hundreds and o bm]
in unit,tens,
Btads ae
’ Four
Number
"Deciwal Nuber
" Binany Numbur
Number duysbm
Detal Numbr ysim
Hexadzcinal Nuwiber dystm
* Becimal Number dyl
Vuet cowmendy sd vwnbu dytim
7, 8, 9
dywlols : D, !, 2, 3, 4, 5, 6,tylem
1adix o/ deimal nD. is iD.
Base (ot)
o dymbels msed inthat
Bre Numbn dytam =No.
:
Nott
b¡:(5426.9),o (Numbn) pse Bose
x(D
ID 4 4xlD+2x ID + &X ID +
= 5X
2 9
Numbs 5
2
Pesticn 3
2
ID 1D
ID
5x10 5DD D
3s 5 hue)
Nale cigt
west
[MS]/MIB
MOST SIGNIFICANI DIG1 is caled as
RigBit mirt diit
BIt
having lat wight
DIGIt [L4D]/SB
KE AST SIGNIEICANT BIT
54 26 1
MSD
SD
MB 4
Numbu
Pbitien 2 -I -2 -3
23 2 22 23
Position 3 2 1 -2
g'
Valar
aystim
-(3560).o
* Hexadtcimal Number
23, 5,4,l,8,9,
4 A, 6,,D,E,E
Uses le lymbts : e,
-’ Base: l4
Numbr D 4
- 2
Postion 2
nightng 3y 2
Vae A(3hee)
-(68),
to Anothr
43 2 -|-2 -3
T6 t g+ 0+ 2 + 0+ o40.25 + b.125
26.315
( olD. oI), : (2c.345),
()
(1o1 -Di) : (?),
2
,2
+ x2 2
- 4 + D+ lt0+ 0.25
= 5-25
.: (to1-or): (s:25),
2
I-625
(154. 859+), D
() (iD2.41),- (?),,
32 iO
5¬2. 515625 )
a Hoxadecimal to derimal
co(FAL D) (? )
+ 6xIL + 2xe4DxiL'
3
Fx6.
I5 xIL + (0 xIB4 LxI6'+ 2xIL' + 13xls'
48 3D4D+4LD t 1S 34+ 32 +13
102558|)
Covnsion Bcimal
y
steps:
divsion)
0 Lntier part Convutipn (du cusire
inttqtr art (Gin number) hy hau
’ Divide the
tquired Munber (R)
qurtint (6) and Remaind1r
Slor
decimal numbr
(onsidn Quotient s ni)
~rt .
Qnd reprnt te divisien unil quolint bt eomes
in the Verse DYder (Rad Up)
’ emaindus
list te
@Fracional part Conveion (ducesive Muliplication )
’ Muliply dhe
t fuactional part (qina nunadr) with
base umber
store tht
ntgr pot (amy)
- Considar facñenal
until factonal is D(or) untl
fadind pont
Brcimal to binony
(0 (12. 25), te binayY
doluticn
Inttgn pant: onvviem z intqn pot by duccasin
diision mothod
12
6-D
9 3-D
Read p
Fraional pot: (owesim of taclienal pont by Bucsiw
wltiplicalien nethed.
0125 xX) 0.25
D25 X2 =
Read desn
1-0
(o-05), (- oo) 2
25X 2 = D.5
(0-625), (o- lo) 2
0.5X2
.. (49-625).: ( 1D001.I01),
) 5 cimal to Otal
) (45-62),p (?),
Arlutien : ntrgs pant
q-3 (),: (1s)
Fracimal pant
4 .94
5.44 5
Read doOn
(p.b2).4 45),
.
(#5-62),(13.4153),
() (659. 825), (?).
delatin : Sntegen pant
3458
882-2
Io-2
(is),- (i222))
81-2
Fracionad part
D825 X 8=
4
6.4
(0 (45-4) - (?).
Avluapn Intrgo pont
D- 4
(15),:(48)
frationad pant
D-62 XI6 4.42
D.75 Xl6 =
( -c
13
) (41-5),, (?).
aelutin: Integn pont i|97)
IL|60-l| ’B
3-12 ’C (41) (D
(3CB)
Fyaciona t
O0x(6
(o-5), (o. 3),
(47-5) (3C6.g0)
to bital Convension
stips:
) Nake group it 3 kit from LsSB inleyg pot
Ztres at end
md MSB
poat, Hy addling
) Rite equivalent Detal Numbu for each goup
3 bits
) (QriDl:1o), (),
point 5
3 3
5 . 3 4
5
5 3
DI DOD DID
3 5 A B
DO1 DioD OIDI 1010
tw (134.6) ?)
3
binay 000D
Hesakucioo O|D| |/D0
Hiaadecima
5 C
(5C.D),
|0 0()001 000
(3)
(4) (4)
(F)
A21. 35) 44),
hexadeinal to Octal
mtuqu pat
15 05 .5 2 6
(B45-AB),: (1505.52),
(i)
(Fe),,: (?)
E 1
DOD|
(1 4 )
(onplumunt Ginany Nunmbre
() DIO | | D
it towpl1mt
2% Complment nds
adding t 1
1
o1o01) 2B (osplenant
enl
mint
dubtraticn
Bincny 2'5 lomplwent method
And 2%
Subtract A-B
|00
) Add both
() Add buth A : ||O
B: lo O
(Priive)
to Tuut
tunyLps tand
2
t
Resutt s Positive
Prublews (B)
mthod.
áowtion A
(IDDI.IDI) (.10) 2
0000 DID
() Add brth
A + s B
IDOI. 10 |
() No Result s-Ve
-Ve
- 0l0-00D0)
dukiact (1OL- H) kom (I1|11- D) wing
2 2
2 tmplemut matkad.
drlutin A
(m. o) - (mo1-n) 2
Add A + lemp oy B
+ DDDID DDI
3| t m=
n =01000 IDi
Fint takt 2t tomplment n n
Add mm to Jt lomplmunt v n
(DIDobo DOI
cany
(Ioo loDo)
Bh-m)
First take 2s complemnt m
ODIDI DDI
Result No Cay
-Ve
|O000D0
Answe (- 100l00o1)
BooLt AN AGEBRA
Buplenn wallawalucal lbg
laws otd
Ceulaliy law m addiiu and Muliplicatn
Akocintive law additinn amd Multiplcatien
Rutibutie law fr uiplicatien ovea addtn and
Aadiien oven
() AND
@) OR
(ui) NOT
’
blocks ircuits
Basic Gatis : AND, DR, NDT
Logic Gals i AND, OR, NOT, kOR, Ex NDR
)
NOT Gat
-’ Kwewn fnvetn
Tuth tobu
A ACinput)
Ylouput)
Y: A
R] AND
-’ Mininmum tw
inpua Truth Table
Bovleam éypresinn
A A B
Y: A-B
Y AB+ AB
5) NDRXNOR gale
XDR
Y = AB + AB
Y. AB+ AB
NAND
-’ AND gate ith alput iunvotud
’
output
br il mitha is hign .
Booluam Expiuion Truth table
y A" B A B
1
8] NOR ga
An DR
with oalpul Dvoaled
gat with
ohen A and
and B
B au
Truth table
BorltanExpsn
A Y AtB A Y-A+B
B
Borteam Aabre
Name AND orm DR orm
D+ A A
|·A A
D.A0
) Nu kaw A+A A
A-A- A
Law
) lumçetut A A=0
4) Snvese lanw
A+B B+A
9) (otative law A-B = ß.A
A- (B.c) (A+B)+C- A+ (B+c)
4) A80ciotive law (a-B).c-
A+AB= A
") tbsoplion lar A-(A+B): A
B) (A+c) A (B+c) AB +tAC
) subibtive law I A+BC- (A
A+ AB : AtB
9) fstibubve law A( B): AB
A+ B A +B = AB
Law A.B =