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?

What happens to insulin production in Type 1 diabetes?

Which of the following is a symptom of Type 1 diabetes discussed in lecture?