Çip Zemin Planlama ve Tasarım Testinde Yapay Zeka

Testi çözdüğünüzde cevaplar ve açıklamalar görünür.

1. What physical decision does chip floorplanning or placement make?
   • Only the chip’s retail selling price
   • Only its package color
   • Only the company name on the box
   • Where circuit components occupy locations on the chip canvas
2. How should the cited paper’s report of competitive floorplans produced in hours be interpreted?
   • As a result for its studied setup, netlists and comparisons
   • As proof that every chip can be fully signed off in the same time
   • As a guarantee of global optimality for all circuits
   • As an architecture-independent law about every design tool
3. Yapay zeka yerleştirme sorununu nasıl çerçeveliyor?
   • Tek seferlik bir tahmin olarak
   • Sıralı bir karar olarak: bir bloğu yerleştirin, gözlemleyin ve ardından bir sonrakini yerleştirin
   • Yemek tarifi olarak
   • Elektronik tablo sıralaması olarak
4. Bir grafik sinir ağının öğrendiği 'netlist' nedir?
   • Ağ şifrelerinin listesi
   • Bir balık ağı tasarımı
   • Bileşenlerin grafiği ve nasıl bağlandıkları
   • İnternet yönlendirme tablosu
5. Which fast objective signals are documented by the cited Circuit Training project?
   • Proxy wirelength, congestion and density
   • A proof of all manufacturing and timing requirements
   • Only the product’s market price
   • Only a mandatory social-media popularity score
6. In Google’s cited 2020 method description, what places standard-cell clusters after the RL macro placements?
   • Only an unchanged alphabetical component sort
   • Only a user-interface screenshot
   • A guarantee that no standard cells remain
   • A force-directed procedure
7. For pins at (0,0),(4,0),(4,3), what is the half-perimeter wirelength estimate in coordinate units?
   • 14
   • 12
   • 7
   • 4
8. What does the documented can_place_node check evaluate for a proposed grid location?
   • Whether the entire chip is globally optimal
   • Whether the node can be placed there under relevant location constraints
   • Whether every final routed timing path passes signoff
   • Whether the model’s prediction is a factual-confidence probability