Classes and data structures

Handles, copies, queues and associative arrays: SystemVerilog's object and container semantics.

• The flush that leaves some behind (Queues · Easy · about 10 min)
• The tag that never reaches the wire (Polymorphism · Easy · about 10 min)
• Every packet is packet number 0 (Static members · Easy · about 10 min)
• The histogram walk that skips the first address (Associative arrays · Easy · about 10 min)
• The helper that drains a copy (Argument passing · Easy · about 10 min)
• The cast that keeps the last write (Casting · Easy · about 10 min)
• The constructor that assigns a field to itself (Constructors · Easy · about 10 min)
• The copy that shares its header (Classes · Medium · about 15 min)

Posedge Daily posts two hardware interview questions every day at midnight Eastern: one RTL design question and one verification question. You write SystemVerilog in the browser, run it on Verilator or Icarus Verilog, read the waveform, and see which hidden tests pass. It covers SVA, constrained random and UVM, and it is free.