StudyFox
कीमतेंब्लॉगएक्सटेंशनमुफ़्त टूल
  • कीमतें
  • ब्लॉग
  • एक्सटेंशन
  • मुफ़्त टूल
  • शुरू करेंसाइन इन
StudyFox

अपने नोट्स, PDF और स्लाइड्स को फ़्लैशकार्ड, क्विज़, नोट्स और माइंड मैप में बदलें।

StudyFox खोलें

स्टडी टूल्स

  • होमवर्क हेल्पर
  • नोट मेकर
  • फ़्लैशकार्ड मेकर
  • क्विज़ मेकर
  • माइंड मैप मेकर

प्रोडक्ट

  • कीमतें
  • Chrome एक्सटेंशन
  • मुफ़्त एक्सटेंशन
  • स्टडी सेट देखें
  • ब्लॉग

सहायता

  • सहायता केंद्र
  • संपर्क करें
  • गोपनीयता नीति
  • सेवा की शर्तें

तुलना करें

  • Chegg का विकल्प
  • Course Hero का विकल्प
  • Coursology का विकल्प
  • Photomath का विकल्प
  • Gauthmath का विकल्प
  • PhotoSolve का विकल्प
  • CollegeTools का विकल्प
  • Transcript का विकल्प
  • SmartSolve का विकल्प
  • Homeworkify का विकल्प
  • AnswersAi का विकल्प
  • StudyX का विकल्प
  • Quizlet का विकल्प
  • Anki का विकल्प
  • Knowt का विकल्प
  • Brainscape का विकल्प
  • सभी तुलनाएँ

© 2026 StudyFox AI. सर्वाधिकार सुरक्षित।

  • X
  • Discord
  • Instagram
ExploreEngineering & TechComputer ScienceComputer Architecture Quiz: Pipelines, Cache and Memory

Quiz · Hard

Computer Architecture Quiz: Pipelines, Cache and Memory

Hazards, Amdahl's law, cache mapping and AMAT, virtual memory, RAID and parallelism.

by Kill h.21 questionsCreated Nov 20, 2026, 08:26 PM
Computer Science· Computer ArchitectureTags#pipelining#cache#raid#computer-science#computer-architecture

21 questions

  1. 1

    Which pipeline hazard occurs when an instruction needs a result that the previous instruction has not yet produced?

    • A

      Structural

    • Data

    • C

      Control

    • D

      Memory

    That is a data hazard (read after write).

  2. 2

    In the 4-stage pipeline diagram, once the pipeline is full, how many instructions complete per cycle (ideally)?

    • A

      0.25

    • 1

    • C

      2

    • D

      4

    One instruction completes every cycle; throughput is 1 per cycle although each takes 4 cycles.

  3. 3

    What is the purpose of forwarding in a pipeline?

    • A

      Skip instructions

    • Send an ALU result straight to a dependent instruction without waiting for write-back

    • C

      Predict branches

    • D

      Flush the pipeline

    It reduces stalls from data hazards.

  4. 4

    What is the effect of a branch misprediction?

    • A

      Nothing

    • The wrongly fetched instructions are flushed, wasting cycles

    • C

      The program stops

    • D

      The cache is cleared

    The pipeline must discard speculative work and restart from the correct target.

  5. 5

    According to Amdahl's law, what is the speedup if 80% of a program is made 4 times faster?

    • A

      4x

    • B

      3.2x

    • 2.5x

    • D

      1.25x

    1 / (0.2 + 0.8/4) = 2.5.

  6. 6

    Which is a typical RISC characteristic?

    • A

      Variable-length instructions

    • Fixed-length instructions and load/store access

    • C

      Memory operands in every instruction

    • D

      Microcoded complex instructions only

    RISC designs favour simple, fixed-length instructions that pipeline well.

  7. 7

    What is spatial locality?

    • A

      Reusing the same data soon

    • Accessing data near recently accessed data

    • C

      Accessing data in random order

    • D

      Using only registers

    Array traversal is the standard example; cache blocks exploit it.

  8. 8

    A cache has hit time 1 ns, miss rate 5% and miss penalty 100 ns. What is the AMAT?

    • A

      5 ns

    • 6 ns

    • C

      101 ns

    • D

      1.05 ns

    1 + 0.05 x 100 = 6 ns.

  9. 9

    In the cache address diagram, which field is compared with the stored value to decide a hit?

    • Tag

    • B

      Index

    • C

      Offset

    • D

      Valid bit

    The index selects the line, then the stored tag is compared with the address tag.

  10. 10

    A 64 KB direct-mapped cache has 32-byte blocks. How many index bits does it use?

    • A

      10

    • 11

    • C

      12

    • D

      16

    64 KB / 32 B = 2048 lines = 2^11, so 11 index bits (offset is 5 bits).

  11. 11

    Which type of cache miss occurs on the very first access to a block?

    • A

      Conflict

    • B

      Capacity

    • Compulsory

    • D

      Coherence

    Compulsory (cold) misses cannot be avoided without prefetching.

  12. 12

    Which write policy updates memory only when a modified line is evicted?

    • A

      Write-through

    • Write-back

    • C

      No-write-allocate

    • D

      Write-around

    Write-back marks the line dirty and writes it later.

  13. 13

    Why does DRAM need refresh while SRAM does not?

    • DRAM stores bits as charge on leaky capacitors

    • B

      SRAM is slower

    • C

      DRAM has no transistors

    • D

      SRAM is non-volatile

    The capacitor charge decays, so rows are periodically read and rewritten.

  14. 14

    What does a TLB cache?

    • A

      Disk blocks

    • Recent virtual-to-physical page translations

    • C

      Branch targets

    • D

      Instructions

    It avoids a page-table memory access on most address translations.

  15. 15

    What is the page offset width for a 4 KiB page?

    • A

      10 bits

    • 12 bits

    • C

      14 bits

    • D

      16 bits

    4096 = 2^12.

  16. 16

    The diagram shows four disks with rotating parity blocks. How many disk failures can this RAID level survive?

    • A

      0

    • 1

    • C

      2

    • D

      4

    RAID 5 tolerates one failed disk by rebuilding from the remaining data and parity.

  17. 17

    With four 2 TB disks in RAID 5, what is the usable capacity?

    • A

      2 TB

    • B

      4 TB

    • 6 TB

    • D

      8 TB

    One disk's worth is used for parity: 3 x 2 = 6 TB.

  18. 18

    Which technique lets a device move data to memory without CPU involvement for each word?

    • A

      Polling

    • DMA

    • C

      Paging

    • D

      Pipelining

    A DMA controller transfers blocks and interrupts the CPU when done.

  19. 19

    Which Flynn class describes a GPU executing the same instruction on many data elements?

    • A

      SISD

    • SIMD

    • C

      MISD

    • D

      MIMD

    SIMD (or SIMT on GPUs) applies one instruction stream to many data items.

  20. 20

    The Moore's law chart uses a logarithmic axis. A straight line on it implies:

    • A

      Linear growth

    • Exponential growth

    • C

      No growth

    • D

      Random growth

    Constant doubling time gives a straight line on a log scale.

  21. 21

    Why did CPU designers move to multicore designs around 2005?

    • A

      Transistors stopped shrinking

    • Power and heat limited further clock-speed increases

    • C

      Memory became faster than CPUs

    • D

      Software no longer needed speed

    The power wall made higher frequencies impractical, so more cores were added instead.