NuMBER, SysTEMmoteye edwn loissh

Jhere
is Non- posttiora numbar, syshur,
() Posttioral number systam

which
whch we count 4he numbes the
Jhe numbars sustom in
in
shicka, stone, ote is called a non- poshion
systom
* Jhis s traditional appToaeh os counting Ahaha nmbers
() Posthional no systorn
Prenco numbor oh synoola ohich
and the digih Koproserla ditbersent
valuss

depanding upon thoir postonu whato hayhich,

oep
ean b oeend
detorsningd by. the vau
by?
() Tha
posihlon os tha n the number
(2) The
(3) The bo tha nunbers' syston
Kaptes,ented.

Tha ba is dekingd Aha tota number o diqt avatlabl

nunbar ssto
ypos os posttEona namtber sytom
Binary (6)
(b) Deeimal ( ) Hexadeimd bae= l6(0,10, A,.F)

(d) Haxadeima.
Decimal Nunber Sytam
the deeimal naoers systamn
* DUSerent ,
0,a,3,4,5,6
Wd hoes, hance the ba
t,t,9.
Sinee 10 symbo
systam is i0.
in daima) osm
aprelert ay nunbort in onampla
(I076)0
Binar Nunber
Nlug Systen -
* Ih this numoers Sustorn diatta the
0 and 1. Hena,ho bae is 2.

E-| ’
gosthioning
(Ix 29) + (i*2?) + (0xa') + (i2)

(Ix8) t (4) t (0xa) t (ix1)

= (13),0
( 101Í)

(1x2") +(1*2)+ (0x2) + (ix2) t (0x2°)

=( a6)
Convot dacima Dursboo binogy nunbarr
T
(3a),o

a16 (100000
 (1x°) (5x$)+ 40+7 0t
104+
(0xe?)+ axe')+
(a057) En-l
nunbar
irn octal y
represant to
anougn
to is a
ht bathe ok
powu spacifie aprelanaa thre Sinee
diqit Each *
th
a thare which systoro
in Nuntbes posthonal
is This
1
1 14
34
(1001110000) 156
31
624
(6a4) f-’
|4
58
(11101001),
33 a
467 a
467)i0 (
 Conveaton ob binaKy tnto octa a(Fdp )
Ex
1. 00\01o1OWLO10|01
1 55 65 6 5

haw to do a
pairing of binauuy numbar o7 3 blt ach brstm Kight id,
Step-a Aftur making the paurs Comvort

to mako t a pait
Decimal Octa!
Biraxy tHoxadecinca!
1
1
10

11 2

100 4
5
101
110
111
1000 10
1001 11
10
1010 1a A
11
1011 13
1a
1100 14
13 1 101
1.5 D
14
1110 16
45 1411 17

Hexodacirsa) Nurobeg Syhom

%Jhis oriqina nmber sytum which hau a totaJ
16 syrsbo 9, A, 8
10 | \2,13s 15
K Hence te baAe f the
number syst om ts 16.
 A,,c,D,¬,F aptasentha nurooa 0,1,1a
13,14 and 16
* Jho manimun valu ot the single digd hexe ta 5 and ha
pothions ok the diqth apteon a spacikte fouers o 6
k 8inco the ao A6 digi, hanee 4 bis
any hanadeeima nunb axe sus7eciert o reprOJO=

Oton oo
Cenvaraion hoadecino unbrr to dacionod unbes
(1 BF),
2 1 0

(1x16)+ (Bx16)4 (x\6)

- a56 t (l x\6)t (15 x1)
= a56 t 176+15

Convoson
Koton ok docimal Narstbgr o
(452 huiadocina) nunbors
q52 O
(1670).
4

() Converst btnary number to dacisal inambiy:

(Ix24) t(ix2) + (0x2°)+ (Ix2) +.(ix2)
( Ix 16) t(Ix*) t (0x4)+(1x2) t (Ix)
T6 +& +0 +2+|

(21)0
ca) Convat decina numbU to binay
numbur .
(a51o 2|
2 |
2% 0
0 (M100),
23
 (204),, - (310|
209 1
(3401) y
13 1

(a) conv ort (I476),, -(0500 )

6 1476 0
246 (10500)6
41

tractonal Nanboa
* Fractional nunbar 4ho same docimal number
systom. Horu, there ok docimat point ot a
pont wheh rapresort
presenee
bractional numbL biray
Postton 1 -1

Postteonal 3-3
Vee
4 a 1
Quantety
epresonted
16

101.11
(0xa1) + 1x20)+ (1xay4(l xa-2)
- (1x a)+

5 4 0.5

5.15
 CHARACTER (ooES
alphabotie deta ie, A, , -)Z and he
which ts a straina o7 symbols and alphanumerie
dta which is
onsist tha symbo ma
iko t,¥y/, te lphabod oT any tpeiol charator
* Computr codes
uud to Raptesant
En the
compudr. As 0Q Kno),,Ragrannt
in
in intarmally the data
binay numbuts oT Intorna coraputc. we önly
4ha binary
*h binary coding nunbursKaprasentotton
for intma
4Henca ha coTBk
es
and the group of t bt taprosontod
Keprelantdton,
ii called
cornputir Cedos ute BCD,
Biraruy Coded Dueimal (Bco) - ASCI1, EB CDIC
* Jhis a chaa tor
4he intna eoding. tuchniauo hieh
Raptesant
ho
epttesentatton
ditbecent Sinea, we
ehatados 6 btt
6 bih tur

BCD Codo
on Diqit
A
0001
l000
|001
100 T

H
1000 X
\001
k 1000
0010
M
 No.s
Zo Digit
O001
2, 00 O010

O1 00
00 O101

10 00
J001
00 I010

Show the Bco eoda bos the wod BASE

B= l10010 A |10 001, S- 0l000., £ = ||010)
0010
Show the BCo code torr the wosd iORD".
9 I0O110 .K 10 l00l, D= |0100.
Show the
N= |O0101 :7 1O001,Z 011 000, N= 10011,£ : II6101

Show 4he tor the w0d SyNTAx"

S= 0l 0001, N 01o111, N' 10010l i Do10, A I1000),

Show the 1BF.

1 - 00000, 10010, F |10|10

Ertendgd Bitay Codod Dacirmal Irdhang

Cadad Det (EBCOTe)

btin tndenaJ Kepeeentadion

Reptesard)S* = 256 "ditbartent ehanoatus.
cha Cod
Zone diqd
A
1100
1100

