d. mutual exclusion
170. _ _ _ _ _ _ _ _ _ _ _ _ _ is often used to indicate whether
or not a processor is executing a critical sectiona. monitor b.
spin lock c. semaphored. rendezbous
171. _ _ _ _ _ _ _ _ is the common communication mechanism used
between processors a. FIFO b. semaphorec. shared memory d. message
queue
172. _ _ _ _ _ _ _ _ _ _ multiprocessor system memory is
distributed among the processors and there is no shared memory for
passing information a. tightly coupled b. shared memory c. loosely
coupled d. specialized
173. A _ _ _ _ _ _ _ _ _ _ _ is a program sequence that once
begun must complete execution before another processor access the
same shared resource a. critical section b. entry section c. mutual
exclusion d. exit section
174. A scheme that allows writable data to exist in atleast one
cache is a method that employees _ _ _ _ _ _ _ _ _ _ in its
compiler a. distributed local table b. distributed global table c.
centralized local table d. centralized global table
175. A memory scheme is _ _ _ _ _ _ _ _ _ _ _ _ _ _ if the value
returned on a load instruction is always the value given by the
latest store instruction with the same address a. conflict b.
coherence c. concurrentd. coupling
176. The bus controller that monitors the cache coherence
problem is referred as _ _ _ _ _ _ _ a. snoopy cache controller b.
split cache controller c. direct cache controller d. side cache
controller
177. In _ _ _ _ _ _ _ _ mechanism both cache and main memory are
updated with every write operationa. write back b. write both c.
write through d. write once
178. In _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ mechanism only the cache
is updated and the location is marked so that it can be copied
later into main memory a. write back b. write both c. write through
d. write once
www.UandiStar.org
Downloaded from www.youthmantra.com JNTU ONLINE EXAMINATIONS
[Mid 2 - CO]
"Locality of Reference" is related to:Register
Cache
Primary Memory
Magnetic Tape
Expand CAMCache Access Memory
Call Access Mode
Contents Addressable Memory
Cache Access Module
Associative Memory is likePrimary Memory
Secondary Memory
Cache Memory
Auxiliary Memory
In the Memory Hierarchy, top to bottom (Registers to
Tape)Capacity Decreases
Capacity Increases
Speed Increases
Cost per bit Increases
In the Memory Hierarchy, top to bottom (Registers to Tape)Cost
per bit decreases
Cost per bit Increases
Speed Increases
Access Time Decreases
In the Memory Hierarchy, bottom to top (Tape to Registers)Speed
Decreases
Access time Increases
Capacity Increases
Capacity Decreases
In the Memory Hierarchy, top to bottom (Registers to tape)Speed
Increases
Speed decreases
Cost per bit Increases
Access time decreases
In the Memory Hierarchy, the following Memory has least
capacityRegister
Cache
Primary Memory
Magnetic Tape
In the Memory Hierarchy, the following Memory has maximum Access
timeRegister
Cache
Primary Memory
Magnetic Tape
In the Memory Hierarchy, the following Memory has least Access
timeRegister
Cache
Primary Memory
Magnetic Tape
In the Memory Hierarchy, Speed of accessing is high for
Register
Cache
Primary Memory
Magnetic Tape
In the Memory Hierarchy, Speed of accessing is low
forRegister
Cache
Primary Memory
Magnetic Tape
In the following which is accesed sequentially Register
Cache
Primary Memory
Magnetic Tape
In the Memory Hierarchy, Cost per bit is least forRegister
Cache
Primary Memory
Magnetic Tape
In the Memory Hierarchy, the Cost per bit is most
forRegister
Cache
Primary Memory
Magnetic Tape
512 x 8 ROM indicates512 data, 8 address lines
512 address, 8 data lines
520 address lines
520 data lines
The Static RAM consists ofCapacitors
Internal Flip Flops
Internal Caches
Filters
The Dynamic RAM consists ofCapacitors
Internal Flip Flops
Internal Caches
Filters
The decoder used for decoding 512 x 8 ROM consists of how many
input lines?512
8
9
520
The Principal technology used for main Memory is based onSemi
conductor ICs
Conductor ICs
Both Semi Conductor and Conductor ICs
Using Insulator
Refreshing is required forAll RAMs
Only DRAMs
Only SRAMs
Both SRAMs and DRAMs
Boot Strap loader requiresRAM
ROM
Any Memory
Only Processor
By making programs and data available at a rapid rate, it is
possible toDecrease the performance
Increase the performance
Save Memory
Reduce cost
The part of the computer system that supervises the flow of
information between Auxiliary Memory and Main Memory is
calledProcessor Management System
Data Management System
Address Management System
Memory Management System
Existence of two or more programs in different parts of the
Memory Hierarchy at the same time is defined as:Uni programming
Multi programming
Multi processing
Uni processing
If Cache Access time is 100ns, Memory access time is 1000ns, if
the hit percentage is 100 %, what is the Average access time100
1000
1100
10
If both Cache Memory and Main Memory are updated for a write
operation, the type of the Cache Memory is calledWrite-back
Write-through
Associative
TLB
If only Cache location is updated during a Write operation as
long as there is no replacement, the type of the Cache Memory is
calledWrite-back
Write-through
Associative
TLB
Replacing the block that has been not used for the longest
period of time isFIFO
LRU
MRU
LFU
Replacing the page that entered the Memory at first isFIFO
LRU
MRU
LFU
A faster and smaller Memory in between CPU and main Memory
isPrimary Memory
Secondary Memory
Cache Memory
Auxiliary Memory
To compensate speed mismatch between main Memory and Processor,
the Memory used isPrimary Memory
Secondary Memory
Cache Memory
Auxiliary Memory
If Hit ratio is 0.8, the miss ratio9.2
92 %
0.2
20 %
In the following, which is not a Cache Mapping
techniqueAssociative Mapping
Direct Mapping
Test-Associative Mapping
Set-Associative Mapping
In four-way Set-Associative mapping, the number of tags
areOne
Two
Four
Sixteen
In the following, which is the fastest mapping techniqueDirect
Mapping
Associative Mapping
Test-Associative Mapping
Set-Associative Mapping
In Cache, the data stored isMost frequently used
Least frequently used
Never used
Segment with large data
The transfer of data between main Memory and Cache isWORD
BLOCK
LINE
CHARACTER
The transfer of data between Processor and Cache isWORD
BLOCK
FRAME
CHARACTER
"Beladys Anomaly" does not occur inFIFO
LRU
MRU
Optimal replacement
In Paging technique, the logical address space isDivided into
equal parts
Divided into unequal parts
divided into two parts
Either equal or unequal parts
The technique of Segmentation suffers which
fragmentationInternal
External
both Internal and External
Neither Internal nor External
"Paged Segmentation" hasInternal fragmentation
External fragmentation
Zero fragmentation
Neither Internal nor External
The time taken to access a particular track isSeek time
Latency time
Access time
Burst time
The time taken to access a particular sector isSeek time
Latency time
Access time
Burst time
For a magnetic tape, the access isRandom Access
Sequential Access
Both Random and Sequential
Rotational
For a magnetic disc, the access isDirect Access
Sequential Access
Both Random and Sequential
Rotational
The technique of Paging suffers which fragmentationInternal
External
both Internal and External
Neither Internal nor External
By using TLB in Paged segmentationAccess time decreases
Access time increases
Speed decreases
Fragmentation decreases
Contents addressable Memory (CAM) is related toPage table
Associative Page table
Inverted Page table
Normal Page table
If there are sixteen bits in the Virtual Address format, the
size of the Virtual Address is16K words
16 words
64 K words
16M words
If the size of the Page is 1K for a Virtual Address space of
16K, the size of the Frame in main Memory is16K
8K
4K
1 K
Discs that are permanently attached to the unit assembly and
cannot be removed by the occasional user are calledFloppy discs
Hard discs
External discs
Flash Memory
A disk drive with a removable disk is Hard disk
Floppy disk
Permanent disk
Cache
In the following, which is not a Physical MemoryPrimary
Memory
Cache Memory
Flash Memory
Virtual Memory
Which Page Replacement technique is most efficientFIFO
LRU
MRU
LFU
Page table containsStarting address of Page
Page no., Frame no.
Length of the page
Page no., Segment no.
Number of Printing Characters in ACSII code are128
94
34
8
Number of Non Printing Characters in ACSII code are128
94
34
8
ASCII code uses how many bits5
7
8
9
The Cathode Ray Tube contains an electronic gun which can be
deflectedOnly horizontally
Only vertically
Both horizontally and vertically
Neither horizontally nor vertically
Input/Output devices connected to the computer are also called
asModems
Routers
Peripherals
Processors
Which of the following is not a Printer?Inkjet printer
Dot Matrix
Laser Printer
Scanner
In the following which is sequentially accessedMagnetic Disc
Magnetic Tape
Flash Memory
Cache Memory
The command used to activate the peripheral and to inform it
what to do isControl command
Status command
Data output command
Data input command
The command that causes the interface to respond by transferring
data from the Bus into one of its registers isControl command
Status command
Data output command
Data input command
The command used that causes the interface to receive an item of
data from the peripheral and places it in its Buffer register
isControl command
Status command
Data output command
Data input command
In Asynchronous data transfer, both sender and receiver
accompany a control signal that is:Strobe
Hand Shaking
Two wire control
Single wire control
The circuit which provides the interface between computer and
similar interactive terminal isUSRP
UART
Flip Flop
D-Flip Flop
The command used to test various status conditions in the
interface and the peripheral isControl command
Status command
Data output command
Data input command
In the following which mapping does not distinguish Memory
address and I/O addressMemory mapped I/O
Isolated I/O
Independent I/O
Interrupt driven I/O
In the following which mapping uses different address space for
Memory and I/OMemory mapped I/O
Isolated I/O
Independent I/O
Interrupt driven I/O
The rate at which Serial information is transmitted and is
equivalent to the data transfer in bits per second isBaud rate
Bit rate
Control rate
Strobe rate
In Daisy chaining, the number of interrupt request lines is
(are)n
2n
only one
changes
In Daisy chaining, the number of interrupt acknowledge lines is
(are)n
2n
only one
changes
In the following, which is not priority interrupt
methodPolling
Daisy chaining
Parallel priority
Direct Memory Access
In the following, which is efficientProgrammed I/O
Interrupt initiated I/O
Direct Memory Access
All the equally efficient
In the following, which uses separate controller for data
transferProgrammed I/O
Interrupt initiated I/O
Direct Memory Access
Memory mapped I/O
In Polling, the drawback isCost is more
Complex hardware is required
Time consuming
Maintenance is more
Daisy Chaining isSoftware method
Hardware method
Both software and hardware
Neither software nor hardware
In the following, which is not a mode of transferProgrammed
I/O
Interrupt initiated I/O
Direct Memory Access
Memory mapped I/O
In Priority interrupt when two devices interrupt the computer at
the same, the computer services the devicewith larger length at
first
with shorter length at first
with highest priority at first
with lowest priority at first
In Daisy chaining, device with highest priority is inFirst
position
Middle position
Last position
Any position
Continuously monitoring I/O devices is done inProgrammed I/O
Interrupt initiated I/O
Direct Memory Access
Memory mapped I/O
In the following, which is more time consumingProgrammed I/O
Interrupt initiated I/O
Direct Memory Access
Memory mapped I/O
A block sequence consisting of a number of Memory words is
transferred continuously while a DMA controller is master of Memory
Bus. This isPolling
Daisy Chaining
Burst transfer
Cycle Stealing
DMA controller transfer one data word at a time and transfers
the control of the Bus to CPU. This isPolling
Daisy Chaining
Burst transfer
Cycle Stealing
In the following, which is a method related to DMA.Polling
Daisy Chaining
Parallel Priority
Cycle Stealing
For fast transfer of information between Magnetic Disc and
Memory, which of the following is recommendedProgrammed I/O
Daisy Chaining
Polling
DMA
The DMA controller acts likePrimary Memory
CPU
Cache Memory
Router
The number of basic I/O commands in IBM 370 computer IOP
is50
6
8
40
The number of basic I/O commands in Intel 8089 computer IOP
is50
6
8
40
The Intel 8089 I/O processor contains the IC package of64
pins
40 pins
16 pins
32 pins
A Processor with Direct Memory Access capability that
communicates with I/O devices isInput Output Processor
Data communication processor
Data communication programmer
Input Output programmer
A processor that communicates with remote terminals over
telephone and other communication media in a serial fashion is
calledInput Output Processor
Data communication processor
Data communication programmer
Input Output programmer
The I/O processor in IBM 370 computer is calledRouter
Channel
Device
Modem
Let the time taken to process a sub-operation in each segment be
20ns. AssumeThat the pipeline has 4 segments and executes 100 tasks
in sequence. What is the Speed up of pipeline system?8000ns
3060ns
2060ns
6000ns
The _ _ _ _ _ _ _ _ _ _ architecture represents the organization
of a computer containing a single control unit, a processor unit
and a memory unit.SIMD
MISD
SISD
MIMD
Total operations performed going through all the segments in the
pipeline is called as _ _ _ _ _ _ _ _ _ function
process
sequence
task
One type of parallel processing that does not fit Flynns
classification is _ _ _ _ _ _ _ _ processing.array
vector
multi
pipeline
The sequence of instructions read from memory constitutes _ _ _
_ _ _ _ _ data stream
execution stream
instruction stream
process stream
Most of the multi processors and multi computer systems can be
classified in _ _ _ _ _ _ _ _ category.MISD
SIMD
SISD
MIMD
The behavior of a pipeline can be illustrated with _ _ _ _ _ _ _
diagramfrequency-time
timing
space-time
dataflow
As the number of tasks increases, the speed up is equal to the
number of _ _ _ _ _ _ in the pipelinetasks
segments
suboperations
instructions.
Suppose the time delays of four segments are and the interface
registers have a delay of tr=10ns. What must be the clock cycle
time?100ns
120ns
110ns
130ns
Each entry in the BTB consists of the address of a previously
executed _ _ _ _ _ _ _ _ instruction and the _ _ _ _ _ _ _ _
instruction for that branchbranch, target
branch, buffer
target, branch
buffer, branch
_ _ _ _ _ _ _ _ _ conflicts arise when an instruction depends on
the result of a previous instructionresource
branch
segment
data dependency
When an overflow occurs, the mantissa of the sum or difference
is shifted _ _ _ _ _ _And exponent incremented by _ _ _ _ _ _right,
one
left, one
right, two
left, two
A _ _ _ _ _ _ _ _ pipeline divides an arithmetic operation into
suboperations for execution in the pipeline segments.vector
arithmetic
instruction
multiple
_ _ _ _ _ _ _ _ _ pipeline operates on a stream of instructions
by overlapping phases of instruction cycle.arithmetic
instruction
vector
multiple
The instruction fetch segment can be implemented by means of a _
_ _ _ _ _ bufferLIFO
FIFO
FILO
LILO
The instruction stream queuing mechanism provides an efficient
way for reducing _ _ _ _ _ _ _ _ _ _ for reading instructions from
memoryaccess time
seek time
overlapping time
processing time
_ _ _ _ _ _ _ _ _ is a circuit that detects instructions whose
source operands are destinations of instructions further up in the
pipelineoperand forwarding
interlocks
delayed load
data decoder
The method used in most RISC processors is to rely on the
compiler to redefine the branches so that they take effect at the
proper time in the pipeline. This method is called _ _ _ _ _ _ _ _
_ _delayed branch
delayed load
delayed store
delayed add
The RISC consists of only _ _ _ _ _ _ _ _ length instruction
formatvariable
fixed
small number
large number
The data transfer instructions in RISC are limited to _ _ _ _ _
_ _ and _ _ _ _ _ _ _ _ instructionsadd, sub
mul, div
load, store
in, out
Since all operands are in registers, there is no need for _ _ _
_ _ _ _ _ of operands from memoryfetch
decode
execute
store
The concept of delaying the use of the data loaded from memory
is referred to as _ _ _ _ _ _ _ _ _ _delayed branch
delayed load
delayed store
delayed add
The compiler for a processor that uses delayed branches is
designed to analyze the instructions _ _ _ _ _ _ _ _ _ _ _ the
branchbefore
after
before & after
later
A computer capable of vector processing eliminates the overhead
associated with the time it takes to _ _ _ _ _ _ _ _ and _ _ _ _ _
_ _ _ _ _ the instructions in the program loopfetch, decode
fetch, execute
execute, decode
fetch, store
A vector processor that uses an n-way interleaved memory can
fetch _ _ _ _ _ _ _ _ _ _ _ operands from _ _ _ _ _ _ _ _ _
different modulesn, n
n, m
1, 1
1, 2
Matrix _ _ _ _ _ _ _ is one of the most computational intensive
operations performed In computers with vector
processorsaddition
subtraction
transpose
multiplication
A computer with vector instructions and pipelined floating-point
arithmetic operations is referred to as _ _ _ _ _ _ _ _
computermini
mainframe
super
micro
A measure used to evaluate computers in their ability to
performs a given number of floating-point operations per second is
referred as _ _ _ _ _ _ _ _ _ _MIPS
KIPS
FLOPS
BAUDS
_ _ _ _ _ _ _ _ _ _ processing deals with computations involving
large matricesarithmetic
parallel
pipeline
vector
Aerodynamics and space flight simulations uses _ _ _ _ _ _ _ _ _
_ processingvector
arithmetic
parallel
pipeline
In _ _ _ _ _ _ _ memory, different sets of addresses are
assigned to different memory modulesassociate
random
interleaved
multiple
A vector is an ordered set of _ _ _ _ _ _ _ _ _ dimensional
array of data itemstwo
three
one
four
Instruction format for vector instruction is _ _ _ _ _ _ _ _
address instructionzero
one
two
three
One of the following _ _ _ _ _ _ _ _ _ system is an example for
array processorVAX
PDP-11
MPP
ILLIAC-IV
Each processing element of SIMD will have _ _ _ _ _ _ _ _ _
memoryglobal
shared
local
temporary
An array processor consists of _ _ _ _ _ _ _ _ _ instructions
and _ _ _ _ _ _ _ data organizationsingle, multiple
multiple, single
single, single
multiple, multiple
The objective of the attached array processors is to provide _ _
_ _ _ _ _ _ capabilities to a conventional computerhigh speed
pipelined
parallel
vector manipulation
The function of the master control unit in SIMD processor is to
_ _ _ _ _ _ _ _ _ _ _ the instructionfetch
decode
execute
store
_ _ _ _ _ _ _ _ _ _ array processor is an auxiliary processor
attached to a general purpose computerattached
auxiliary
parallel
distributed
The attached processor is a _ _ _ _ _ _ _ _ machine driven by
the host computerfront-end
back-end
master
slave
Scalar and program controlled instructions are directly executed
with in the _ _ _ _ _ _ unitmaster control
memory
PE
local memory
The system with the attached processor satisfies the needs for _
_ _ _ _ _ _ arithmetic applicationscomplex
simple
scalar
vector
_ _ _ _ _ _ _ _ _ _ schemes are used to control the status of
each PE during the executionmasking
blocking
delayed
translation
The inter process communication mechanism used in loosely
coupled system is _ _ _ _pipes
FIFO
shared memory
message queues
Tightly coupled systems can tolerate a _ _ _ _ _ _ _ degree of
interaction between tasksno
higher
lower
minimal
Multiprocessing can improve performance by decomposing a program
into _ _ _ _ _ _ _ executable tasksserial
parallel
multiple
several
_ _ _ _ _ _ _ _ technology has reduced the cost of computer
components very much. SSI
MSI
VLSI
LSI
Multiprocessors are classified as multiple processor _ _ _ _ _ _
_ _ systemsSISD
MIMD
SIMD
MISD
_ _ _ _ _ _ _ _ _ architecture forms a computer
networkmultiprocessor
multi computer
single computer
distributed computer
Each processor element in a _ _ _ _ _ _ _ _ _ system has its own
private local memorytightly coupled
loosely coupled
time shared
multistage
The inter process communication mechanism used in tightly
coupled system is _ _ _ _pipes
FIFO
shared memory
message queues
The _ _ _ _ _ _ _ _ _ _ interconnection is suitable for
connecting small number of processorscross bar
multiport
multi stage
hypercube
The basic component of a multi stage network is a 2-input
2-output interchange _ _ _ _ _crossbar
connection point
switch
hub
_ _ _ _ _ _ _ _ _ memory system employees separate buses between
each memory module and each CPUcommon bus
multiport
crossbar
multistage switch
A three cube structure consists of _ _ _ _ _ _ _ nodes1
2
4
8
_ _ _ _ _ _ _ _ _ consists of a number of points that are placed
at intersections between processor buses and memory partscross
bar
multiport
common bus
hypercube
_ _ _ _ _ _ _ _ _ is used to control the communication between a
number of sources and destinationscross bar
multiport
commonbus
multistage switch
The _ _ _ _ _ _ _ _ multiprocessor structure is a loosely
coupled system with 2n processorscrossbar
multi port
hypercube
multistage switch
A single common bus system is restricted to transfer _ _ _ _ _ _
_ _ _ _ processor at a timeone
two
many
IOP
_ _ _ _ _ _ _ _ multiprocessor system consists of a number of
processors connected through a common path to a memory unitcommon
bus
multiport
crossbar
hypercube
The crossbar switch consists of _ _ _ _ _ _ _ _ _ _ _ _
devicesdecoder
encoder
multiplexer
de-multiplexer
The IEEE 796 standard bus has _ _ _ _ _ _ _ _ data _ _ _ _ _ _ _
address and _ _ _ _ _ _ _ _ control lines36,24,36
10,24,30
16,24,26
16,20,20
_ _ _ _ _ _ _ _ _ _ _ _ must be performed to resolve multiple
contention for the shared resourcesarbitration
multiplexing
looping
controlling
The processor in a shared memory multiprocessor system request
access to common memory through _ _ _ _ _ _ _ _system bus
internal bus
synchronized bus
asynchronus bus
The parallel bus arbitration technique uses _ _ _ _ _ _ _ _
priority encoders and decodersinternal
maximum
external
low
The _ _ _ _ _ _ _ _ _ _ _ _ _ algorithm gives the highest
priority to the requesting device that has not used the bus for the
longest intervalpolling
LRU
FIFO
time slice
In _ _ _ _ _ _ _ _ bus , each data item is transferred during a
time slice known to source and destination in advanceserial
parallel
synchronus
asynchronus
In serial arbitration procedure the device closest to the
priority line is assigned _ _ _ _ _ _ _ prioritylow
high
normal
no
The _ _ _ _ _ _ _ _ algorithm allocates a fixed length time
slice of bus time to each processorpolling
LRU
FIFO
time slice
In the _ _ _ _ _ _ _ _ _ _ scheme , requests are served in the
order receivedpolling
LRU
FIFO
time slice
The _ _ _ _ _ _ _ _ _ _ sequence is normally programmable and as
a result the selection priority can be altered under program
controlpolling
LRU
FIFO
time slice
Out of the following which one is the hardware instruction to
implement semaphoreflag
turn
spin
test and set
To protect data from being changed simultaneously by 2 or more
processors is called _ _ _ _ _ _ _ _ _ _protection
access matrix
hiding
mutual exclusion
_ _ _ _ _ _ _ _ _ _ _ _ _ is often used to indicate whether or
not a processor is executing a critical sectionmonitor
spin lock
semaphore
rendezbous
_ _ _ _ _ _ _ _ is the common communication mechanism used
between processorsFIFO
semaphore
shared memory
message queue
_ _ _ _ _ _ _ _ _ _ multiprocessor system memory is distributed
among the processors and there is no shared memory for passing
informationtightly coupled
shared memory
loosely coupled
specialized
A _ _ _ _ _ _ _ _ _ _ _ is a program sequence that once begun
must complete execution before another processor access the same
shared resourcecritical section
entry section
mutual exclusion
exit section
A scheme that allows writable data to exist in atleast one cache
is a method that employees _ _ _ _ _ _ _ _ _ _ in its
compilerdistributed local table
distributed global table
centralized local table
centralized global table
A memory scheme is _ _ _ _ _ _ _ _ _ _ _ _ _ _ if the value
returned on a load instruction is always the value given by the
latest store instruction with the same addressconflict
coherence
concurrent
coupling
The bus controller that monitors the cache coherence problem is
referred as _ _ _ _ _ _ _snoopy cache controller
split cache controller
direct cache controller
side cache controller
In _ _ _ _ _ _ _ _ mechanism both cache and main memory are
updated with every write operationwrite back
write both
write through
write once
In _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ mechanism only the cache is
updated and the location is marked so that it can be copied later
into main memorywrite back
write both
write through
write once