2marks

UNIT 1
1. Defne Computer Architecture
Computer Architecture deals with the struct
1) List the great ideas of Computer Architecture
Design for Moores Law
Use Abstraction to Simplify Design
Mae the Common Case !ast
"erformance #ia "ipelining
"erformance #ia "rediction
$ierarchy of Memories
Dependability #ia %edundancy
&) 'hat is li(uid crystal display)
A display technology using a thin layer of li(uid polymers that can be
used to transmit or bloc light according to whether a charge is applied*
+) 'hat is Acti#e matri, display)
A li(uid crystal display using a transistor to control the transmission
of light at each indi#idual pi,el*
-) 'hat is pi,el)
.he smallest indi#idual picture element* Screens are composed of
hundreds of thousands to millions of pi,els/ organi0ed in a matri,*
1) 'hat is datapath )
.he component of the processor that performs arithmetic operations*
2) 'hat is flash memory)
A non#olatile semiconductor memory* 3t is cheaper and slower than D%AM
but more e,pensi#e per bit and faster than magnetic diss* Access times are
about 1 to 14 microseconds *
5) 'hat is response time or e,ecution time)
.he total time re(uired or the computer to complete a tas/ including dis
accesses/ memory accesses/ 367 acti#ities/ operating system o#erhead/ C"U
e,ecution time/ and so on*
8) 'hat is throughput or bandwidth)
3t is the number of tass completed per unit time*
9) 'hat is cloc cycles per instruction :C"3) )
A#erage number of cloc cycles per instruction for a program or program
fragment*
14) 'hat is data transfer instruction)
A command that mo#es data between memory and registers*
11) 'hat is address)
A #alue used to delineate the location of a specifi c data element within a
memory array*
1&) 'hat is conditional branch)
An instruction that re(uires the comparison of two #alues and that allows
for a subse(uent transfer of control to a new address in the program based on
the outcome of the comparison*
1+) 'hat is basic bloc)
A se(uence of instructions without branches :e,cept possibly at the end)
and without branch targets or branch labels :e,cept possibly at the beginning)*
1-) 'hat is ;ump address table or ;ump table*
A table of addresses of alternati#e instruction se(uences*
11) 'hat is "C<relati#e addressing )
An addressing regime in which the address is the sum of the program
counter :"C) and a constant in the instruction**
12) 'hat is addressing mode)
7ne of se#eral addressing regimes delimited by their #aried use of operands
and6or addresses*
15) List the different types of addressing*
o 3mmediate addressing
%egister addressing
=ase or displacement addressing
"C<relati#e addressing
"seudodirect addressing
18 ) 3f computer A runs a program in 14 seconds and computer = runs the same program in
11 seconds/ how much faster is A than =)
'e now that A is n times as fast as = if
.hus the performance ratio is
11614 > 1*1
and A is therefore 1*1 times as fast as =*
3n the abo#e e,ample/ we could also say that computer = is 1*1 times slower than computer A/
since
means that