0 ratings0% found this document useful (0 votes) 41 views17 pagesTheory of Computation
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content,
claim it here.
Available Formats
Download as PDF or read online on Scribd
Page No.: [o. 1 Date : 7 1202
ASSIGNMENT= O14
Dumonsctrete the positive ound mug citive Using AND gol
Pesttiue logic : :
dn pesitive logic a Logic high ( sual rep rvemted )
as 4) incicatis true a! on, While o logic dove
(usualy represented as ©) inckiceutes fouse offs Jn
dhe Context ef am_AND got, When both Joputs
A amd B cou hth othe olutpuut ds highs indicating that
dhe Condition 33 True:
Truth table for_pesitive logic AND gece’
A} 8 | output
o|]°o oO
o}4 °
1 [0 oO
c dia d.
Negottive Logics
dn n ative Logic, the op esite is hur: a Logic. Low
(o) indicat fale or of: Jn dhe Context of a AND
gate, When bodh Inputs. (A amd 8) osu Low,! the
dutput vis low , indtcotting that dhe Condition Js tine:fowput ee a
os
9
°
1
ACh, FM) amd recline dt using Nok gate?
G3) Simpliyy dhe Booltam function Ff (W,%4,%)* € (01,24
“C4,4,12,14) using K-map and Write the Voilog
Program {or dualthing the minimised Expression
wa? gz
fe eye
ety!) Flarb,c.d) =11(8.3,5, 9,40, 13,14) td n6,41)) =
DP) Min tow. {er 11 (2.35, 2,40, 43,44) ares Mm(2), (3),
|_Mcsd, mcr), M40), (43), M44)
(2 | Mintouna fer dC 467,01) axe tm), MCL), MCT), ML} Ans: | axa, LL ag
[|The Pos txpression cam be Whitin o£ pin] 4 GAD
FCabtl)= Carbrerd) Catbrerd) Carbrciad) (atbltc. 1 Duy
Catbliclsd) Cattbictd) Caltbtcitd) t d(biteltd))~
Colte!td) Cbrctd) Cbtctd?)
Flaibed)= Ca'tbactid) Caltbl tcrd') Caltbic'td)
Carbreltd) Carbrerd) t( baeltd!) (b4ctd) (bre td)
Cbtetd)
FC wets) = amy + HYR tx 4 WE
:
4 Wit 7-0: leleo al
Thu Sop Exprusion for FCarbicd) dst |Pageno:| OY | Dato 1 roe
chil unc Ee
A :
fs This lew Atates tht ty “yeu. add, con Variable with
‘raultipi oony Vari with 0! dhe Hesutt is
aduocuys 4 eo, 3 opectinyelay
Cig [Gas yy Fa] =
ex$ 1x) | (flog 12); Jdumpetunt aw: = =
ATA=h
[end module : S sake ni -
“What ds Binesy Logic hist out amy 4 Kaws of | + This law stata dhet i} you eu Multiply a
aes Binoy seq t a : fe Variable tate al She te ts che Wed
Any | Bincowy slogie abo Known as Boolean bogie, ts a tel + =
branch ef" Logic dhat leas with Varialts dhatt
| Cum have enb} dio pedsible Voluws- ue or fabs, 4 | Comblenent havo >
Usually suproented 4 4 ane o sespectively, Jt the tA we "i -
| fourelattion of digital Electronics amd Compitin Stivace cA 7 a :
| + This law states thect_if you. ell co Vorialste uth
4. | Geuutijy havo its Comblemunt (Nor) et multiply 0 Variable with
1 Ato=A sits Complement the result is always Aco,
saa | sespe el :
+ Ths law state. that if you. add COR) amy Variable
Simnpiyy dhe felowiing Boolean _junetions and
With 0, @ ‘rauldiply Chtdo) oan Vortabu wdh L,
fine cuts Sop Ci) FOXM,2)* C0,1,4,00) #4(23.9)
dhe nut ds dhe oniginal, Variable
(ii) Fw, XY) * S (56,4, 12,14, 15) td 13,9, 1).Ane LC %Y)
aWigy ay 4
Pageno OF
hey
| ReiM Abntrsctiona: Hole provide a Rigen Lev o
Cbhtraction [er describ
677,12, 15) +d_ 34") _ a
1
low-level lets
|duigney to focus ¢
Concismess and Readeulielit
wiistr ard Sioning
+ HOLs Gxe een
site cuign, & mgs
ome on
cl
al
igeital Create «allowing
Uidrality ata fran
yt Hole axe designe to
mle Te Tele] | Simulate des doigne byfre fabrication oltouing
z mols [4 [4a] je drough timing and pejemana a
wx] 2a xs s | Simultabuity and Vuification: Hols are clasig ed to be
= wil o |x [x [o | Cowsice: curd deccleubste alain & nes te fapnos
oe OG yy __| Complore. duigns suing Compact ‘ancl understamdalte
mle] ol[e]e| ‘Teode a a =
ee w| o | [4] [fz a4 = ~_| Synthesis ame imblumentation; SIDLs ase Used Lun Conjumitier
I wx |@_ Tay TE Tw With Synthesis doods to translate high-level dain
| wr} © [lo |o [o desoripdion dinto gate-level rupraentations Suitable pe
arta a a implommtation ‘on plates Auch os FPA’ eter
5+ | Stamdonrdization and Ecosystum:
AY) | Writ o Shout net. on Hardware beoripition Several Hols have
Language § pee 1 a | Become indurcry Stamdorcs . Inclucing Vovion | HOL
—_ i he se hoe | cans tao Auppested by eat amge of
fy A Hot daa Apecalind Computer Jamquage wed to cdoots amd Libraries jateing a nich teorystem, ip
| + :
— eee = J __ | cro $ Muthodelogin
i| Combinational
Functionality
| Output depenels
| promt inputs
Page no | OF
ASSIGNMENT- 02
Cixcutts
only en
| Cequentiat Cutt
bate '
‘output dapords on
a)
func
1 Wh
What ore electors 2 trap
Page tio | 04
»
A decoder vi a Combinational Cicuit that Conoiti
| a bina |
: clan
ere_onby eru out
sti based on dive input eects St tagentiolly deeds
stuuputs amd pest input
_cthe Input amd Adlets the Conupending cusput sLinws
Tense dh fetlousing Boolean
HOt 2 - Zi
eu output dum of active ot a
Oew:[ 7 me
aurually Exclusive output _
2M i a =
Fito net hve Frome > =
| float — 4 = = =
| s outputs clepemdemey :_ ao = aot at ES
cuspur_duperds Betély en | output depmds en bodr pts — S -
Current Input __|Prount inputs 5 dhe prevfows Tt
Atal _¢| the Circuit —S
r Example Applications + — is as
Adeouss, Multipiero.
Coumtor, dug tstevs
lovnultiplenas , oe
fimiti state machime tte
What ore multiplexes? Implement the Boolean
jwndion
FCAB,C,0)= SMC 134,112.13, 14,15) Woh a 324 MUX
* Block clingnown:
7
Exiewmal —fCorabinational |
Input 4 Any || A Multiplexer so Combmatdonal Cacuit that Select
7 eat binony injo foo +e many Inpucs Luis $ odes into
SHorshinating | Single output stimu + Ihre are 2” input im as
Trpat] J Cocaist | [Meuthat | apa | dulettion loner there bit Combination determins
= wieady Money k — | which Input da Stlected .
ouput np: : ee at —pagero:| fo:] ove | # mad)
Tikeh8.c.0) Sm 48,4) 84,93,49 94,45) Lia data. Com rumion data dramsmivion and
far ae Multiplexing. se ih a
___|Giae co ff hy bd at _ ies =
ay (ge 40 70 0 am A)p's as
[ae ane 8 | 36 0 ek OT? Dsl o>los[o. | __|x ly
Bt 2 8 anus Oe oko | ele
a s —— A BIS [Rd 12
Igo ° x|x [ilo °
Eee [22] |]
ae im ft} ol[olo 4
= 7 femap jor %+ items!
E Ded) Te Os ded, date Ded
(Bd,|[x]| © |o lo 35] x
0 a Dolli}fo lofo| dos| 4 c
y bo| [4] 0 |o | o Dios | 1
a om W{o [ole 005 [ 4
_| 7 Ke Ded, ____V* Det 0, 40.1,
caf = Rg Tyo,
AY) | Define Encounter Suign © Four- input | priority en Goda. eh
Any || An Encoder ws a raat’ chatute Sheu Converts ‘a rt ta
a Aut of inputs signals wlnto a Coclid output, hur. | LS
. Each wnique Combination of input. Signals we bo 4 f Piscab cia}
Seprosunted —b & unique Code on dhw output Lon + -
Entodey au mmnonly Wed dn digital Ay atoms he, ~Pagowo-{ Ja | Date Pagetio:| 43 | ae: 7 7
(3 { ae
2 & “ati :QCUI4)> STR! ait)
@5) | waite a Valley propam sto Smponent full addy §
[Mubsteacter Chcuits 9 ats vi
© fer adel adelur, J “for Abstractor
_ output Sum, PR.
oF Output Cous = -
assign {Cour Sumy» (sub) 7 fba*Cin, (Cra) Fb $C
Cb $(~a)$Cin)| (bgad C~Cin)) ht Parb* Cin,
___Ceinf Ca*b))Y;
end Moclube
“| Equation: @ Cin) =Je'CoT Fa)
{
+ D Flip-Flop + et eat
d [aw [acter aes
Oo cela) oO
' Q(t) '
Equation : @ Cet) =D
Q0) | Write div Chaxaduutio Tabu. and Equedtions of
| SSR JK» amd T flip flops P :
: XT Flip-Flop « 2
say cia - 3 T | ac) [act fi
— | str Tac [acn : 1 raw | ace)
e428 a fs few [aw
ol) = ar
1] o Te. ae fi
a a a | | Fqucchions acter) = T! act) t TQ'Ct)Pagoto:| 14
pomto:( 5] ose:[ ae
@2) | DOaibe Vanicus aclardaing ey
J ~__SAssignmetT - 03 i
I ‘med with trampls) |
“Regain Mods: a
“| t The operand 6 che Content fo Regsbnten
the muse Cor aderus) of the Heqdater s_given in
=
dsctruction -
fos | The Irtiuetion. _2t5} :
Move R1, Rr : Copy. Covtent of Hegusten Rt
into Requistor, Ra
s wis used asa Counter obo_detormine dhe
mabur ef ctimus dhe loop bs Enecuited j
= Conterd- location. 1 sis leaclid Grito wegdster Ra Oo
4 Absolute. Mocle:
+ The opuranel cs dim a. Tmemery- loccitdon
a The odelnus of memery -location is given txplicty
in, Idauction:
the of _sthe program Z i
The frutuuction Dewwmunt Pi reclucs the Contomts |
Ra by J tach stim trough dhe loop
+ Thum Branch Insdiuction ouds a new Value dito
the program Counter 3
Pf 2) Move Loe, Ra Copy Gmtent of emery locatien loeimR
i - The EA of tte opromd Ls dhe Contents ef a. suqdater
_ || + The Heater that Contoiins the adcrew ef am. oparand
us Coble a polriter:
€x2 Add (R41), 204 The opromel is dn Memory, fs gives
a
Yo & Indinct Mock: :
rt aie
rrepane |
Effective adele oj the operand -She desta. vis stead.
from location 8 amd adeleel to Contents of regan. Ro
|
uM: = —
Nog} ———] ¥ Immediat. Mocle? eas
Suro} +The opramd. bi given Hepulicitly dm dhe iraduction.
Aue -
tx; She inntwuclion Move FH 20, Ro ; pla Value 200m Roue _locection »
Ris dha mame ef dhe index register lwhich Covetciuns |
Se Average Wo: ef _ bas > Needed to Execote
One Mackuvn fru.
— [Shen wos ae
alee a: | Borie peomama. equation b+ Cloke suite
— hone xs the G Ant |) het Te procosor dims sugquiaed om treet «
iyac oid | Pregnomn, N= Adual number | instruchions €xeutrl
= addres ef opramd ds given by
Re Clock nate vin tycls por Second
tthe prognumn tyeeubion chime da given by
TaNxs --- CD)
R
optration Conapits behind eh iiong
| Computers _ — fae Sa
Ans | St Connist of 2 ports i) oporcction Code ond | egut os supped to os dhe basie pafcumamu tan
Bi 5) operels 1 To Achieve hugh pefemonce , the Cormputer designer
HOhe data] oprcmds ose stered cin ‘runner: Must\ reduce the Valu ef T. Which reams Hedging
the individuol dmscdtucions ose brought. from dhe Nomds, omc Inoeasing Re 2
me cto dhe procener *H)* Clock stotet __|
+h, prowwser porjemm dhe Aputfied operation.
thew bee dypleal Commbruclion.
“There wu. 2 powibilifiu fer Increasing dhe clack
nate RS :
2 Ghia _Indyucion us om addition operction he
)Smpnsing dhe Ze J tethmplogy Matis legie~ Covuits
| fouiousing steps ane:
1
faster Shin’ clus cthe time! needed cto Computa basic
The chock secti R cto be Incteaed-
‘tep -This allows he Clock pried p to ber sedued and
Gigs: fuck dhe Idauction [nom maim "muro ino
ad procuser
Step 2: fetch dhe opramd dhe location loca [rom te
2) Reducimg dhu Gwnoumt 6} processing clone sim Ore
basic Steptalo Hecuces the Clock | udp
Smale rumen
Step 3: Add dhe momeay oprromd Cie felch Contents
Of Loc) sto Contents of” Regirten Ro _
Gig. y s Store dhe moult (sun) vim Ro
ith @ Meat cliagram. with umetionalitivs
fxplaim the Connection bio the processor $ Mameyrage wo:[ 42°]
Mais Munrery,
t
2a I
[processor -nemnory frtenfetel|
Date
«)
[J rm Comddums Sooo tru ous of that on
a Mntvuctions equinus 4. cl
les, 40} instructions
Siclock Cyc § surnam pS check Cycles for
2 fxcuution. fund “dhe total Sivn! ragutred to
Contvel | | e—proceor Seecuti dhe | Prog raven suming ie Lge trnachine
N+ 1000
i
{| *\ The aclelness of
pinet frudruction guts loaded SmTo_jeo
Yor: 0] N= 400 io 2 4
+ he Contents ef pe ase cromsfuntd do dhe MAR +
1354- 3
— [Moontrel unit Onis Read signal mmumery
ItiAhtr Curtain amount. ef lapsed time dhe fdrst
+
Jrodruuction Js dead out of meme amd_plaud.
Hid = 4-05 tus
uvtlo Mor.
INO, dhe Contents of Mok axe dramsjooud Sto IP
Ds) | fer the jellouing proconer, obtain dhe peajeumames |
(Chock Hotes" 200 MHz
‘At chis_point, the instructions tam be decoded $
No of insctuuctions execuitéd + S000 :
Executed:
fo {uch am opmand, Hts adelress cr flased vito
Average tno: Atepa tneecd [machine tribution 20
‘[iMpr 5 Contrel-umit nurs Read Atjnal ded
cls is fete
> Mheutise sequised number ofp
Ts NaS > Clovo* 2s) |200% Jo"= 95 micvo Sec et 21" Io See
R s =
AWnko processor
ot | | 92) | program. rxecrition ime Tis cto be Examinud fr a
[i Famoly, Aw pujevms dre dertud opercilion - | Contain high: [evd_Lamguage progrcum: She progam
+ At_Aome point 1 Exuuntion, Cait of pe Cam bu xun on nd mpud “Stil Kc i
axe Inowmunted to point do next instruction
id dhe prog nev.
the Effective Volue
Rise Machine ua 2, to only 4: for cise Machine --
J] Shins [or execution on CSC Mackin ds to be
| longer Sham _on Rise Machine 9Pagetio[ 9) | ome) | ae
Ans | het Tp Jo ki ssrquvent-o 2
on dhe i lk ft -
=a | Equativey f Gy) | Clplaim dha interacting ef to clevice with Grnpuuter |
3 Ans [Shore Ore 2 Ways tte deal tt dhe Io davics:
Thon _NeJie + 4) Mumry = Ana od ABE sch
hereeic, fhe _longust ft Mame = 20 ee Ss a
ee Ne ve i il __[eMumew amd to davies bhare a Common delcluss Space
ey e c __[tAny data-dramjr inictuetion Cam. be Used to,
D) | Repeat part Ca) ij dhe Clock vette R fet dhe Rise machi | achamnge inpewmatin. :
a Jfo- mapped Ijo:
tA Sheetal troduction, mamed IN amd ovT are wed Jer
aby pont héghu thom dhat 9 Cisc_ Machine 9
4
Mi amd S/o Oddaws -Shacs su dzjjacat
fg [Gn dhs cane, et {
F 49 Nef 445= bak] 4-00 dates, Aroma jon _ i
Ghum _Nefue +42 | CLAsxts) 0-09 } To Intofuce jeran input devier i z
Ghuafore, thu. lorgut allowable Valu for Ne ws )) Addnos duodens Enables dhe davier co sucoontas an
Carb. ef We 4 address Whim this address appears on cthe actress
flit \ onus i
(3) Status Pegs: Containu injo telwout do operation.
a is ea e 19) Tfoicuuics iif
2) Data, rugiatts held» data bing dumpod Jo ob
ii
prem _pnocemor + _
i fm f
22) | Duvidse dhe Comeept of intonupe: cw Comput 1
Ans; || Dhow ou. ‘rao. Aituatiovys Whur eth tases com
be _perjevmd _tohete Waiting for an To clvice to
| become yearly— ore prom cam
Uuitout the ae
a [Data diay [Dela daawsjen: whom a pe
| tramsjr data prom er
Pagenio:| 29: | Date
——
prripheral cleuice neces to
sto a Computer. ‘nue it
_ | Duequuests OMA acces:
2 | DMA Cnbolla: dhe One Gonballes, a specialized
hardware Component, Coordinates the clata. Sownsper
he routine Gxeurted im siuperse to om sntowupt If
betwum the peripheral duvice 4 dhe mnumey
CPL Hamdotf : once dre DMA Conbeller ts Actup
Request ws _calud Ise
dt takes Contret of the Auyptem. bus amd memages
The proconer must injeum dhe clwice dhat its suquest |
the Hate. hams h
hos bum secognised by Souding INTA Signa i
anes the cpv- |
A rctwn_at ‘the tnd of Tsk Vreloads dite Pc ror
Lf fcanibly impneves System i
ithat, tumperany Sterage location.
This Cums dhe Execution to Halu imbiuction, 7
“hupevaiveness by offloading data sibnafet
its
tosis: [rem epo-
_&) Explain. dtiu Dive Mumey occens technique and vs
Davie Fueauft Stordwore wth a agian
impottame? Node
iff Ans} | i
fw: DMA: Us a techmiqu that allows peripheral cdevies proe] st Sp a.
So Gramsjr dutu to omd from the Com puteu Mena Inte 44 INTE ] il
Wudinout inveling dhe Cpu- Trstead of thw Cpv_mamaging al — Tau Zane Zh sire
Thu Cita data travajr prow, DMA Controllers _ mE ee et
ssbo pexjeumn. oth tas
dake over dhis respowsibsliy ea up othe Cpo
+ Met Computes have vant Ifo devioes that Com
Ie wah inpovtamee ;
Juguut am _fntorupt) pnower Should autora ically
| disabte intomubts
the Exeeulion of Ise {
Ataxtin
aang
oh has a Spectol. Inte Line [ee Which. dhe
“Fro hequut am Intorupt a dwie doses du alloca.
sto round —
intonupt - Fond Ling Cocuit, Intonupt - Circuit Hesponds
Only sto Luadli tdge of Sigmals Such cline sis
Sutter
called: edge chi gout
“hus, i alt Te Signals arte Inactive, dhe ‘yoltage on
+ Sequunce of teats simvelveel dim. hevnebling,
the ime drops too, This Causes the INTR stectwed
dutewupt dequust- Le
by procomer. fo go sto 4
J The dwie nats am Intonupt — sequast if
= Ghe Walus of “INTE vis the logical Of of du aquests
Spom imdividuel dios" ]
regndim.
being s€xecuted- j lh |
NTR: INTR) tINTRs ~~~ t INTRn
3) Intonupts (ane diraloued by Chamaing: ths Contio}
erp dk ot. bits im pnocentor. Atatus Nepdster_( PSE) |
_Q5) || Ducribe tnousting + dis tng intonupits J humilling G) She dwice dsiinjowmed that ‘sits sequat hes ben 7
multiple divi! in Intonupt! occur? recognised Sn suspowe, cthe device clecetivectes the
Biv 1 Intodupt- requuast signal. i |
Any | ALLL computer jumdsumsntally Should be avi tke She ction Hequited by dhe intonupe Gs pajanud
Enable $ disable intonuption as dusted - by the Intowupt- Sewier " outtine TNE
"She _problom ef infinite loop occuns cur to ihuctersi With eee ait if
inturuptiow, active INTL Siqraws: HANDU NG» MULTIPLE: DEVICE
=Ghuu cor J mechomisms co Aste problem of the i
linjinite Loop + a + While: hamalling multiple clic, cthe Drsus |! 7
iy Concamed ore" i i
D proce bhould ignow the frctovaapits umtiv |) How Cam the procesier: Aeeognixe the idevice requusting _
Exucution | [last "innbuction lof the tse [aw dntonupt: v v
mee PP) Hews cam the frowns obtaim the Ataating addaus
es) | of appropriate 15% 0Page: | De
nem Assiqnnten NZS 1
dal dhe seqistow ase sinctertonmected Via
| Page No
| MUx is ured sto delect ome
| Mux Selects tothe |
it) Output of Y ov i)
(Be) ow ae]
fhe. One. 2 gpdions: proved fou oA dimput othe
of sth 9 input
2D Cowtant Value 4 (Which ds wred to incemud
gle Commen bud - aaa Pe Content )
x * Data “amd acres us ef dhe €xtamal Mumdy- eS
Bis cis Conmeted to dhe Intomal_procomer bat aati olet
Wia Mors MMAR respectiv . : Pe St irda
SIMOR hos > inputs $ 2 olupucts - data may be Teale a hues eet A
Dviuto Mor eiftur from momoy -bus a! jrom j ceive
J prows bu ih eda } aay Jae]
5 Fraplonueting sti acdions Apecthies by ce inadauctionsl Ce moe} —
IE Repbove. Ro ‘dtrough BCnt) te dhe procosed | ie —
Bigot 13 Yak far a
Wore programumer cam accws thie 2g istens ou a [aE can
“qunnal purpre We . a 1 i
pwly _procuer. Cum accu 3 neqdstes Yas temp for ey Au - | = Rom).
Aumprony storage during _progncunn. éxeution
x Ee _ Temp,
Che prog nooner Cammet oc.us dha 3 steqdstos: $
+J7 ALL_)"A” dnpus gus oprumd rom ouifur of
nom
5 8 itty a
te ena ek Sy
| _____tomta 3H) owe (1 am]
| Step =29 dhe Lnasduuction -{uch epoation. bs
ed] by
“Cowide dhe dauduetion Add (f3)iRa Which adels
| Plonding cahwemts pe stnto MARS
Send Read i fo mma
fa ate
Sthe Contents of momery- loceution pointed
Step at-- updated Value dn Los moved to pehis
Duegdater Ra: Executing his huciudion requis
Completes dhe pe Inowment opuration amd - pe muh
the Jellouuing actions:
3) Fach dhe tnatauclion
mow ipolnt tb neat instruction «
Step3i-a> Feicud. instwuetion six moved dito MDe
9) Fetch dhe first opramd
9 pao dhe addition +
Onditim tek |
4) Kou dhe seat dvito Ra
Step 4 dimough 4 Gomntidutes the Gxesution phave
Gtep Action.
PY :--> Contents of Ra arte Locicled unto MAR $0
suwodl. dignal. ds sued
PCout ,MARin Read, Stleety, Add, Zin
\ patil
-2 Contents of Ra core drama erred to 4 to
prepode fer. adelition.
iil |
i--9 When Peal operation cs _Crmpleted Youmeny
Inpaln be] Glole
vm Moe, and addition da ©
~Yibtepsy nas Sum sis Atored sin £, thurs doaina fed
* Insdouctionws Exeuttion proceeds oy jollows®
Sigma Cause a noo dwscdiuction
returning che Step £aono:[ 30] rvee|_! aooro:[ SA] one oa
— 1, —— 7 a a
3) | nits a mation how oto feich & Word dom. __ Bee $9)
itt AME
Eh —_ etotk
os a is
4 ea fetch Induction) data prom remedy, »_prote Hit i
hones negutred aelelress cto MAR. Xue
Each ravmoy acess Verte,
MFC a Wud coud
IMEC is a aigmal Aun fromm adllrensed ~ levi i
the procmsed MFC Injowrns the _prowmot het 3 Me
Suequbsted opurdtien hur buw Completecl y
=Consicler the imbauction move (es), Re Mor,
Visa, MAPin, Read } dondudd ads Js looalad tt | a PaicsTil eh et
Maks Read Commomd sis used | dwurd |
1 MEc.
a)MORin + WMFC + loads MOR {rom wey -bus + i
ww Mi i
— alt {or MFC despense {ro my A Dn
3) MDRout ) Reins load Re {rem MDR+ fe
Whore WMPe = Contrel - Signal thet, BS) Define tell What are Stages of dhe Induction
Cause proceomors Contre) Couuit do weit jou Pipelining Explain 9
Tle _@nrival_o| MFC Hip Z 7~_Tnsctvuction fetch _Atage s
wotiuction rem maumouy
~~ Trutiuction ve decode std
| imchuctions and detamin Ye _ segue
; I Excewt + 2
Exceution stage perp cthe_actucl Computoiticn
on operation Apeettied iby the frtuction +
Mummery : |
Mumevy acces, Stage dmvelws cessing
_tavmey if mecessanny (eq! {er loacl (stew optration)
write back:
Write -bocke stage Wards the Sesevls
oy Fhe feted Uurtrmetion back cto the Abpropaiedte
rugdator ev Tame locatiew.