Graaf-ci-Xalaat Quiz Xalaatal

Sooy def quiz bi, tontu yi ak leeral yi dañuy feeñ.

1. Lan mooy wuute gi am ci digganté Graph-of-Thoughts ak Arbre-de-Pensées?
   • GoT dafay may xalaat yi ñu boole seen bopp, baña yam ci benn waajur
   • GoT dindi na bépp jéego buy xalaat
   • GoT benn xalaat kese lay dox
   • GoT mënul jàngat xalaat yi
2. Ci Graaf-de-Pensée, lan la 'agrégation' bi di def?
   • Dafay efaase bépp xalaat
   • Dafay boole xalaat yu bari ci benn pexe
   • Tekki xalaat ci beneen làkk
   • Dafay taxawal xalaat bi
3. Lan mooy 'setal' ci graf GoT?
   • jafe-jafe bu bees bu amul benn lëkkaloo
   • Dindi fonction poñ yi
   • Self-loop buy xoolaat ak gëna suqali xalaat
   • Tontu bu mujj
4. Lan moo waral Graph-of-Thoughts méngoo bu baax ak liggéey bu melni tànnal lim bu gudd?
   • Ndax tànn bi soxlawul xalaat
   • Ndax dafay tere boole ay resultaa
   • Ndax ay nimero yu benn rek lay jëfandikoo
   • Ndax mën na xaaj limu mbir yi, tànnal piyees yi seen bopp, ba noppi boole leen
5. Yan mbir ñooy doxal ab Graph-of-Thought?
   • Regulatër, graf-of-of-operations, ak modulu poñ/rang
   • Benn laaj kese te amul benn jumtukaay
   • ab loxo robot physique
   • këyitu xayma
6. Sunu sukkandikoo ci bindkati GoT, naka la ko méngale ak Garab-ci-Xalaat ci tànneef?
   • Dafa gënoon bon ci bepp metric
   • Dafa yokk kalite tànneef yi ci noonu la wàññi njëg yi
   • génnewul benn produit
   • Ci nataal rek lay dox
7. Why can a graph represent a shared subproblem more directly than a strict tree?
   • A tree permits unlimited cycles by definition
   • A graph has no intermediate thoughts
   • A thought node can have dependencies from multiple prior thoughts
   • A graph removes the need to score candidates
8. In the GoT controller, what does the graph-of-operations schedule specify?
   • The hardware clock speed
   • The model’s training corpus
   • The user’s vector database schema
   • Which generation, aggregation or refinement transformations run and in what order