1100 O100
O101
1100
G 1100
H 1000

|100

K 1101 0010
|101

M
N
I|01

1101 |000

1110

1110

1110.
Zoned Decimal Nmbo
Jhexe {s pROAonco o5 peckod do cirnal nunbar uhich is tomad
by
Jhe diktercont presor) ahoos hohor he numb0r is 4ue
nonibicart.
F showS thot the numbor is
Jhe
i5 thote's
Saymbol tW and
und is thoxe' prtesente o D" t showy the
ny nmben is rovidad t6
besíde Ahe iqhhmot digtd
4hon ho zono ts wrion
-326 ’F2F2 D6 a26i
ASCI! -
Jhis s a uot doly wed eonputer eoda hich is
Arnertean standarsd odo SornboTnation- callod a
Jhis code is populaR in data. Enterchangg.
cormmnication and wed
ntnaively to teptesentthe data entnatly en mieRD
s divded into CDmputr
() ASCI? two,typu:
chanator

asi hUtatea;
No. ASCT1 -
No ASCTT
Diqtt Digit
0000
000
001) O001
0011 0010

O100 O011 O100

O011 O101
O110

| 000 I000
0011 100|
I001
chos ASCTT Codo
Diqt
A O100 0001
O100
O100
Ol00 O|00
ol00
F 0100
G O100
O100 1000

O100 1001
O100 TO10
O\00 1011
L 0100 |100

