Packet 3: Tossup 3

Graphs named in analogy to these objects are used to visualize hierarchical clustering. Bootstrap aggregating of these structures is used in a machine learning method named (15[1])for “random” (15[1])places (15[1]-5[1])where they’re abundant. (15[4])For a weighted (15[1])undirected graph, (15[1])Prim’s algorithm (-5[1])finds a (*) “minimum (10[1])spanning” (10[1])structure (10[2])named (10[3])for (10[1])these (10[1])objects. (10[4])These objects name (10[1])a structure that, if balanced, can be searched in logarithmic time. (10[2])Types of a structure named for (10[1])these objects include AVL, (10[1])red-black, and a binary (10[2])search type. (10[2])For 10 points, (10[2])a branching (10[1])data structure named for what (10[2])objects may (10[1])have “root nodes” and “leaves?” ■END■ (10[2])

Back to tossups

Buzzes

Summary