0% found this document useful (0 votes)
17 views

mike 2

Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
17 views

mike 2

Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 9

Kondasani chaitanya

2024 cb 01 731
1) solve the following gucstions pex givcn
instsvctions;
a) To conve s he hexadecimal valur BcA9 to the
oclal ninmbes syotor
)Convest Hexadccimal to Binanyi 4-Bina ry
Each he xadccimal digit corresponds to
digito" :B 101l
"G110 0

." BCA 4 in Binasy is :- [201111001D1 010 01]


in
s-bis blocks som the right
indo
hsoupoctalBinaryconvession:
ii)-fox
’571 224
"10111100 101 010012
2

Convst cach grp to octal:


ii)
001
011
110 = 6
010 : 2

136251
,' BCA 9
q in ocdal is
&:
b) Convest (&3637)o to base 8 in decimal is 10
-

)Convesd the indeqe x pastl8) :- &


in base
) Convest he saction past (o3637) :
Mu tiply
Hhe fractional past by xpraedly
stsul!
taking fhe ndegcs past o! the Cach
time:
’03637 ×& = 2.9096 ’-’ Tdcqey part: 2
)09096 x 8 Z2768 -
’0:2768 8 = 2·2 144 TneqeY past

stop ales sufleientnumbes ot, digits


i) Com bine th esuto Halional
t0, and the
The pat is
indeger0:272 2
is base ,
Past is
Thesefoxe, (83637)in in base 8 15 :
(10-2721),
2) solwdion fos he ciseuit output F:
i) Left mulliplexe (2x4 MUx );
Tnputs ;-I, 1, I =0
selcction
The otpt Y, is dedesnintd by'
XIo B=0, clse Y, I,
when

) Right MuHiplexex (2x1 MUx) ;


Lnputo : - I, =1, I, :
Selechion inpud so A
The outpu! F is dedosmintd by i
F= I, i! A 0,clse F=I,
Now sJbstitude Y

. Whon A=0: F-1

Simplily - F A' AB!


ovtevt F i6 F A'+
Tht
3)
a)WeExpanded txuth table '
need to caleulade he ovtput Ffos all
Combinaltons i f inputs 4 bo Aand B
and Compto fos Cach case basod on the
given conditions

Co A Fnction e)
(A+B)'=1

(AtB)'0

A+B 0

A+B =1

A
.0

A 1
AB 0

O F= 0
1
1
(ae) NOT
b) 41
Mux

XOR

OR

To implemert the cisevit yaing


ciscuit
we will
4- to
Components ;
mulliplexrs to selecd one o he four honchon
and o and se he olher gates
on 4 tach honcdion
basrimplemend
to
are connec-led to hely
Tnput A B Gy and
Y6pechve components.
-The
Conmpuker A+B
NOT gat nvets A+e to psoduce
psodvce (A+8)'
.The
@e
. The xOR gat computes A
Ciscuit implmcatation
To implment the cisoit
)4- to- 1 myHiplexex
Tiputs e)' (o4
I (A+ ,tlowrd by invceh)
table
9gencratd, oupt
B, iF The
given he pey as
(a+e) mpule A+B Tnvext
co do
Ai8,calculae To
gati e ORiv)
logi,
nal tyat
tsat Conscons face muliplexeY the wHhin Ustd "
gate AND i)
;A+B:so* Output
iAB Tnpvt
i,gac (XOR) )Exclusive
OR
Co
Cyand On
based i-
Foutput .
4 inputi
i{conslan
01 0 I.
gat)e (xOR B
A 3 T,
4) [OR RI, R4, t0 xFF 1:
imolcmlalion os #0xEe
a)Hasdwase he instvcion [oR RA, R1, #0xFF]
To implement follauing componomd;
the
fle;-oains R
"Registey
.g-bil onstand gtnesatos, loxFE
Gaencsades Hhe otput.
Bitwise OR gate output 'back to Ry
!- Wsite Hhe
Wsite mcchanisnn
Diagvam i
loRgat --Ri
lipdak!)
Corstant [o xFFl-- --7
#Explanallon qoneade d and ibilwise
The constant [oxFF] is
DR-cd wiHh he valuc
CnsUs5 that all bits in Ri
The DR- qate value [ ]resulls in C2)
to L DR-ing any
is then wsilen back iato Ri
. The output
R and Ry
b) Maximum and Minimum values
for [MUL RI, R2, R3]
AnaTheysisinstution
i MUL RI, R2, R3
muHiplirs the
(ondends Re and R3 and stosrs the
XC5Ul in Ri:
Since
. K2 and R &-b4 stq ls ders, thelx
Possible valvts angt om. D to. 255
(o x00 to O FF) n hexadeimal
+ Valurs
}Manimum valus'
The 'minimum valueR and kRy is 0
Ky =0, ky 0

2) Maximum valucs
The values of R and ky is k5O25
ki25s
lalaulaion;- yx 255-x25y (5025
&- biliy only the least
5ince KK is aye tosed
Signihcant 8-bids (0x 02). ae

los CmL RI, R2, 45]


JHasdwa¢ Tmplinndation mL RI, RE, Rs J
he
implemat componnlsinsiithion
guised,
Hhe folloing Contains Ry kz and Ry
Reqis tey le - eisibt-.
"g-bit mu Hiplies
Hiplies two &-bit valwes
Mo
Tuncalion mechonism; s-bihs ol
least
Extracds the least slgnilicart
thc product
"Wite mechanisn'
Ri-
o R1
Wyides he otput back
Diagrom!
-\
MHiplies--TsuncalelLse)-
Explahaon' and Ks inputs, and
"The muHiplies takes ey
theis pYodvct
Computes
e-bils, ony the least sigo ihcant
n Yesv! axe sto sed in RJ.
8-bids ol ho
that ho muliplicahon
.This ensuses
wiHhin he seaidos size of R.

bilidy ard addsass space j


) Adsrsa
Dalinoions
4) Addseas abiliy: lbcadbn
The size ol cach memosy
Given that he emosy is , tach mmory
lopation Can tose. 8-bis
Answes ;- 8- bits
2) Addrts5 spae i locodions
The fotal no ofaddress able memoxy
"Wrhin g- bit add sess, he memosy Can
within an
add ses locations
Answes.- 256 locations

You might also like