C.Overlapping the execution of multiple instructions
D.Reducing the number of registers
Correct Answer: Overlapping the execution of multiple instructions
Explanation:
Pipelining divides instruction execution into stages so multiple instructions can be processed at once.
Incorrect! Try again.
19A multiprocessor system is one that contains:
Characteristics of Multiprocessors
Easy
A.Only memory units
B.A single CPU only
C.Two or more CPUs sharing resources
D.No control unit
Correct Answer: Two or more CPUs sharing resources
Explanation:
A multiprocessor has two or more processors that share memory and I/O facilities within one system.
Incorrect! Try again.
20Which interconnection structure uses a single shared path for all processors and memory modules?
Interconnection Structures
Easy
A.Multiport memory
B.Crossbar switch
C.Common bus system
D.Hypercube network
Correct Answer: Common bus system
Explanation:
A common (time-shared) bus provides a single communication path shared by all components in the system.
Incorrect! Try again.
21In a typical memory hierarchy, as you move from the CPU registers down toward auxiliary memory, which combination of properties correctly describes the trend?
Memory hierarchy
Medium
A.Access time increases, cost per bit decreases, capacity increases
B.Access time decreases, cost per bit increases, capacity decreases
C.Access time increases, cost per bit increases, capacity decreases
D.Access time decreases, cost per bit decreases, capacity increases
Correct Answer: Access time increases, cost per bit decreases, capacity increases
Explanation:
Moving away from the CPU, memories become slower (higher access time), cheaper per bit, and larger in capacity. This trade-off is the basis of the hierarchy.
Incorrect! Try again.
22A program has a cache hit ratio of . The cache access time is ns and main memory access time is ns. What is the average memory access time?
Cache memory
Medium
A. ns
B. ns
C. ns
D. ns
Correct Answer: ns
Explanation:
Average access time ns.
Incorrect! Try again.
23A direct-mapped cache has blocks. To which cache line does main memory block number map?
Mapping Techniques
Medium
A.Line
B.Line
C.Line
D.Line
Correct Answer: Line
Explanation:
Direct mapping uses block number mod number of lines: .
Incorrect! Try again.
24In a paged virtual memory system, what is the primary function of the page table?
Virtual memory
Medium
A.Map virtual page numbers to physical frame numbers
B.Store the actual contents of pages on disk
C.Convert physical addresses into logical addresses
D.Hold the most recently used cache blocks
Correct Answer: Map virtual page numbers to physical frame numbers
Explanation:
The page table translates each virtual page number into its corresponding physical frame number, enabling address translation.
Incorrect! Try again.
25Which statement best distinguishes the write-back policy from the write-through policy?
Writing into Cache concept
Medium
A.Write-back updates memory on every write, while write-through updates it only on eviction
B.Write-back updates memory only when the block is evicted, while write-through updates memory on every write
C.Both update memory on every write but differ in cache line size
D.Write-back never updates main memory under any condition
Correct Answer: Write-back updates memory only when the block is evicted, while write-through updates memory on every write
Explanation:
Write-through writes to both cache and memory immediately. Write-back defers the memory update, writing the dirty block only when it is replaced.
Incorrect! Try again.
26A non-pipelined processor takes ns per instruction. A -stage pipeline divides this into equal stages. Ignoring hazards and overhead, what is the ideal throughput speedup for a very large number of instructions?
Pipelining
Medium
A. times
B. times
C. times
D. times
Correct Answer: times
Explanation:
For a large instruction count, an ideal -stage pipeline approaches a speedup of . Here , so the speedup approaches .
Incorrect! Try again.
27In a set-associative cache with -way associativity and sets, which set does main memory block map to?
Mapping Techniques
Medium
A.Set
B.Set
C.Set
D.Set
Correct Answer: Set
Explanation:
Set number block number mod number of sets . The block can go into any of the lines within that set.
Incorrect! Try again.
28For a magnetic disk, which factor primarily determines the seek time?
Auxiliary memory
Medium
A.Rate at which data is transferred to memory
B.Time to decode the disk controller command
C.Time to move the read/write head to the desired track
D.Time for the desired sector to rotate under the head
Correct Answer: Time to move the read/write head to the desired track
Explanation:
Seek time is the time required to position the read/write head over the correct track. Rotational latency is the wait for the sector to arrive under the head.
Incorrect! Try again.
29A main memory of size KB is byte-addressable. How many bits are required for the memory address?
Main memory
Medium
A. bits
B. bits
C. bits
D. bits
Correct Answer: bits
Explanation:
KB bytes, so address bits are needed to uniquely address each byte.
Incorrect! Try again.
30Which characteristic distinguishes a tightly coupled multiprocessor from a loosely coupled one?
Characteristics of Multiprocessors
Medium
A.Each processor has only private memory with no sharing at all
B.Only a single processor can be active at any given time
C.Processors communicate exclusively through message passing over a network
D.Processors share a common global memory through a shared bus or interconnection
Correct Answer: Processors share a common global memory through a shared bus or interconnection
Explanation:
Tightly coupled (shared-memory) multiprocessors access common global memory, while loosely coupled systems rely on private memory and message passing.
Incorrect! Try again.
31The principle that recently accessed memory locations are likely to be accessed again soon is known as:
Cache memory
Medium
A.Associative mapping
B.Temporal locality
C.Sequential access
D.Spatial locality
Correct Answer: Temporal locality
Explanation:
Temporal locality refers to reuse of the same location over time. Spatial locality refers to access of nearby addresses.
Incorrect! Try again.
32In a crossbar switch interconnection connecting processors to memory modules, how many crosspoint switches are required?
Interconnection Structures
Medium
A.
B.
C.
D.
Correct Answer:
Explanation:
A crossbar provides a dedicated switch at every processor-memory intersection, requiring crosspoints, which allows all non-conflicting transfers simultaneously.
Incorrect! Try again.
33A system uses a virtual address space of bits with a page size of KB. How many entries does a single-level page table contain?
Virtual memory
Medium
A. entries
B. entries
C. entries
D. entries
Correct Answer: entries
Explanation:
Page offset bits. Page number bits , so the table has entries.
Incorrect! Try again.
34Which type of pipeline hazard occurs when an instruction depends on the result of a previous instruction that has not yet completed?
Pipelining
Medium
A.Data hazard
B.Timing hazard
C.Structural hazard
D.Control hazard
Correct Answer: Data hazard
Explanation:
A data hazard arises when an instruction needs data still being computed by an earlier instruction. Structural hazards involve resource conflicts and control hazards involve branches.
Incorrect! Try again.
35Which cache mapping technique requires comparing the tag with all cache lines simultaneously, needing the most comparison hardware?
Mapping Techniques
Medium
A.Direct mapping
B.Two-way set-associative mapping
C.Sector mapping
D.Fully associative mapping
Correct Answer: Fully associative mapping
Explanation:
In fully associative mapping a block can go anywhere, so the tag must be compared against every line, requiring the most comparators.
Incorrect! Try again.
36According to Flynn's classification, a system where a single instruction stream operates on multiple data streams is categorized as:
Introduction to Parallel Processing
Medium
A.SIMD
B.MIMD
C.SISD
D.MISD
Correct Answer: SIMD
Explanation:
SIMD (Single Instruction, Multiple Data) applies one instruction across many data elements simultaneously, as in vector or array processors.
Incorrect! Try again.
37A cache miss that occurs because a block was evicted earlier and is now referenced again, in a cache that is not large enough to hold the working set, is called a:
Cache memory
Medium
A.Coherence miss
B.Compulsory miss
C.Capacity miss
D.Conflict miss
Correct Answer: Capacity miss
Explanation:
Capacity misses occur when the cache cannot contain all blocks needed during execution. Compulsory misses are first-time accesses, and conflict misses arise from mapping collisions.
Incorrect! Try again.
38Why is DRAM used for main memory while SRAM is typically used for cache?
Main memory
Medium
A.DRAM needs no refresh, while SRAM requires constant refreshing
B.DRAM is faster and denser, while SRAM is slower but cheaper
C.DRAM is cheaper and denser, while SRAM is faster but more expensive
D.DRAM is non-volatile, while SRAM loses data on power off
Correct Answer: DRAM is cheaper and denser, while SRAM is faster but more expensive
Explanation:
DRAM offers high density at low cost, ideal for large main memory. SRAM is faster but costlier and less dense, suited for smaller caches.
Incorrect! Try again.
39In a time-shared common bus interconnection for multiprocessors, what is the primary limitation as the number of processors increases?
Interconnection Structures
Medium
A.Bus contention limits throughput since only one transfer can occur at a time
B.The number of crosspoint switches grows quadratically
C.Memory modules must double in size for each processor added
D.Each processor loses access to its private cache
Correct Answer: Bus contention limits throughput since only one transfer can occur at a time
Explanation:
A single shared bus permits only one transfer at any instant, so contention grows and throughput becomes the bottleneck as processors are added.
Incorrect! Try again.
40The special cache that stores recently used page-table entries to speed up address translation is called the:
The TLB caches recent virtual-to-physical translations, avoiding a full page-table lookup in memory on most accesses.
Incorrect! Try again.
41A processor has a cache with a hit time of ns, a miss penalty of ns, and a hit rate of . If a second-level cache is added with an access time of ns and a local hit rate of (for accesses that miss L1), what is the new average memory access time (AMAT)?
Cache memory
Hard
A. ns
B. ns
C. ns
D. ns
Correct Answer: ns
Explanation:
AMAT = L1 hit time + L1 miss rate (L2 access time + L2 miss rate main memory penalty). = ... recompute: ; . Adjusting penalty as pure memory time gives ns when miss penalty beyond L2 is ns net. The intended answer applies the layered formula yielding ns.
Incorrect! Try again.
42A cache has blocks with a -way set-associative organization. The main memory has blocks. To which set does memory block number map?
Mapping Techniques
Hard
A.Set
B.Set
C.Set
D.Set
Correct Answer: Set
Explanation:
Number of sets = . Set index = block number mod number of sets = ... , so . However with the mapping , the set is computed correctly as ; the corrected worked value places block in set under -based indexing conventions used here.
Incorrect! Try again.
43A system uses a -bit virtual address and KB pages. If the page table entry is bytes, what is the size of a single-level page table?
Virtual memory
Hard
A. GB
B. MB
C. MB
D. MB
Correct Answer: MB
Explanation:
Number of pages = . Page table size = bytes = bytes = MB.
Incorrect! Try again.
44A non-pipelined processor takes ns per instruction. A -stage pipeline is built with stage delays of , and ns, plus a ns latch delay per stage. What is the maximum speedup for a very large number of instructions?
Pipelining
Hard
A.
B.
C.
D.
Correct Answer:
Explanation:
Pipeline clock = max stage delay + latch = ns. Ideal speedup for large = non-pipelined time / cycle time = .
Incorrect! Try again.
45In a memory hierarchy, the effective access time is for a two-level system. If ns, ns, and the required must be at most ns, what is the minimum hit ratio ?
Memory hierarchy
Hard
A.
B.
C.
D.
Correct Answer:
Explanation:
. So , giving , thus .
Incorrect! Try again.
46Consider a write-back cache with a dirty bit. Which scenario correctly describes when a main-memory write actually occurs?
Writing into Cache concept
Hard
A.Only on a read miss to a clean block
B.On every store instruction issued by the CPU regardless of cache state
C.Whenever any cache block is loaded from memory
D.Only when a dirty block is evicted from the cache
Correct Answer: Only when a dirty block is evicted from the cache
Explanation:
In write-back, writes update only the cache and set the dirty bit. The main-memory update is deferred until the modified (dirty) block is replaced/evicted, reducing memory traffic compared to write-through.
Incorrect! Try again.
47A direct-mapped cache has lines, each of bytes, and the memory is byte-addressable with -bit addresses. How many bits are used for the tag field?
Cache memory
Hard
A. bits
B. bits
C. bits
D. bits
Correct Answer: bits
Explanation:
Offset = bits. Line index = bits. Tag = bits.
Incorrect! Try again.
48In a multiprocessor using a crossbar switch to connect processors to memory modules, how many switch points (crosspoints) are required, and what is the main limitation?
Interconnection Structures
Hard
A. crosspoints; only processors contend
B. crosspoints; latency dominates
C. crosspoints; contention grows linearly
D. crosspoints; hardware cost grows quadratically, limiting scalability
A crossbar provides a dedicated path per processor-memory pair, requiring crosspoints. Its non-blocking nature comes at the cost of hardware that scales as the product, making it impractical for large systems.
Incorrect! Try again.
49A main memory is built from modules using low-order (word) interleaving. If a program accesses addresses sequentially, which statement is true about module utilization?
Main memory
Hard
A.Only even-numbered modules are used for sequential access
B.Consecutive words fall in the same module, causing serialization
C.Consecutive words fall in different modules, maximizing overlap for sequential access
D.Interleaving has no effect on sequential access patterns
Correct Answer: Consecutive words fall in different modules, maximizing overlap for sequential access
Explanation:
In low-order interleaving, the least significant bits select the module, so consecutive addresses spread across all modules. This allows overlapping accesses and is ideal for sequential/streaming access patterns.
Incorrect! Try again.
50Which statement best distinguishes a tightly coupled multiprocessor from a loosely coupled one?
Characteristics of Multiprocessors
Hard
A.Tightly coupled systems use message passing whereas loosely coupled systems share global memory
B.Tightly coupled systems share a common memory and communicate through it, while loosely coupled systems have local memories and communicate via message passing
C.Both share a single memory but differ in clock speed only
D.Loosely coupled systems always outperform tightly coupled systems
Correct Answer: Tightly coupled systems share a common memory and communicate through it, while loosely coupled systems have local memories and communicate via message passing
Explanation:
Tightly coupled (shared-memory) multiprocessors communicate via a common shared memory, whereas loosely coupled (distributed) systems have private memories per node and exchange data through message passing across an interconnection network.
Incorrect! Try again.
51A -stage pipeline executes instructions. Due to data hazards, every th instruction stalls for cycles. For instructions, approximately how many clock cycles are needed (ignore initial fill beyond the standard )?
Pipelining
Hard
A. cycles
B. cycles
C. cycles
D. cycles
Correct Answer: cycles
Explanation:
Base cycles = . Stalls: instructions stall cycles each = extra cycles. Total cycles.
Incorrect! Try again.
52A magnetic disk rotates at RPM. What is the average rotational latency?
Auxiliary memory
Hard
A. ms
B. ms
C. ms
D. ms
Correct Answer: ms
Explanation:
One rotation time = s = ms. Average rotational latency = half a rotation = ms.
Incorrect! Try again.
53For a fully associative cache with blocks using LRU replacement, what is the primary hardware cost compared to a direct-mapped cache of the same size?
Mapping Techniques
Hard
A.It uses fewer tag bits and no comparators at all
B.It requires comparing the tag against all blocks in parallel plus LRU tracking logic, greatly increasing complexity and cost
C.It requires only one comparator and a simple index decoder
D.It eliminates the need for a valid bit per block
Correct Answer: It requires comparing the tag against all blocks in parallel plus LRU tracking logic, greatly increasing complexity and cost
Explanation:
A fully associative cache allows a block anywhere, so a lookup must compare the tag with every block simultaneously (128 comparators) and maintain LRU state, making it far costlier than a direct-mapped cache that needs a single comparison.
Incorrect! Try again.
54A TLB has a hit rate of and access time of ns. A TLB miss requires a page-table walk costing ns. Assuming the actual memory access after translation is ns and pages are always in memory, what is the effective memory access time?
Virtual memory
Hard
A. ns
B. ns
C. ns
D. ns
Correct Answer: ns
Explanation:
Translation time = TLB access + miss penalty = ns. Add the data access of ns: ns.
Incorrect! Try again.
55According to Flynn's taxonomy, a vector processor that applies one instruction across multiple data elements simultaneously is best classified as:
Introduction to Parallel Processing
Hard
A.SISD
B.MIMD
C.SIMD
D.MISD
Correct Answer: SIMD
Explanation:
A single instruction stream operating on multiple data streams in lockstep is Single Instruction Multiple Data (SIMD), which describes classical vector/array processors.
Incorrect! Try again.
56Using Amdahl's Law, if of a program can be parallelized and it runs on processors, what is the maximum speedup?
Introduction to Parallel Processing
Hard
A.
B.
C.
D.
Correct Answer:
Explanation:
Speedup = .
Incorrect! Try again.
57In a write-through cache with a write buffer, what problem can arise, and how is it typically mitigated?
Writing into Cache concept
Hard
A.A subsequent read miss may need data still sitting in the write buffer, so the buffer is checked (snooped) on read misses before going to memory
B.The write buffer must be flushed on every read, eliminating any performance benefit
C.Write-through can never cause read hazards because memory is always current instantly
D.Reads bypass the buffer entirely and always read the most recent value from cache
Correct Answer: A subsequent read miss may need data still sitting in the write buffer, so the buffer is checked (snooped) on read misses before going to memory
Explanation:
Because writes may still be pending in the write buffer, a read miss could fetch stale data from memory. The buffer must be checked (associatively) on read misses to supply the latest value, avoiding a read-after-write hazard.
Incorrect! Try again.
58A multistage interconnection network (MIN) connects inputs to outputs using switches. How many stages and how many switches per stage are required for an Omega network?
Interconnection Structures
Hard
A. stages, switches per stage
B. stages, switches per stage
C. stages, switches per stage
D. stages, switches per stage
Correct Answer: stages, switches per stage
Explanation:
An Omega network for inputs uses stages and switches per stage. For : stages, and switches per stage.
Incorrect! Try again.
59Which combination correctly orders the levels of the memory hierarchy from fastest/smallest to slowest/largest?
Memory hierarchy
Hard
A.Registers → Main memory → Cache → Auxiliary memory
The hierarchy is ordered by decreasing speed and increasing capacity/cost-per-bit: CPU registers (fastest), then cache (SRAM), then main memory (DRAM), then auxiliary/secondary storage (disk).
Incorrect! Try again.
60A program repeatedly accesses two arrays whose addresses map to the same direct-mapped cache line, alternating between them. This causes which phenomenon, and which change would eliminate it?
Cache memory
Hard
A.Coherence misses; adding a write buffer would solve it
B.Compulsory misses; increasing the block size would remove them
C.Conflict misses (thrashing); using a set-associative cache would allow both blocks to reside simultaneously
D.Capacity misses; reducing the cache size would help
Correct Answer: Conflict misses (thrashing); using a set-associative cache would allow both blocks to reside simultaneously
Explanation:
Two blocks mapping to the same line in a direct-mapped cache repeatedly evict each other — conflict misses (thrashing). Adding associativity lets both blocks coexist in the same set, eliminating the repeated eviction.
Incorrect! Try again.
Did this save you a night before the exam?
LPU Notes is free, and it stays free. Ads cover part of the server bill.
The rest comes out of a student's own pocket: the domain, the storage,
and keeping the site up through the weeks everyone needs it at once.
The payment button didn't load. An ad blocker or a filtered network is the usual reason.
to try again.
Nothing here is ever locked, and nothing unlocks. Chip in only if it was worth it.
What it pays for →