You want to visit the following five cities by car, starting and ending at Austin, TX and must return there at the end. Austin, TX Bismarck, ND Columbus, OH Dover, DE Erie, PA The driving times by car  (in hours) to get between each pair are summarized in the table below. Austin Bismarck Columbus Dover Erie Austin — 21 18 25 22 Bismarck 21 — 17 24 19 Columbus 18 17 — 8 4 Dover 25 24 8 — 7 Erie 22 19 4 7 — Determine the circuit that results from following the Nearest Neighbor algorithm starting at Austin. We leave Austin and go first to [city2].  Then go to [city3], then on to [city4], then go to [city5] before returning to Austin.  The total length of this path is [total] hours.

Consider the following graph. Which of the following is an Eulerization of the graph shown? Option 1 Option 2 Option 3

For each of the graphs below, determine whether it has an Eulerian Path, Eulerian Circuit, both, or neither. Graph 1: [G1] Graph 2: [G2] Graph 3: [G3] Graph 4: [G4]

Xavier and Yadina are dividing a circular cake that is half chocolate and half vanilla.  Both see the cake as worth $12.00. Xavier sees the chocolate side as having three times the value of the vanilla side. Yadina sees the chocolate side as having five times the value of the vanilla side.   The chocolate half is worth [XC] to Xavier. The chocolate half is worth [YC] to Yadina.

Suppose a graph has 8 vertices and is connected.  Three of those vertices have degree 6, and the rest have degree 2.  Then we can conclude the following. There must be [edges] edges in the graph. The graph has [EulPmust]  

Determine who is a Condorcet candidate if there is one.

Match the disease with the most effective imaging modality. Answers may be used more than once.

Match the disease to the cause

Match the disease to its definition or cause

What does the death rate measure?