3. 2. 1.

The Instruction
3. 2.cycle
1. :
Answer
: :
START
xecute
iicyclei. : iü. Decode
cyclei : i . i
stepsFetch instruction andfromInstruction lt lt
iv. iüi is is
he
tThere inThe bus enable carries the a
ycle,
thisIn After is The From is8085). The The inThe are its basic
to withinthe the which cycle process
decoder
bethe opcode and
opcode CPUprogram memory,
Data the
performed instruction
Fetch
cycle out
operational cycle
erformed, transferred the : Fetch
opcodeinstruction memorysends To
cyclethose
Register which stored by is
tion circuitryCPU. after opcode
counter fetch determines a
: is whicha
actions. complete
is the divided Tnstsucion
cyce process
decoded it is in an
and register
goes itgoes fetched torequired is 3.4.1.
Fig.
fthe decodes (DR) the th e to places
send stored, opcode instruction Decode computer
then Decode
to memory into what process of
the (data/address the from CPU. the th e a
ion
execution on from cycle computer.
the
CPU Instruction memory
opcode. three actions
retrieves of
the address
the
opcode. to location a instruction
comes address memoryinstruction Execute sub
or the memory Execute the
, is begins. control of
decoder buffer a
ed. to Register is the cycles:
instruction program
know cycle
is placed bus. location execution.
placed signals memory
circuitry, in
is what
(R). case on HALT
instruction
operation first th e so
location following dictates.
of
whicn Intel of data as
all to
 instructions.
length
Variable
registers instruction
memory.instructions.
control.
Micro-programmed
set, microcode.
Complexity
in addre
modes.
Many
R2). passing
register instructions
Many
CISCregister
16 R1, off-chip
to pipelined.
Less
Multiple-cycle
6 twoperadd Parameter areinstructions.
example,inefficient
consistingallowed memory.
Single or There
One
through|
often256 operands
register
Three
(for registerinstructions in instructions
R3). store). few instructions.
length
Fixed
sets,than
instruction compiler.
Complexity
in addre
Few
modes
are
R2, passing and instructions
more on-chip control.
Hardwired access
can
memory.
store
register R1, load
pipelined.
Highly
RISC add Single-cycle
of per and
consisting Parameter for
Multipleregisters. example,efficient
allowed windows.(except number. load
Simple
Only
S.No. 5. 6. 7. 8. 9. 10. 11.
1. 2. 3. 4.
 intospecialexecutingexecute hardware
units,
one of labelled ?
I,. shown destination
thatin (step
process instruction Execution
unit completed
a and as block
destination such instructionI,
in other
and
sequential
executed fetch them,
an and the is
all fetching
for in period 3.19.3. cycle.
inside organization.
be
with of
steps deposited source
executing 4
sequence
Instruction tialseparate
execution. the can Eg ptpeinin
an clock 2.
poocesS
Pipin
plpeling
being
concurrently
adecomposing
by execute
Eg
in theare
whose Fig. 3
instruction fetches 3.T1pig
sub-process for is deposited
both
in 2 E1 Fa the
program F instructions
Storage
buffer
a two unit clock as 3.19.3.of
Fig,
another o proceeds
1 unitend
andof has
fetch
that B, Hawo
other.consists
operates theAsthm
E a instruction
fetch that assume by any fetch
of a I
3.19.1. and the are instructions.
each executes
technique thethe F2 the controlled
3.19,2,of computer theat
computerby execution
that after program
instructions steps B,
with E1 fetched we by Instruction
fetch
unit eycle cycle.
buffer
to Fig. in Fig,
segmentrefer purp0ses,
operated execute
a sub-operations,
one
processor is storage
buffer
B,. "Execution
unit". is theClock
is a shows
E, of F, a
consider
of the
instruction
computer in 1.
clock
ipelining instructions, fetching results of it
dedicated
andExecution 3.19.2. by
as these
specified
data andclock
cycle.
Operation first
stores
THPOA
Answer F, steps the
The Let Now Fig.The The Thefetch
for Forthe and
In
1. 2. 3. 5. 7.
10. 11.
4. 6. 8. 9.
and
micro-programmed
Micro-programmed Control
memory
used control
control orROM)Uses
(RAM more of
areaCISC
processor
basis
Software
Flexible
Easier the
Slow Easy Easy :unit
On line. unit:
more of control
Hardwired
control unit: control
RISC
processor
basis
control Uses
less
area
Not Somewhatdifficult
flexible
Hardware
Very for signal
input
:unit control micro-p
operation
Difficultused
Not
hardwired difficult the micro-programm
logic.
Fast On
control
hardwired of
implement.
to
Expensive piece
S.No.
Characteristics efficiency
Chip
area generation
Outputhardwired
to
Ability
handle Ability
Implementation to system
operating
support Contain
complex
logic. implement.
to
Cheaper
between complex
large/ and Design
process
diagnostic
instruction
set
simple
More
error
prone. Less
error
prone.
Flexibility high. of veryof slow.
Speed features Memory in
Used Disadvantages
of
Comparison of Disadv
is
Advantage Advantages
Containis
control: Speed Speed
1. 2. 3. 4 5. 6. 7. 8. 9. 10.
1 1 2. 3. 1 2. 3. 1.
1
 computer or
written
toinstructions
location of logical and in where than
expensiv
level used
indefinitely, memoy t
a workstations dynamically.
often
physical theis
of to
be:
read
form andbit periodically. semiconductor
memory. is
that
program the data, chargethat more
a
0s whether and refreshed
(RAM) items of of
memory
and
irrespective access their computers
used data
device
random bit refreshed comnputer.
dense
Memory eachdetermines
hold a
RAM. system.
frequently
allows random semiconductor is be
store not to
Memory less men
static time be personal the need
Accessa of to do to is
of capacitors
capacitor for nature.
of form
capacitor needs not power,
cac
and speed amount
stores memory. RAM Access
Random A access
memory RAM: of including does
RAM a dataform in more
RAM:
Semiconductor
general
which is
RAM each these
main
data
Random volatile for
same semiconductor
a the the used
dynamie Semiconductor the uses the
equipment the consumes
storage Dynamicon Howevertherefore
is
the theinside is
DRAMcharge
or
l0. DRAMforms Static which,is
SRAM DRAM. SRAM
increase
almost DRAM:
Explain data 2.SRAM:
Answer data it It
of
in of Types b.
a. C. d. a. b. C.
d.
1. 2. 1.
 with are bit lines
Data
bo4 4-bit lines.
(CS)
Select
chip.
a
cells by
array to has
refers write
ckt. 4 the circuit the
4 Sense/ MAR
Word
line x
memory,
two-dimensional Word
line 16 of decoder
on of thethis
array size address lines
sense/write
20-050gaizoHon of
4.5.1, other. read
Chip
data
transmit
the cells
word Memory ckt.
write chip Fig.
Sense/
the each or
in address
an thethe sense
percolumn b memory In
holds a and
a executed. to to by to circuitsline
of 4-bit activated
complement
connected connected
(MAR)
form Each ckt.
write
Sense/ a decoded
by word
For of
organiIzation these
the line.
line. is
Register a
in
other) operation are areare by
word
are circuits selected
operation,
word circuits
organized each ckt.
write
Sense/ bg line.column
isofMAR lines
The
Memory
Address
to a word
-C
columns. to 2D
to
refers (complement
read/write each cellslines.
bit sense/write
2D
: interconnected
organization Wo W1
4.5.1. sense/write
are W.15 CS+ each Two read
content
The the
row RW Pig,
in data
cellsand
rows lines. Duringa
cells
activate in
The Each line. lines
where
lines. stored
the
AoA1AgAg Thebit TheThe
Bit to
1. 2.
MA
3. 4. 5. 7.
6.
 data lines and store it in the selected cells.
2.5D organization :
|2-S0 0guniztlo
MAR
X Word b bits b bits b bits
line X
|decoder Segment 1 Segment 2 Segment 5
y

|Column
X+ y En
X= 2x
|decoderY Sense/write circuits
y= 2Y Decode 11out of
S segments
b bits
Fig. 4.5.2. 2.5D organization.
1. In 2.5D organization there exists a segment.
2. The content of MAR is divided into two parts-x and y number of bits.
3. The number of segments S is equal to 2.
4. X=2 drive lines are fed into the cell array and ynumber of bitsdecode
one bit line out of S lines fed into a segment of the array. In total, there
are Sb number of bit lines for a b bit per word memory.
5. Thus for any given address in the MAR, the column decoder decodes b
out of Sb bit lines by using the y bits of the MAR while a particular word
line is activated by using the x bits.
6. Thusonly the b numbers of bits in the array are accessed by enabling
the word line andbnumber of bit lines simultaneously.
7. Though 2.5D organized memory may need lesser chip decoding logic, it
suffersfrom one drawback. With high density chips, a simple failure,
such as external pin connection opening or a failure on one bit
render the entire chip inoperative.
 mapping:
Types
1. of 2. mapping
Cache
1 :
AnswVer
a.
77777 12567 77701 00000
00001 77700Address address Tag 6mapping
Direct the system.
Mapping
: memory method Cache are
Octal bits
memory
Main 77777
cache brought
implement. The mapping
00000 used
blocks
is is
bits 9direct
Index organized.process a
5432 7432 5321 1256 7523 5670 directly into
Data Address are
Main
Data memory mapping the the is
32K 12x placed
=
toaffectscache
method
= discuss
4.l4.1.
Fig. 12 15 in
bits technique and
.. bits the the
possible by
cache. referenced
addressOctal performance which
is Mapping
777 000 simple methods the
000 777 T'ag
000Index contents by
777 125
memory
Cache ofthe
Address
memory
Cache and
01 00 00 Data function for theCPU.
77 51
51212
x specifying entire of
= inexpensive
12 = dictates The main
5432 1560 1256 7523 5670 Data
bits bits 9 computer
mapping
memory
where
how
to
 (main stored
Addressable more more same pairmapp
tag of from datamain
anaddress.
itplaces
Vlemory
memory.
thetwo
tag-bits
associated Data3023 24952354025634527654 198431429823Main
read required
from address be 8009 memory have the
holding
access main to and at assoc
theis transferred memory. memory Address can residing
memory, word Content
the thethe 1456723473
569823156743222
1456664232 9876611132
45614 cache
to the with contents. location is
usedwith data and accommodate
from cache. location
matched tag. associative main mappingare
from is compared required
missthen called data set
new its address cache associative 2-wa
address of cache
data is using and
are a
is the alsoblock direct
access
CPUis
cache.the there It
memory. willthat
with an accessed
Associative
cache
memory 4.14,3, eachitems.
tagonecalle
address is each Data3023249523540256
address and uses mapping, If
of the thenmemory
of
memnory memory Fig,. datathefullyofpair is
to hit contents allows
:
memory.
field mapping mapping of the that
wants CPU fromCPU a
main being + one
Address
index is match, Associative
mapping
: 14567234735698231567 tag bestof item
readof there in cache cache this It associative than
mapping
CPU of tag-bits stored associative is the (CAM). of the cache
Thefield memory
word then no to of andwhy in the
cache.
paircombines
associative more data
the is line CPU
address of
address.
tag memory memory): Memory one
thethecache, there
cache. is is (15-bits) flexiblelocation
+
When word set is
The
in If An
ThisEach That
Argument
than That tag
If register In of
CPU It
b. d.
Set
C. e. a. b. C. d. b.
a. C.
2.
3.
Memory
RAM multiple
andcontiguousif memory
memory. the why
translating the(DRAM).
memory using are bitsselected
becomeaddress
memory on and as
as 10 arein
RAM. locations.
in point
stored locations system
operate discussingMarks for m memory
executed done order
or moreaddressmain compensate
Memory
across to is any
in higher
banks that memory
form
memory
programs
to formemory 2014-15,
memory. are thehigher are at the
memory
onepurchase of
mechanism evenly bank locations busy
to data. to amount being schemes Access writes memory of in
in bits datathe
(HDDs) each programn AKTU to
andmemory kept
activeits larger mainare addressesresulting k consecutive of
to associative Random and bank)
and allowing
having
the made for order memory of utilizatio
are block
programsmemory
using
Drives load
application to a correct
allows reads
waiting (Memorythe
regard design banks
cantime,
provides memory turn, lowerin
Dynamic a
increased without into memory, consecutive
location to
Disk memory that while following ORof operations.
reducedthe access overall
memoryaccess
same withoutaddresses a
principle is module
the facilitysystem spreadingin 4.24.1, bits. different
memory
banks.
Hard and dynamically, of
memory bank memory to
is both the memory
: speed
Interleaved contiguous k several higher
requests faster
virtual
memory view, i.
Interleaved
memory
Associative
memory to order
the duedesired way
space
in hold at a memory Fig.the
(CSIT-Sem-3)
B
4-24 runningis generated working slowby memory in
memory of Explain in select
throughputs unique this in
address using memory
point Interleaved
done lower results
made results
that infinite relatively for shown Whenever
done Thus,
in to in whole
a
addresses
programslocalvirtual is banks. each ready a the
inactive
system program needed
the: the This used give Thus being This
time. also
Virtual Virtual is 4.24. As by
has from ThisCPU. Answer
Explain
A it A Que 3.
1. 2. 4. 5. 6. 7.
2. 3. 4. 5. 6. ii.
i.
4-25
(CS/TT-Sem-3)
B shown
in
thethat a address. has all
addition each match instruction
the
by occurred. (key,
of
ensures accessed also positions of of
words. field the pairkey. each
any in mechanism (CAM).
which hasfor a
the match on
locations.by
This is key is
ABR
DBR as bit
the order
match as
location
than memory performe
Module bank memory desiredall Memory the specified
2k-1 banks. predetermined the
ratheraddressing for with :
functions
memory which by genera
the which field.
simultaneously
Module type of memory:
Addressablecompared preceded
associative
kbits 2k memory be be
selecting key.
comparison key for can
total in access next
non-existent comparison. two (s)
memory wired-in input the word is
Architecture ABR|DBR 4.24.1.
ig. is
Address
in
module Module be the random implements
simultaneously
location
in cansignal
instruction
specifies the
forto specified associative word(s) the
in enables Content
a storedphysically done
operation
m
bits have in
allotted is word of
stored data match
Input
: memory
of Associative
mnemory a bit subfield
there
gaps as is called register the format.
the
having
& word for a circuit write
Organization viewed circuit withcomparison the out(s).
position which
read/wri
DBR
ABR are no logic of is word
4.24.1, data a
Associative alsoprinciple
maskdata select reads Anyor
Module having words stores Match
key,
bits are be wired-inlogic for
a read
of is Data). words
fieldcan Input
the ThisThis The word.The It It
there Thus,
k Fig. This The The
Computer If It to Working a. b.
8. 1. 2. 2.
3. 4. 5. 1. 3. 4. 5. 6.
ii.
 suitable and withoutprocessedmove assigned
transferring
I/O to interruptsCPU
devices,memory.
the itswork.
(CS/IT-Sem-3)
5-11
B arrived 05 07 U7
Niarks
removeswith uses ready the Marks Marks read AKTU2018
Marks
to of
its
transfer.thebecause
computer
is be way be set
of has deviceis
proceeds
generate
and of the of must
can efficient ahasdevice.
computer
completion it for module 2014-15.
help 2017-18, 2019-19,
AKTU ?
Intesoupt
initioted
TI which
data when are bidirectional method
the waitamount the or they
devices.computer
data buffer.
then newprocessor. either usually the transfer. Why processing, connecte
transfer whether to I/O AKTU of our
successful AKTU
with a
is part more access,
on when
module thehaving from
between
large controller. and other
devicesystem interrupt
CPU devices another a a
with controller Access® memory
on
data
mode. on controller require
output is each
WO depend of of data
andto port
VO a CPU
done transferDMA.
word
of the memory
Architecture I/Othe the an acknowledge
DMA-capable OR ORbased OR to of to
mode by interrupts arethe DMA Memory
RAM or not time direct assigned
to interrupted delivers
byperform by on DMA CPU.input type
programmed data
a commands retrieved they
relievesword note DMA does computer's
processing
DMA of computer's useEach
is ports,
memory
mapping. in the is
I/O diagram Direct data
& deviceto and
data
to that inefficient
device short of a that
using
to be
Organization
initiated until be actions or system interrupt working on in somedevice.
another
by channel.
devices
can
the línes data
Memory-mapped note
theissues to thedata Write for
theit
save
the that
the transfer
of work ready still block stands processing
mostCPU, from for DMA
CPUinput,actualoutput,
drawback
Interrupt
new theAlthough short control from can channel
the order
normal is diagrams. DMA While
the DMA
Computer
Answer is accepttell it to 5.12. ExpBain the Answer data data a
The ForandThe For but has a by In to
to Write write DMA:
Que Give
1 2. 3. 4. 5. 6. 7. 1. 2. 3. 4.
Input/Output Peripheral
buses. device
each its 3.register
address
a
Data IO
sends ine.
controller RAM
I/O thethat
DMA (RAM)
memory
Random-access BG
Address DMA
acknowledgement
DMA
relinquish system. and
the the
WRITE/
request,
the WR DMA
request signal,of
drive computer status
informing control4 Address
RD 4
Read bus
and bus
Data DMAACK
DMAREQ to Write
control
Data
bus its
hard 5.12.1.
Fig. DMA CPU the
of WR
value
READ/ device.
a a on
and a the line, Data in or
sends WR
Address
Data Direct
memory depend
transferinitiates
channels.
bus, informing (DMA)
access the
RDperipheral
current
controller BG Address controller
Address BUSACK :controller
device its CPU DMA transfe
DMA: with the
DMA line, Interrupt WR Interrupt
PCI peripheral
(CSIT-Sem-3)
5-12
B processor responds 5.12.2.puts the
a of for Micro DMA BR BG BR RD RD
DS RS BR BG to of
example,
set diagram DMA DMA
then
BUSREQ the disabled.
are bus, directio
acknowled
own theactivates
CPU Address
of select
Fortheir When
Working
The
Block The The
5. 1. 2.
4.
 5-13 to DMA
(CS/IT-Sem-3)
B CPU or a (for the data is write memory
microprocessor
disadvantages
ofeach.10 uses which
memory. be are on due toand for
read
puts CPU
bus supplies the and memory. Marks VOlocations
can devices logic
the IIO
mapped operations
data devices.
the it data the and I/O memory
the
from acknowledge, through Read /0: main
instruction internal
allowing specify the 2014-15, mapped
and while I/O memory operat
Faster
: thethe mapped the mapped
Memory map. for
the
memory I/O
lines from operations lines Smaller
size.
in
registers. memory to isolated to Inefficient
/O
lines to units because data from bus
addressing.
and
output AKTU references Common
memory word control as
DMA memory Memory memory treated single
memory
input withtwo write and
between
DMA a write bidirectional Any used.
are receives
a the write and advantages
are WR accessreceives communicate
internal
Architecture or and isolated
I/O to
WR between separate be INS,
andrandomdata. or read and memory difference due size.logic.
and write) /O can
is OUT, in
RD thedevice the read
controller ports. operations internal
RDthe isolated instructions larger
withthe for (for controls cantransfer the
memory. the uses
Isolated
UO IN, Slower
operat
& the the peripheral disabled.
momentarily
bidirectional
from the
The
addresses
forcalled
Organization
=0, 1, operation
communicate bus unit Explain memory
space. are Comparatively
comnplex
= to data DMA DMA is between I/O
Those VOseparate
bus.
BG BGcontroller the peripheral data are
direct What Isolated Efficient
Limited OUTS. devices
When When writethethe for a the ?
the in Vo used. Uses
in addressfor forlines Difference
Computer When Thus,
wordread).
(read)
5.13.
Thebus Reason
mapped Answer
b. control S.No.
a. fetchQue 3. 4. 5. 6. 7.
1. 2.
5. 6. 7.
 5-16 B (CSTT-Sem-3) Input/Output
Answer SesiaCommunatlon
1 In serial communication bits are transferred one after the other over a
single communication path.
2. Serial communication is a device communication protocol that is standard
on almost every PC.
3. Agiven transmission on a communication channel between two
machines can occur in several different ways.
Modes of serial communication :
1. Simplex connection
Asimplex connection is a connection in which the data flows in only
one direction, from the transmitter to the receiver.

DTE DCTE

DTE DCTE

Fig. 5. 16.1.Simplex
2. Half-duplex connection
a. A half-duplex connection (sometimes called an alternating
connection or semi-duplex) is a connection in which the data flows
in one direction or the other, but not both at the same time.
DTE DCTE
Or

DTE DCTE

ig 5.16.2. Half-duplex connection.

b. With this type of connection, each end of the connection transmits
in turn.
3. Full-duplex connection:
a. A full-duplex connection is a connection in which the data flow in
both directions simultaneously.
b. This can be achieved by means of a four-wire link, with a diferent
pair of wires dedicated to each direction of transnmission.
DTE DCTE

DTE DCTE

Fir. 5.16.3. Full-duplex connection.

** ***********
 Computer Organization &Architecture 5-17B (CSTT-Sem-3)

Answer
Synchronous communication :
1. In the synchronous communication scheme, after a fixed
data bytes, aspecial bit number of
pattern called SYNC is sent as shown in
Fig.5.17.1.
Block 1 -Block 2
SYNC
5.17.1l. Synchronous communication,
2. There is no gap between adjacent characters in the
communication. synchronous
3. There is a continuous stream of data bits coming at a fixed speed in
a
synchronous communication schemne.
4 Synchronous communication is used generally when two computers
arecommunicating to each other or when a buffered terminal is
communicating to the computer.
Asynchronous communication
1. In the asynchronous communication schemé, each character includes
start and stop bits, as shown in Fig.5.17.2.
Character 1 Character 2 Character 3 Characte4
HH Gap H
Gap H

Start
4 Gap
Stop Start Stop Start Stop Start Stop
bit bit bit bit bit bit bit bit
3 Synchrononss communication.
2 There are some gaps between adjacent characters in the asynchronous
communication.
3. In the asynchronous communication scheme,the bits within a character
frame (including start, parity and stop bits) are sent at the baud rate.
4. Asynchronous communication is used when slow speed peripherals
communicate with the computer.
Que 5.18.
Discuss the advantages and disadvantages of
synchronous and asynchronous transmission.
Answer
Advantages of synchronous transmission :
1 Lower overhead and
thus, greater throughput.
Disadvantages of synchronous transmission :
1. Slightly more complex.
2. Hardware is more expensive.
Advantages of asynchronous transmission :
1. Simple and does not require
sides.
synchronization of both communication
Input/Output transfer 15
transfer than
to
are a1.are
information. sHaking
linetransfer.
timemessageDesti
unit
nation
processing DMA.
with
messagesbits Marks more each processing
control accepted data
Valid
transmitteddata data valid
Data
SourceL
Data
bus Data
2015-16, employs accepted
useful: asynchronous
Data
bus Data CPU
of
where
Set-up transmission.
protocols. asynchronous
Har present. IOP VO processor
Reply
timesingle Datavalid
applications techniques. unit only
the It
required.:transmission
no AKTU port
of carry single not logicalHandles
a
proportion Bit-oriented control
Strobe
is
Destin
ation
unit
is is
IOP IOP
thus asynchronous a to each
handshaking
message
transfer. Valid
data
not for handshaking
O line
employs Strobe
is suited and
intervals. initiated Data
bus set-up
by
clock asynchronous
high :among present.
controlReply Data Strobe
purposes Source
unit
well overhead, and It and
as Differentiate Acknowledgement arithmetic
ProcesSor
cheaper
so irregularcontrol and IOP. Character-oriented
interrupt and Processor
and
IOP: Processor
is
CPU. is
diagram Timing
diagram
and
Processor
and controller
(CSIT-Sem-3)
5-18
B fast, Parameter Block
contfol Synchronous control Control
line
relative
Large
are very ofDisadvantages Handles
at
generatedfor
Hardware uniquely and tasks.
DMACPU.
is Strobe
5.19. modes. DMA Strobe
Answer
:modes
S.No. S.No.
Que 1. 2. 3. 4.
iii.iv. 2. 3.
2. 3. ii. V. ii.
i. i.
(CS/IT-Sem-3)
B
5-19 any serial
not field character
without interrupt
current returns
to
not transmitted
at character 011111l0
doescontrol I/0
initiated
Interrupt am
are of
receivers
of
protocol transmission
length protocol:BC1 Flag CPUprogr
Asynchronous
transmission
synchronized
clock.
by Bit-orientedindependent thetheLO
technique.
protocol of
transmission: is :
its
protocols bit-oriented anyimplication
ETX Frame 16
bits
check techniques:
during transfer,
executes previous
and are transfer in
constant
rate. code.
particular
characters character-oriented
:protocol
data
Transmitter the of
oriented.
streamboundaries.
Text number
any program,the continue.
initiated
Information
of Data Bit-oriented is allows CPU Afterthe
Bits
The useand the SOH bit-oriented
STX
Header ofbits VO to
asynchronous
Architecture It bit
CPU disables, starts
returned
clock.transmitted
receivers
and
Transmitter ofwith in
synchronization
place character-oriented
Thethe character
128are33
initiated
Character-oriented and Control program
its
execut
transmnission
Synchronous
by and on 95 characters.
control
are for bits
8 initializes, CPU
synchronizedtakes Character-oriented characters
haswhich format for are
protocolbased interrupt DMA
& and a format DMA buses
Organization are transfer of Address and
of idle.
become
Synchronous bits is code code
characters,Message bits DMA the
blocks. protocol graphics SYN Frame 8
memory
CPU
Data clock.Data binary and
are The SYN 01111110 As As
set. DMA to
Computer
S.No. S.
No. Flag S.No.
iii. 1. 2. 3. 1. 2. 1 2.
iv.
V.