FIFO sizing and flag timing, Gray-coded asynchronous pointers, round-robin fairness, credit-based flow control and circular-wait deadlock.
1. Sizing a FIFO for a Rate Mismatch Burst [Easy]
2. Empty and Full With Simultaneous Read and Write [Easy]
3. Full and Empty From Gray-Coded Pointers [Hard]
4. Round-Robin Grants and the Starved Requester [Medium]
5. Credit Window vs Round-Trip Time [Medium]
6. Circular Wait Between Two Full Queues [Hard]Work each puzzle before reading the solution: predict the exact output or answer, name the rule that governs it, then check yourself.
VLSI DV INTERVIEW PUZZLES OVERVIEW (fallback)
puzzle prompt
|
v
requirements decode --> constraints/assumptions --> solve strategy
| | |
| v v
+------------------> corner cases ---------> final answer
|
v
explain trade-offs
Use section visuals when available; fallback preserves reasoning flow.