27 real RTL Design (Verilog / SystemVerilog) questions from the VLSI Design bank, as asked in Indian campus drives and tech interviews. Every question has a verified answer and an AI-tutor explanation on placd — free to start.
1. What is Blocking versus non-blocking assignment?
Junior
A.= executes in order within a block and models combinational logic; <= schedules all updates at the end of the time step and models flip-flops, and mixing them causes simulation races
B.SystemVerilog procedural blocks that declare designer intent so synthesis and lint flag a latch inferred in a combinational block or a missing clock in a sequential one
C.unintended level-sensitive storage synthesised when a combinational block leaves a signal unassigned on some path, avoided by default assignments or full case coverage
D.state encoding with one flip-flop per state, using more registers than binary but faster next-state logic and trivial decoding, preferred on FPGAs with abundant flops
2. Which term means: "= executes in order within a block and models combinational logic; <= schedules all updates at the end of the time step and models flip-flops, and mixing them causes simulation races"?
A.Blocking versus non-blocking assignment — design written with parameter, localparam and generate blocks so widths and depths are chosen at instantiation, enabling reuse without editing the source
B.Blocking versus non-blocking assignment — unintended level-sensitive storage synthesised when a combinational block leaves a signal unassigned on some path, avoided by default assignments or full case coverage
C.Blocking versus non-blocking assignment — SystemVerilog procedural blocks that declare designer intent so synthesis and lint flag a latch inferred in a combinational block or a missing clock in a sequential one
D.Blocking versus non-blocking assignment — = executes in order within a block and models combinational logic; <= schedules all updates at the end of the time step and models flip-flops, and mixing them causes simulation races
A.minimum entries to absorb a rate mismatch: for a write burst of B words drained at fr while written at fw, depth ≈ B × (1 − fr/fw), rounded up with margin for read latency
B.design written with parameter, localparam and generate blocks so widths and depths are chosen at instantiation, enabling reuse without editing the source
C.unintended level-sensitive storage synthesised when a combinational block leaves a signal unassigned on some path, avoided by default assignments or full case coverage
D.state encoding with one flip-flop per state, using more registers than binary but faster next-state logic and trivial decoding, preferred on FPGAs with abundant flops
5. Which term means: "unintended level-sensitive storage synthesised when a combinational block leaves a signal unassigned on some path, avoided by default assignments or full case coverage"?
A.Inferred latch — design written with parameter, localparam and generate blocks so widths and depths are chosen at instantiation, enabling reuse without editing the source
B.Inferred latch — state encoding with one flip-flop per state, using more registers than binary but faster next-state logic and trivial decoding, preferred on FPGAs with abundant flops
C.Inferred latch — unintended level-sensitive storage synthesised when a combinational block leaves a signal unassigned on some path, avoided by default assignments or full case coverage
D.Inferred latch — inserting registers to split a long combinational path into stages, raising clock frequency and throughput at the cost of latency and register area
A.= executes in order within a block and models combinational logic; <= schedules all updates at the end of the time step and models flip-flops, and mixing them causes simulation races
B.minimum entries to absorb a rate mismatch: for a write burst of B words drained at fr while written at fw, depth ≈ B × (1 − fr/fw), rounded up with margin for read latency
C.transfer of a signal between unrelated clocks, needing a two-flop synchroniser for single bits, Gray-coded pointers for FIFOs and request-acknowledge handshakes for multi-bit data
D.synchronous reset is sampled at the clock edge and needs a running clock; asynchronous reset acts immediately but must be de-asserted synchronously to avoid recovery violations
8. Which term means: "synchronous reset is sampled at the clock edge and needs a running clock; asynchronous reset acts immediately but must be de-asserted synchronously to avoid recovery violations"?
A.Synchronous versus asynchronous reset — minimum entries to absorb a rate mismatch: for a write burst of B words drained at fr while written at fw, depth ≈ B × (1 − fr/fw), rounded up with margin for read latency
B.Synchronous versus asynchronous reset — synchronous reset is sampled at the clock edge and needs a running clock; asynchronous reset acts immediately but must be de-asserted synchronously to avoid recovery violations
C.Synchronous versus asynchronous reset — unintended level-sensitive storage synthesised when a combinational block leaves a signal unassigned on some path, avoided by default assignments or full case coverage
D.Synchronous versus asynchronous reset — = executes in order within a block and models combinational logic; <= schedules all updates at the end of the time step and models flip-flops, and mixing them causes simulation races
A.state encoding with one flip-flop per state, using more registers than binary but faster next-state logic and trivial decoding, preferred on FPGAs with abundant flops
B.= executes in order within a block and models combinational logic; <= schedules all updates at the end of the time step and models flip-flops, and mixing them causes simulation races
C.transfer of a signal between unrelated clocks, needing a two-flop synchroniser for single bits, Gray-coded pointers for FIFOs and request-acknowledge handshakes for multi-bit data
D.minimum entries to absorb a rate mismatch: for a write burst of B words drained at fr while written at fw, depth ≈ B × (1 − fr/fw), rounded up with margin for read latency
11. Which term means: "state encoding with one flip-flop per state, using more registers than binary but faster next-state logic and trivial decoding, preferred on FPGAs with abundant flops"?
A.One-hot FSM encoding — unintended level-sensitive storage synthesised when a combinational block leaves a signal unassigned on some path, avoided by default assignments or full case coverage
B.One-hot FSM encoding — state encoding with one flip-flop per state, using more registers than binary but faster next-state logic and trivial decoding, preferred on FPGAs with abundant flops
C.One-hot FSM encoding — design written with parameter, localparam and generate blocks so widths and depths are chosen at instantiation, enabling reuse without editing the source
D.One-hot FSM encoding — synchronous reset is sampled at the clock edge and needs a running clock; asynchronous reset acts immediately but must be de-asserted synchronously to avoid recovery violations
A.= executes in order within a block and models combinational logic; <= schedules all updates at the end of the time step and models flip-flops, and mixing them causes simulation races
B.synchronous reset is sampled at the clock edge and needs a running clock; asynchronous reset acts immediately but must be de-asserted synchronously to avoid recovery violations
C.minimum entries to absorb a rate mismatch: for a write burst of B words drained at fr while written at fw, depth ≈ B × (1 − fr/fw), rounded up with margin for read latency
D.design written with parameter, localparam and generate blocks so widths and depths are chosen at instantiation, enabling reuse without editing the source
14. Which term means: "design written with parameter, localparam and generate blocks so widths and depths are chosen at instantiation, enabling reuse without editing the source"?
A.Parameterised module — transfer of a signal between unrelated clocks, needing a two-flop synchroniser for single bits, Gray-coded pointers for FIFOs and request-acknowledge handshakes for multi-bit data
B.Parameterised module — SystemVerilog procedural blocks that declare designer intent so synthesis and lint flag a latch inferred in a combinational block or a missing clock in a sequential one
C.Parameterised module — design written with parameter, localparam and generate blocks so widths and depths are chosen at instantiation, enabling reuse without editing the source
D.Parameterised module — minimum entries to absorb a rate mismatch: for a write burst of B words drained at fr while written at fw, depth ≈ B × (1 − fr/fw), rounded up with margin for read latency
A.synchronous reset is sampled at the clock edge and needs a running clock; asynchronous reset acts immediately but must be de-asserted synchronously to avoid recovery violations
B.transfer of a signal between unrelated clocks, needing a two-flop synchroniser for single bits, Gray-coded pointers for FIFOs and request-acknowledge handshakes for multi-bit data
C.SystemVerilog procedural blocks that declare designer intent so synthesis and lint flag a latch inferred in a combinational block or a missing clock in a sequential one
D.inserting registers to split a long combinational path into stages, raising clock frequency and throughput at the cost of latency and register area
17. Which term means: "inserting registers to split a long combinational path into stages, raising clock frequency and throughput at the cost of latency and register area"?
A.Pipelining — synchronous reset is sampled at the clock edge and needs a running clock; asynchronous reset acts immediately but must be de-asserted synchronously to avoid recovery violations
B.Pipelining — SystemVerilog procedural blocks that declare designer intent so synthesis and lint flag a latch inferred in a combinational block or a missing clock in a sequential one
C.Pipelining — unintended level-sensitive storage synthesised when a combinational block leaves a signal unassigned on some path, avoided by default assignments or full case coverage
D.Pipelining — inserting registers to split a long combinational path into stages, raising clock frequency and throughput at the cost of latency and register area
A.design written with parameter, localparam and generate blocks so widths and depths are chosen at instantiation, enabling reuse without editing the source
B.= executes in order within a block and models combinational logic; <= schedules all updates at the end of the time step and models flip-flops, and mixing them causes simulation races
C.minimum entries to absorb a rate mismatch: for a write burst of B words drained at fr while written at fw, depth ≈ B × (1 − fr/fw), rounded up with margin for read latency
D.SystemVerilog procedural blocks that declare designer intent so synthesis and lint flag a latch inferred in a combinational block or a missing clock in a sequential one
20. Which term means: "SystemVerilog procedural blocks that declare designer intent so synthesis and lint flag a latch inferred in a combinational block or a missing clock in a sequential one"?
A.always_ff and always_comb — SystemVerilog procedural blocks that declare designer intent so synthesis and lint flag a latch inferred in a combinational block or a missing clock in a sequential one
B.always_ff and always_comb — synchronous reset is sampled at the clock edge and needs a running clock; asynchronous reset acts immediately but must be de-asserted synchronously to avoid recovery violations
C.always_ff and always_comb — transfer of a signal between unrelated clocks, needing a two-flop synchroniser for single bits, Gray-coded pointers for FIFOs and request-acknowledge handshakes for multi-bit data
D.always_ff and always_comb — = executes in order within a block and models combinational logic; <= schedules all updates at the end of the time step and models flip-flops, and mixing them causes simulation races
A.state encoding with one flip-flop per state, using more registers than binary but faster next-state logic and trivial decoding, preferred on FPGAs with abundant flops
B.unintended level-sensitive storage synthesised when a combinational block leaves a signal unassigned on some path, avoided by default assignments or full case coverage
C.= executes in order within a block and models combinational logic; <= schedules all updates at the end of the time step and models flip-flops, and mixing them causes simulation races
D.minimum entries to absorb a rate mismatch: for a write burst of B words drained at fr while written at fw, depth ≈ B × (1 − fr/fw), rounded up with margin for read latency
23. Which term means: "minimum entries to absorb a rate mismatch: for a write burst of B words drained at fr while written at fw, depth ≈ B × (1 − fr/fw), rounded up with margin for read latency"?
A.FIFO depth calculation — design written with parameter, localparam and generate blocks so widths and depths are chosen at instantiation, enabling reuse without editing the source
B.FIFO depth calculation — = executes in order within a block and models combinational logic; <= schedules all updates at the end of the time step and models flip-flops, and mixing them causes simulation races
C.FIFO depth calculation — minimum entries to absorb a rate mismatch: for a write burst of B words drained at fr while written at fw, depth ≈ B × (1 − fr/fw), rounded up with margin for read latency
D.FIFO depth calculation — inserting registers to split a long combinational path into stages, raising clock frequency and throughput at the cost of latency and register area
A.synchronous reset is sampled at the clock edge and needs a running clock; asynchronous reset acts immediately but must be de-asserted synchronously to avoid recovery violations
B.= executes in order within a block and models combinational logic; <= schedules all updates at the end of the time step and models flip-flops, and mixing them causes simulation races
C.transfer of a signal between unrelated clocks, needing a two-flop synchroniser for single bits, Gray-coded pointers for FIFOs and request-acknowledge handshakes for multi-bit data
D.inserting registers to split a long combinational path into stages, raising clock frequency and throughput at the cost of latency and register area
26. Which term means: "transfer of a signal between unrelated clocks, needing a two-flop synchroniser for single bits, Gray-coded pointers for FIFOs and request-acknowledge handshakes for multi-bit data"?
A.Clock domain crossing — minimum entries to absorb a rate mismatch: for a write burst of B words drained at fr while written at fw, depth ≈ B × (1 − fr/fw), rounded up with margin for read latency
B.Clock domain crossing — inserting registers to split a long combinational path into stages, raising clock frequency and throughput at the cost of latency and register area
C.Clock domain crossing — transfer of a signal between unrelated clocks, needing a two-flop synchroniser for single bits, Gray-coded pointers for FIFOs and request-acknowledge handshakes for multi-bit data
D.Clock domain crossing — design written with parameter, localparam and generate blocks so widths and depths are chosen at instantiation, enabling reuse without editing the source
Answers, AI explanations, and a free readiness check
Sign up free to check your answers with explanations, ask the AI tutor anything on any question, and take the free 2-minute readiness check for a scored result. The full AI mock interview, scored like a real panel, unlocks with Pro.