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

AboutRoadmapCareersInternshipsFAQContactPrivacyTerms
Skip to lesson

Course contents

  • How to Use This Puzzle Bank
  • SystemVerilog Language Puzzles25
  • Difficulty Guide
  • Full Topic Map
  • Interview-Day Tips
  • Study Route: One Week Before the Interview
  • Study Route: Two Weeks
  • Study Route: Four Weeks (Full Course)4
  • OOP & Testbench Puzzles25
  • Concurrency & Timing Puzzles25
  • Randomization & Constraint Puzzles25
  • SVA Assertion Puzzles25
  • Functional Coverage Puzzles25
    • Covergroup and Coverpoint Puzzles
    • Cross Coverage Puzzles
      • Named cross bins that group tuples
      • Pure auto cross count
      • Explicit ignore_bins instead of a default catch-all
      • intersect filter removes one tuple
      • illegal cross tuple does not close coverage
      • Three-way cross with overlapping ignore_bins
    • Coverage Options Puzzles
    • Coverage Closure and Sampling Timing Puzzles
    • Functional Coverage Puzzles: Tricky Q&A
  • Logic & Aptitude Puzzles25
  • Scenario & Debug Puzzles25
  • UVM Testbench Puzzles25
  • Clock, Reset & CDC Puzzles25
  • Bus and Interface Protocol Puzzles25
  • Interview Prep: Puzzle Rounds7
  • DV Puzzle Cheatsheet
Loading lesson

←Cross Coverage Puzzles
  1. Topics
  2. DV Interview Puzzles
  3. Functional Coverage Puzzles
  4. Cross Coverage Puzzles
  5. Named cross bins that group tuples
On this page

    VLSI DV Interview PuzzlesAll levels

    Named cross bins that group tuples

    The six cross products (2 lengths x 3 bursts) are each selected by exactly one of the three named cross bins, so no automatic bins are left over. How many cross bins are scored, and what is the cross coverage? Options: none set (all defaults: at_least = 1, weight = 1, auto_bin_max = 64).

    Puzzle

    Difficulty: Medium · Puzzle 1 of 6 · Topic: Cross Coverage Puzzles

    The six cross products (2 lengths x 3 bursts) are each selected by exactly one of the three named cross bins, so no automatic bins are left over. How many cross bins are scored, and what is the cross coverage? Options: none set (all defaults: at_least = 1, weight = 1, auto_bin_max = 64).

    Code

    design.sv
    1
    2
    3
    4
    5
    6
    7
    8
    9
    10
    11
    12
    13
    14
    15
    16
    17
    18
    19
    20
    21
    22
    23
    24
    25
    covergroup cg with function sample(bit [2:0] len, bit [1:0] burst);
      cp_len: coverpoint len {
        bins short = {[0:3]};
        bins long  = {[4:7]};
      }
    
      cp_burst: coverpoint burst {
        bins incr  = {0};
        bins wrap  = {1};
        bins fixed = {2};
      }
    
      x_len_burst: cross cp_len, cp_burst {
        bins short_any  = binsof(cp_len.short);
        bins long_incr  = binsof(cp_len.long) && binsof(cp_burst.incr);
        bins long_other = binsof(cp_len.long) && (binsof(cp_burst.wrap) || binsof(cp_burst.fixed));
      }
    endgroup
    
    initial begin
      cg c = new();
      c.sample(1,0);
      c.sample(7,1);
      c.sample(5,2);
    end

    Hint

    A user-defined cross bin is one bin, however many tuples its select expression covers. Map each sample to its bin.

    Step-by-step solution

    Diagram
    1) short_any selects (short,incr), (short,wrap), (short,fixed); long_incr selects 1 tuple; long_other selects (long,wrap), (long,fixed). Together they cover all 6 tuples exactly once, so the scored denominator is the 3 named bins.
    2) sample(1,0) is short + incr -> short_any.
    3) sample(7,1) is long + wrap -> long_other.
    4) sample(5,2) is long + fixed -> long_other again.
    5) Hit bins = short_any and long_other = 2 of 3 -> 66.67%.

    Answer

    Answer: 3 cross bins are scored; 2 are hit (short_any, long_other), so cross coverage is 66.67%.

    How this was checked

    Checked by running a model of the rule in a Python model. A model of the cross rule: three named bins cover all six tuples, and two of them are hit.

    Why candidates get it wrong

    A named cross bin counts once however many tuples it groups. Counting the 3 distinct tuples hit out of 6 gives 50%, which is wrong here; (7,1) and (5,2) are two tuples but the same bin long_other.

    Interviewer follow-up

    Which single further sample closes this cross? Model answer: Any long length with the incr burst, for example sample(4,0): it hits long_incr, so 3 of 3 bins are hit = 100%.

    Say it out loud

    I would count the named cross bins, not the tuples. Three named bins cover all six products, so three bins are scored, and two are hit, short_any and long_other, giving 66.67 percent. A named cross bin counts once however many tuples it groups. The trap is counting three distinct tuples out of six and saying 50 percent, so I would check which bin each tuple falls into.

    Related topics

    • binsof & intersect

    • Cross Basics

    • Back to Cross Coverage Puzzles

    • Functional Coverage Puzzles section

    Previous

    142 / 293

    Next: Pure auto cross count

    Up next

    Up nextPure auto cross count

    Sign in to save progress

    Practice this lessonPrevious lessonReport an error

    See also

    • Explicit ignore_bins instead of a default catch-all
    • intersect filter removes one tuple
    • illegal cross tuple does not close coverage