Skip to the selected question
ASIC.FYI

ASIC Question Bank

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

Verify a dominant-opcode window analyzer

TechniquesDVWindow searchHistogramTie-breakingOut-of-order
DifficultyMedium
TopicReference Models
LanguageSystemVerilog
Requirements5 checkpoints
01

Problem

Write an exhaustive oracle for the longest opcode window convertible to one of eight classes with at most k replacements, breaking ties by lowest start and then lowest opcode.

Example input and output

Use this case to check your interpretation
Input
opcodes=[1,2,1,1,3]; k=1
Output
best_length=4; start=0; target_opcode=1
Explanation

Window [1,2,1,1] becomes all opcode 1 with one replacement; extending through opcode 3 would require two.

02

Requirements (5)

  • Enumerate every window and all eight target opcodes in an independent oracle; empty input returns zero result fields.
  • Apply the comparison order length, then start, then opcode, and flag k greater than count as a bad request.
  • Explain dominant, balanced, alternating, long-run, exact-k, multiple-start, and multiple-opcode cases as targeted stimulus.
  • Return the complete result record for a later ID-keyed scoreboard; response ordering and reset epochs are follow-up architecture.
  • Identify feasibility, length, start, opcode, entropy, and tie type as separate diagnostic or coverage dimensions.