Skip to the selected question
ASIC.FYI

ASIC Interview Question Bank

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

Implement best-fit allocation

TechniquesAllocatorBest fitSelection policy
DifficultyMedium
TopicMemory Systems
LanguageSystemVerilog
Requirements4 checkpoints
01

Problem

Replace first-fit with best-fit: choose the smallest free range that can satisfy the request. Explain the one-line comparison change for worst-fit.

Four free-range capacities filtered against an allocation request before best-fit selection
Best-fit chooses the smallest eligible range; the chosen result is intentionally left for the exercise.
Function headerSystemVerilog
function bit alloc_best_fit(
  int unsigned size,
  output int unsigned addr
);

Example input and output

Use this case to check your interpretation
Input
free capacities=[64,24,40]; request size=20
Output
select the 24-byte range; leave a 4-byte remainder
Explanation

All ranges are sufficient, but 24 is the smallest capacity and therefore the best fit.

02

Requirements (4)

  • Inspect all sufficient ranges.
  • Select the minimum sufficient capacity.
  • Preserve exact-fit and partial-fit behavior.
  • Avoid signed sentinels for unsigned capacities.