AQR Fall Final Review

Front

What is the method of markers in dividing items among players?

Back

The method of markers is a technique used to allocate items among players where each player places markers to indicate their preferred items, and items are distributed based on these markers.

Front

Who is the Plurality candidate in an election?

Back

The Plurality candidate is the candidate who receives the most first-place votes in an election, regardless of whether they achieve a majority of the votes.

Front

What is Kruskal's Algorithm used for?

Back

Kruskal's Algorithm is used to find the Minimum Spanning Tree (MST) of a graph, which connects all vertices with the minimum total edge weight.

Front

How many edges are in a tree with 32 vertices?

Back

A tree with n vertices has exactly n-1 edges. Therefore, a tree with 32 vertices has 31 edges.

Front

What is a Fermi Estimate?

Back

A Fermi Estimate is a rough approximation made using known values and logical reasoning to arrive at an answer for a complex question.

Front

If a person breathes 10 times per minute, how many breaths do they take in a day?

Back

A person takes 10 breaths/minute * 60 minutes/hour * 24 hours/day = 14,400 breaths in a day.

Front

How much air does someone breathe in each day if it takes 5 breaths to breathe 1 liter of air?

Back

If a person takes 14,400 breaths in a day, they breathe in 14,400 breaths / 5 breaths/liter = 2,880 liters of air per day.

Front

What is the significance of the edge BC in a Minimum Spanning Tree?

Back

The edge BC must be included in the Minimum Spanning Tree as it is the edge with the least weight that connects two vertices without forming a cycle.

Front

Define a tree in graph theory.

Back

A tree is a connected graph with no cycles, where any two vertices are connected by exactly one path.

Front

What is the difference between a tree and a forest in graph theory?

Back

A tree is a single connected graph with no cycles, while a forest is a disjoint set of trees.