Skip to content
DenseChip
Learn
PracticeCode labInterview

DenseChip

Navigate

Menu

LearnPracticeCode labInterview

Tools

All toolsSV editorCode repoResume
DenseChip

Practice, courses, and chip-design tools in one focused workspace.

LearnPracticeCode labInterviewToolsLearning paths

© 2026 DenseChip

AboutContactPrivacyTerms
Skip to lesson

Course contents

  • How to Use This Course
  • Reading Path
  • Cache Coherency Glossary
  • The Shared Course Model
  • Cache Coherency Revision Sheet
  • Why Coherence Exists8
  • States and Protocols12
  • Transactions12
  • Races and Controller Design8
  • Progress and the Fabric16
  • Ordering and Synchronization12
  • Performance and Scalability12
  • Real Protocols12
  • SoC Integration12
  • Power, Clocking and Reliability12
  • Verification12
  • Debug and Bring-up12
  • Interview and Design Review17
    • Whiteboard Frameworks for Coherency
    • Staff-Level Design Reviews
    • Program Risk and Escalation Playbooks
    • Coherency Interview Q&A Bank
      • Fundamentals Q&A
      • Transactions and Races Q&A
      • Ordering Q&A
      • Verification and Debug Q&A
      • Architecture Q&A
  • Capstone: A Coherent Model Lab5
Loading lesson

‹Interview and Design Review
  1. Topics
  2. Cache Coherency
  3. Interview and Design Review
  4. Coherency Interview Q&A Bank

Part 13 · Interview and Design Review · All levels

Coherency Interview Q&A Bank

Fifty graded interview questions on coherence, each with a weak answer, a strong answer, follow-ups, a trap and the lesson that teaches it.

  • 5topics
  • 5lessons

This bank collects the questions interviewers and design reviewers actually ask about coherence, grouped by the Parts of the course that answer them. Each question has the same six fields: what the interviewer is testing, a weak answer, a strong answer that would score a 4, likely follow-ups, the common trap, and the lesson that teaches the mechanism. Strong answers use the course's four-step framework, Assumption, Mechanism, Trade-off, Evidence, and the course notation: acks collected at H, the course model of C0, C1, H and memory, and named protocols and specifications.

How to practise

Read only the question, cover the table and answer aloud or on paper in about two minutes. Then compare with the strong answer and grade yourself with the Grading Rubric. Where you missed a step, read the lesson in the "Taught in" row before trying the follow-ups. Repeat a lesson's questions a week later in a different order. The Answer Framework explains the four steps; the weak answers show the most common ways to lose marks, usually by skipping the assumption or the evidence.

Lesson

Questions

After it you can...

Fundamentals Q&A

10

State SWMR and the data-value invariant, compare MSI, MESI and MOESI, and choose between snooping and a directory.

Transactions and Races Q&A

10

Walk misses, upgrades, forwards and writebacks, and resolve the classic races with MSHRs, ack counting and credits.

Ordering Q&A

10

Separate coherence from consistency and give litmus verdicts, fence, acquire/release, atomic and LR/SC answers per named model.

Verification and Debug Q&A

10

Explain value checking, reference models, assertions, coverage of races and silicon triage.

Architecture Q&A

10

Argue directory scaling, LLC policy, NUMA, locks, real protocols, devices, power and RAS with numbers.

Suggested order: Fundamentals first, then Transactions and Races, since every later answer reuses their traces. Ordering, Verification and Debug, and Architecture can follow in any order; take them after the matching Parts of the course.

Check yourself An interviewer asks: "C1 sends GetS for X while C0 holds the line. Who supplies the data?" Why is there no single correct answer until you state an assumption?

Because the answer depends on the protocol and on C0's state. In settled MSI with C0 in S, memory is current and H answers from memory. In MESI with H recording exclusive(C0), H must send Fwd-GetS to C0 even if C0 is still a clean E, because H cannot tell E from M after a silent store. In MOESI with C0 in O, C0 is the dirty-responsible holder and supplies it while memory stays stale. Whether the data then goes through H or straight to C1 is a further choice (four-hop or three-hop). A strong answer names these assumptions first.

Related topics

  • Shared course model

  • Revision sheet

  • The answer framework

  • Grading rubric

PreviousNext: Fundamentals Q&A

Up next

Up nextFundamentals Q&A

Sign in to save progress

Practice this lessonReport an error

See also

  • Whiteboard Frameworks for Coherency
  • Staff-Level Design Reviews
  • Program Risk and Escalation Playbooks