Bonus

Most modern datacenter fabrics utilize this topology’s two-tier spine-leaf architecture. For 10 points each:
[10h] Give this network topology named for an American, who originally developed it for telephone networks. This topology typically implements crossbars in three layers parametrized by n, m, and r.
ANSWER: Clos (“cloh”) network [or Clos topology]
[10m] One proof that the Clos network is rearrangeably nonblocking relies on Hall’s theorem, which guarantees perfect matchings in graphs with this property. Graphs with this property contain no odd-length cycles.
ANSWER: bipartite graph [or bipartiteness]
[10e] One-sided “folded” Clos networks are also named for “fat” examples of these structures. Loop-free Ethernet protocols are guaranteed by a protocol named for the “spanning” type of these structures.
ANSWER: trees [accept fat tree network; accept spanning tree protocol; accept minimum spanning trees; prompt on STP; prompt on MST]
<Other Science>
Answerlines and category may not exactly match the version played at all sites

Back to bonuses

Conversion

TeamOpponentPart 1Part 2Part 3TotalParts
Arizona StateToronto A0101020ME
British ColumbiaWUSTL B001010E
Chicago AColumbia A0101020ME
Georgia TechTexas0101020ME
Illinois BIowa State001010E
IndianaMIT0101020ME
Johns HopkinsStanford0101020ME
LSEMaryland001010E
NYUIllinois A0101020ME
NorthwesternGeorgia State001010E
Ohio StateVirginia Tech001010E
OttawaHarvard001010E
Penn StateVirginia001010E
RutgersRIT001010E
Toronto BMichigan001010E
Toronto CChicago B0101020ME
UC Berkeley ANorth Carolina B0101020ME
UC Berkeley BUCF0101020ME
WUSTL AFlorida001010E
Waterloo AVanderbilt0101020ME
Waterloo BColumbia B0101020ME
Winona StateMinnesota001010E

Summary

TournamentExact Match?HeardPPBEasy %Medium %Hard %
2025 ACF NationalsYes2215.00100%50%0%