M oI00 |101
OI 00

0100
O101 O000
O101 0001
010

T ol00
O101 O\01

O101
O101
X O101 1000

\010
 Boolean Alqebra
* On binaks number sustem.
to dastg 'he Anaie te cith shich hatps to
proceu
prusenee osof dissrent Boolaan opators which aea
boolsan algubna.
tmoortat boolaan operatoa oue:
( OR oparsators
(i) AND operotor
(i) NOT operrador. eomploment operrator ?
(0 OR Oprotor
4he Angtcal addtion opedor
* Jhe sumbol
)
to rapreaserd the OR" opeTtuT
xTI w0 conidor ans two 'nput volue o
OR opQsator ean Eapterted uheeo
4hano wtll be 2?4 orsloinattony o ho ?nputy.
inptu and B. Four eonbinisng
o5 the input wUl be 00,01,10 and i1.

The KaAulting output values

providid) i n h tab uhute
be
Kopeel antng
tapees both
anding bott ingut and outt:
When both th inp ot the OR tobla s O,than the
outpud ts
alditton can wtth sn
cikuit by o5og qat that operato
more input
inpub ond produuee sne standacd outpud.
* The OR addition s physieally raalisad by tha hap ok thi
OR qate ts qven balous:
 A
C= AtB

B
are the tuo nput ano e is the outpu.
sudh tabl ok 0R
A

() AND Oporrahu
K This operodo is wa
wlad to dotin the synbo (-) Known as AND
opeTatoT
Considor A and.8
then be' KopOsented odput
Toulh table ob. AN0

Here the outpud l 4

whun boh tha inputs
othemuiso 4

AND OpeTOt os. eanbe,

Jh
o5 ND loqie qae uhich physiealyKalid by tho hal
A

Here 4ha too inpu und e is thio oiutpt.

(i) NOT Operodor
NOT oprador is ho called a tha eorm plemantaton operator.
is unay opasator
1he input qtan to the NoT qate wtl be comAomantad and
wil qet jut the opposita" o5 the input
* Jhe tuth table o5 NOT operoor
A A

i Jhe tNOT Opesador can bo tha

qien baloo.
ically au qen
A A

|A= A

Unôoesal Gota
* Apart frors the oR,AND
A and NOT gates therto is auo preenco
ob two univeTsal qotu ie, NAND gd
q and NOR gate. Jhoy
univerta qoder becans
utng all thers
() NAND Gae
* t ts the cormplimanteAND qte ioe, the output o5 NAND
qate wl be equal to 4: +Hoe,it both the nput Qqual to
4 then the output es 0.
Tgudh table o5 NAND
A

Syaboalieatly ain KepKelen the nNAND qato

 D
A

B
() NOR Ge
NOR qte is eonplimented oR
OR sy the oudput
will be 4 when,
when boh the inpta
Tuth tabl o5 NOR ato
A

ate is apresented as
A

A
 ipal
Opersotor Symbola
R C=AtB
[A4B-]

AND A

NOT

NAND

NOR

Knduw, l0gte qt áre alatrsie eirutt thad oprrala

ong v mo npua siqnals and hey oduca a tand
atd output siqn.
* Jhe oqie ge Logte
Ahe combinatlona ogte
the
be tha buil
building
ding bloek1 st
*Fom a gtuen boolean alqebraie
Logce cruit by
enpeslon can dorino

Abuward the outpud. systoriattealy proqseaing trom inpat

*Jhe ho
main oqte qas OR,AND and ÚT
 into
qiuan boolsan rptoston
(1)

A
AD
D
BB

(a) F XZ + XZ.
X

(3) Xo

(ZtA)

X.y (Z+A) + 8
XOR Gat Eneusio OR? -

A s shown tth the halo o. ymbo!X

Awo tnput and one d5 ham is actu high
and the
Low

Truth tobl ok X0R bperator

un KOR
opRend XOR qade

TInplomerntation o5 NOT, ANO and 9R qat by NAND qot

