Tutorial Merged
Tutorial Merged
Tutosual- (r)
Que ()! Caleulat the miimum nom Zeo baye fesA ohich
the
alloung opeabhs ae ue
Cç) 3XI|=33
Cü) a|=
J4|= 5
And t e
folbuing'
ci)
cü)
Civ) 8's omplomont of Q670 )s
to's Conblemout of (5690) to
(vi) 16
Tuto al 2
belos:
Considen the
{Ass): E(,3)
2 e40. Then
Q.6) NAND
The mintmwm numben 2 input
qired . to implerest the
gtes
Boolean
F= &+9) (z
drcit hon fnd
for the logic in
value m o AB,C.
the
that Consis t
Consdea Code
valid Cod e beloo
Aistance.
(0) The
minimwm
maximm
hammi
no.
eOneous bits that
ve
Imblement the uction
neton - a( btcd) +b waint ony
NoR gat
Give the.
the minimum too- level Sop Yenliz atio h
functon
HAND Gates
A+84) t
) B+Bc) B+ B) (B+o)
12 -bit Hampinq code ohose
14) Host A tras mit
OxE5F asties fo Host B
HexadecimaJ
oho the end. The m eolum
\nsated fon fo
Design
koo a-bit kinauy numbes.
Dra the
sim pleat pasilble ag diagran hat amblama
choun belo:
B
6
DsuMe
eohich
Bagie dihgram ung NANO ga only
C) ANO
(2) OR
(3) NOT
(t) NOR
(5) ex-oR
(s) e-NOR
Y= (atc) (tbtt)
Debign Comhinahonal arcuit to Con yeut the
input ABCD Jo code. (Take nput 0be 4st)
Explain eaoh eko detei.l.
Design
mumben
onbinahon artuit that acee7t:
ingut and genea an eutput bßnasuy
numbey qual o he quane În put wumben.
Cleyakr
Creuit
HA HA2.
Find the no MOX
implement MUx,
muliplereas) aeq wred to
Also da diaguam
A 3x
deodey ha wed to implenent
adde and ondy Q- input DR gate.
culable to
te
je
outputs Thu no.
OR
gates y1eid i's ?
Considon the Cireui t
Imin given belous
tems in
tlapic,o)
A
(5) A One bi
adden tekes 45 ec to
Prodee. Sum
nsee to
A
bit pantlel adden frodi
o utl addes the
desined this *ye
Selond Can be
max Yate addu Hons
providod
oddey is Ax lo6 addstony pallet
Sec . the velue
Design a
Imlement Une
8
deeode:
Inlemeat
wit
Pla,s,c) z Emlo,,4,s)
MUX. wit A ond
celet Lines
Assuume that the. Ex - OR hay a
Propagehon
tthat the.
jades hawe
twhat is
the dely
propagaton delay imeme in the
LooK ahod addes