Skip to the selected question
ASIC.FYI

ASIC Question Bank

1,000+ hardware interview questions
Question bank1050 results
  1. Easy
  2. Medium
  3. Medium
  4. Easy
  5. Easy
  6. Easy
  7. Easy
  8. Easy
  9. Easy
  10. Easy
  11. Medium
  12. Medium
  13. Hard
  14. Hard
  15. Medium
  16. Medium
  17. Medium
  18. Medium
  19. Medium
  20. Easy
  21. Medium
  22. Easy
  23. Hard
  24. Medium
  25. Hard
  26. Medium
  27. Hard
  28. Medium
  29. Easy
  30. Medium
  31. Medium
  32. Hard
  33. Hard
  34. Medium
  35. Hard
  36. Easy
  37. Medium
  38. Medium
  39. Medium
  40. Hard
  41. Medium
  42. Easy
  43. Medium
  44. Easy
  45. Medium
  46. Medium
  47. Medium
  48. Medium
  49. Medium
  50. Medium
DescriptionQ487
Q487DVASIC interview problem

Constrain exactly one duplicated nonadjacent pair

TechniquesSystemVerilogRelational constraintsExact duplicates
DifficultyHard
TopicConstraints
LanguageSystemVerilog
Requirements4 checkpoints
01

Problem

Constrain ten integers so exactly one value occurs twice, the duplicate positions are nonadjacent, and every other value occurs once.

Starting declarationSystemVerilog
rand int a[10];
rand int p, q;

Example input and output

Use this case to check your interpretation
Input
a = {7,1,2,7,3,4,5,6,8,9}, p = 0, q = 3
Output
legal: exactly one repeated value (7) at nonadjacent positions 0 and 3
Explanation

Only value 7 repeats, its positions differ by three, and all remaining values are pairwise distinct.

02

Requirements (4)

  • Constrain 0 <= p < q < 10 and q - p > 1.
  • Require a[p] == a[q].
  • Require every other index pair to differ.
  • Bound all ten values to the inclusive range 0 through 99.