0 To Rrnplement NOT qte by NAND qote
Ong NAND qde by'gtvêng he input thrrough tuo pot
A A

qate
MAND
A

(3) To tmplerman
the oR ate by uaing NAND gade
the NAND ot A

A-B =
 X

By wing NAND hate

--AND

D
0R

Inplementation o NOT, 9R and AND ge by uang o

Stop 1 ’ Fore the qtuon lgebrraie npraton chan he logic
dingam by ustng AND, OR and MOT qodo..
A. NOT
step a ’Druo he quivalan? Loqe
tha gates with ony NOR qate dingram by taplaing al
0

an
prsoeeduro raplaes the ;NoT qats by wtng the solloutn
T6 irnplemant hthe 0R qate
A
too NoR qates

Implementaton ot AND the NoR gaa

A

AtB= Ao

AND?
 A

B B

A+ B.D

Tochutates Booluan Agba

ohen
and only when A0
2. X+ 0 = X nd

4 soeiatio law

5. Disiributio law

X" X = 0

Minirsisidton ok Boolaan oAPion

Elhe nnimisation ot ok bool an fundion dal wth oduton
numbar Literaa
take boolean eprenon
nptenion like (xY4) y
toïntnise
L= y ( X+ X) = y.
fot- i) F=
Ae(B+)+ A

A+(B.c)

Canonieal Fosto o5 Bolean Function

vantasl roy appeas Rthet n nosroa otmtA)
and then: we utl ha 2 4 eombinaton they

Jhee's preenee o5 tuo0 am in the eanonle a or

that a

bours ontotnaton atun bo

AND prrodu et aund ealled
Ropresont the Combinatton by tha help o OR
oparsato ha whih
(1ty')) (at y). And thee combinaheon
ho roantermA
Kap teen the mintemu the
do tha we. h dQi naion
M. MEnterons
Tert Duignaton IMarterms
0 Mo Mo
M,

yz
My
My
 Sum o roducda - isor?
Logieally OR ed toqother

Step-4 ’ Construt a truth tala sor the

Step-a ’ tosm tho aiun ooolan pTaton
vartabl whieh rrodacs
tep-3 ’ Jhe desirad all h
pTeton

mintmiaotton o the
KanauLgh man and d
a
boolaan neion. e KMap te
diaamdie aprrbaeh by whteh Represend nurlo
b minim ize .

Steps toT drantng a KMag

St Toantom the

StepA’ Find out tha no. ok voriabls En tha bDola an epTeAaton

KMap geetorra Kupresermadton
lonseshing
stepy’ Jhe no. o sqMte n the KMap depends. on tha nn
hoo varlabl
thn
Rapresent qiian baloy
10

h enput
and upstde
 Rulos to tolbw whil drauoing KMag
*Yroup may not ineluds any cal, eantoining zotD

dingona.
th qroups mt eontain in
qnaral'an
*AU
posscblo

Tp arsound th tabla to mako qsoup whu

the wrapped with the stnt host eol.
"The top col wpped wth 4ha oottom eoll
Jhexe should posstble .

Menimae tho boolonan

pait- 4

Mininie the b0oluan oruton - (3,4,6,7)

paur-4’yZ

4 4 |1 ’
pai-a

1 0
1 1
Minimize thehe bonlaan pTeston o7 fayyz) -(0,a,,5,6.
00 10 Pain
4 1

(1)y(A, B,c) |(i, 3,6, 1)

A 00

1 A
1

ACt AB
A B
’ ABe
’ A8C.
(a) <(A,B,) = 2(, 2,3,5,7).

Pai 1 ’ c
1 A
B
4

Pain a ’ AB
lhis K- Map eonsicta ok ous yaia lblos Henee their wel o

ha Solow the eules KMap o in 4he roriabl

2(P,&,R,s) = y ( 0, 2,5,,,10,3,5)
RS
Pa 00 10

1 4

11
1

10 1 1

PRS