Blog

Following is a diagram of your office floor:The doors to the outside are labeled West, South and East respectively. Three of your office colleagues sketched graphs which model your office based upon how how the rooms are “connected” via a doorway. Jackson Stan Alice Whose graph is correct?

The Cheapest Link Algorithm for solving the Traveling Salesman Problem is [CLgood] but  [CLbad].  The Brute Force Algorithm, on the other hand, is [BFbad] but [BFgood].

Refer to the Chart from Question 22 above. If instead you were going to use the “Cheapest Link Algorithm”,  what are the first two “links” that would be selected?  

Choose the accurate description of the power status in each weighted voting system.  (These are the systems in the previous three problems.) [10: 7, 4, 3]    [w1] [8: 4, 3, 3, 2]  [w2] [27: 15, 10, 8, 4]  [w3]

Determine who is a majority candidate if there is one.

Refer to the weighted voting system [8: 4, 3, 3, 2] and the Shapley-Shubik definition of power. Determine the pivotal member in each sequential coalition.   [2431]   [1342]   [2143]   [1243]

Three partners are dividing a piece of land worth $81,000 among themselves using the lone-divider method. The following table shows the value of the parcels in the eyes of each partner   S1 S2 S3 Rita $28,000 $21,000 $32,000 Tammy $26,000 $24,000 $31,000 Stu $27,000 $27,000 $27,000 The table indicates that [Divider] was the divider. Tammy finds [Tchoose] to be fair. A fair resolution according to Lone Divider would be [Alloc]  

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]

Determine who is a Condorcet candidate if there is one.

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.