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

  • RTL Foundations36
  • Combinational Design25
  • Sequential Design27
  • FSM & Control27
  • Timing & Clocking39
  • Reset & CDC34
  • Memory & Buses57
  • Advanced RTL28
  • Senior & Interview76
    • Low-Power RTL Hub
    • DFT and Scan Hub
    • Physical Awareness Hub
    • Waveform Debug Hub
    • STA and ECO Hub
    • RTL-to-Implementation Closure
    • DFT-Ready RTL
    • Capstone: Resilient Streaming Peripheral
    • Principal Design Review
    • Senior RTL Interview Questions & Model Answers
      • Interview: Combinational and Arithmetic
      • Interview: Sequential and Pipelines
        • Blocking vs non-blocking: the race demo
        • Pipeline latency vs throughput
        • Stalling without deadlock
        • Enables, resets and counters
      • Interview: FSM and Control
      • Interview: Timing and STA
      • Interview: CDC and Reset
      • Interview: Memories and Buses
      • Interview: Low-Power Design
      • Interview: Debug and ECO
      • Interview: Coding and Whiteboard
  • Glossary and Notation
Loading lesson

‹Senior RTL Interview Questions & Model Answers
  1. Topics
  2. RTL Design
  3. Senior & Interview
  4. Senior RTL Interview Questions & Model Answers
  5. Interview: Sequential and Pipelines

Part 9 · Senior · Senior

Interview: Sequential and Pipelines

Blocking vs non-blocking, pipeline latency and stalls, and enable and reset discipline, as interview answers.

  • 4topics
  • 4lessons

Topics in this section

  1. 1Blocking vs non-blocking: the race demo1 lesson
  2. 2Pipeline latency vs throughput1 lesson
  3. 3Stalling without deadlock1 lesson
  4. 4Enables, resets and counters1 lesson
On this page

    Sequential interview questions test one habit: reasoning cycle by cycle. Each lesson supplies a model answer and finite functional checks under explicit edge and peer-progress assumptions.

    Question

    Skill under test

    Blocking vs non-blocking assignments

    Simulation semantics and race discipline in clocked logic.

    Pipeline latency vs throughput

    Naming the two numbers correctly and measuring both.

    Stalling without deadlock

    Valid/ready backpressure that holds data and always makes progress.

    Enables, resets and counters

    Control priority, wrap behaviour and reset style.

    Lessons in this topic

    4 lessons, about 19 min

    1. 1Blocking vs non-blocking: the race demoYou can predict the output of blocking and non-blocking shift pairs cycle by cycle, and explain the rule through the scheduling regions.5 min
    2. 2Pipeline latency vs throughputYou can state latency in cycles per item and throughput in items per cycle, and say what an extra stage changes.5 min
    3. 3Stalling without deadlockYou can draw a one-deep stage with in_ready = !full || out_ready, and argue why it holds every item and cannot deadlock.5 min
    4. 4Enables, resets and countersYou can write a counter with reset, load and enable in a documented priority, place terminal count correctly, and justify the reset style.4 min
    Check yourself A candidate says a deeper pipeline made the design faster but the first result arrives later. Is that a contradiction?

    No. Throughput rose (more results per second) while latency grew (more cycles per result). Lesson two measures both numbers on the same pipeline.

    Interview

    The strongest sequential answers end with a check: a waveform, a cycle count, or a testbench result. Every lesson here does exactly that.

    Revision sheet

    The whole topic on one page, taken from each lesson's Remember box. Read it before an interview, or print it.

    Blocking vs non-blocking: the race demo

    • An NBA evaluates its right side now and updates the destination later, so registers read old state.

    • Blocking assignments in clocked logic make the hardware depend on statement order.

    • Drive testbench inputs away from the accepting edge and observe after NBA.

    Rule of thumb: non-blocking in clocked blocks, blocking in combinational blocks, and say why.

    Pipeline latency vs throughput

    • An extra stage adds one cycle of latency and one rank of registers; steady-state throughput stays flat.

    • The clock can rise if the cut stage was critical, which is the only gain.

    • A feedback loop, such as an accumulator, cannot overlap iterations, so more stages do not help.

    Rule of thumb: give both numbers with units, then say which one the change moved.

    Stalling without deadlock

    • A stalled item keeps valid high and its data flat; a bubble is an empty slot with valid low.

    • The stage accepts whenever it is empty and empties whenever downstream is ready.

    • Valid must never wait for ready, and a long chain needs a registered-ready skid buffer.

    Rule of thumb: every accepted item must leave as exactly one delivered item.

    Enables, resets and counters

    • Priority is reset, then load, then enable; load and enable together loads.

    • Terminal count is high while the last value is present, not on the wrap itself.

    • Reset only the control state; datapath registers written before use need none.

    Rule of thumb: keep the clock free-running and gate the data update with the enable.

    Practise it

    • Mini project: the capstone: a resilient streaming peripheral, stage by stage

    • Practice question: Blocking vs non-blocking in sequential logic

    • Practice question: Two-stage valid/ready pipeline: throughput vs latency and backpressure

    • Practice question: Three-stage pipeline with stall, bubble and flush control

    • Code lab: Pipeline stall logic

    • Code lab: Counter with load

    • Interview: run a mock interview on this topic

    How this was checked

    The benches were executed with Icarus Verilog 13.0 (2026-10-16) and print PASS.

    PreviousNext: Blocking vs non-blocking: the race demo

    Up next

    Up nextBlocking vs non-blocking: the race demo

    Sign in to save progress

    Practice this lessonReport an error

    See also

    • Interview: Combinational and Arithmetic
    • Interview: FSM and Control
    • Interview: Timing and STA