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 Puzzle Bank
  • SystemVerilog Language Puzzles25
  • Difficulty Guide
  • Full Topic Map
  • Interview-Day Tips
  • OOP & Testbench Puzzles25
  • Concurrency & Timing Puzzles25
    • Event Scheduling Puzzles
    • Race Condition Puzzles
    • Clocking Block Puzzles
    • Semaphore & Mailbox Puzzles
    • Concurrency & Timing Puzzles: Tricky Q&A
  • Randomization & Constraint Puzzles25
  • SVA Assertion Puzzles25
  • Functional Coverage Puzzles25
  • Logic & Aptitude Puzzles25
  • Scenario & Debug Puzzles25
  • Interview Prep: Puzzle Rounds5
  • DV Puzzle Cheatsheet
Loading lesson

‹Concurrency & Timing Puzzles
  1. Topics
  2. DV Interview Puzzles
  3. Concurrency & Timing Puzzles
  4. Concurrency & Timing Puzzles: Tricky Q&A

VLSI DV Interview Puzzles · All levels

Concurrency & Timing Puzzles: Tricky Q&A

Rapid-fire interview Q&A for Concurrency & Timing Puzzles.

On this page

    Section Q&A

    Rapid-fire questions an interviewer asks around Concurrency & Timing Puzzles. Answer out loud, then check yourself.

    Q1. Why can an observed-region assertion still report old signal relationships after NBAs run?

    Answer: Because concurrent assertions sample in preponed. Observed-region evaluation uses those earlier sampled values, so it does not automatically reflect same-edge post-NBA state.

    Trap: Confusing evaluation region with sampling region.

    Q2. What is the real issue when two posedge processes write the same variable in active region?

    Answer: It is a scheduler race with undefined process ordering, so results are nondeterministic by language semantics. The robust fix is single-writer ownership with deterministic staging.

    Trap: Treating it as a seed problem instead of a race.

    Q3. In `input #1step output #0`, why is same-cycle monitor visibility often wrong?

    Answer: Input sampling occurs one step before the edge while output drive occurs at the edge. A flopped DUT response is therefore observed on a later sample, typically next cycle.

    Trap: Assuming all operations under `@(cb)` share one atomic instant.

    Q4. What deadlock pattern appears most in semaphore + mailbox testbench code?

    Answer: A thread holds semaphore ownership and then blocks on mailbox put/get while another thread needs that same semaphore to make mailbox progress. This circular wait hangs silently.

    Trap: Increasing mailbox depth without fixing lock hold scope.

    Previous

    79 / 210

    Next: Randomization & Constraint Puzzles

    Up next

    Up nextRandomization & Constraint Puzzles

    Sign in to save progress

    Practice this lessonReport an error

    See also

    • Event Scheduling Puzzles
    • Race Condition Puzzles
    • Clocking Block Puzzles