In Exercises 23-26, refer to the preference table that was given prior to Exercise 3 regarding choices for improvement of college life. Use that table to rank the choices using the specified method.
The plurality-with-elimination method
The university administration has asked a group of student leaders to vote on the aspects of college life to target for improvement over the next year. The choices were (D)ining facilities, (A)thletic facilities, (C)ampus security, and the (S)tudent union building. The votes are summarized in the following preference table. Use this information to answer Exercises
Preference | Number of Ballots | |||||
|
|
|
|
|
|
|
|
A | D | A | C | C | S |
|
C | C | S | D | S | A |
|
S | S | D | S | A | C |
|
D | A | C | A | D | D |
Voting on improving college life. What option is selected using the plurality method?
Want to see the full answer?
Check out a sample textbook solutionChapter 11 Solutions
Mathematics All Around (6th Edition)
- 30. (a) What is meant by the term "product measur"? ANDarrow_forward14. Define X-(H) for a given H E R. Provide a simple example.arrow_forwardLet G be a connected graph with n ≥ 2 vertices. Let A be the adjacency matrix of G. Prove that the diameter of G is the least number d such that all the non-diagonal entries of the matrix A are positive.arrow_forward
- find the general soultion (D-DxDy-2Dx)Z = sin(3x+4y) + x²yarrow_forward3. Show that (a) If X is a random variable, then so is |X|;arrow_forward8. [10 marks] Suppose that 15 people are at a dinner and that each person knows at least 9 of the others. Can the diners be seated around a circular table so that each person knows both of their immediate neighbors? Explain why your answer is correct.arrow_forward
- 19. Let X be a non-negative random variable. Show that lim nE (IX >n)) = 0. E lim (x)-0. = >arrow_forward9. [10 marks] Consider the following graph G. (a) Find the Hamilton closure of G. Explain why your answer is correct. (b) Is G Hamiltonian? Explain why your answer is correct.arrow_forward7. [10 marks] Let G = (V,E) be a 3-connected graph with at least 6 vertices. Let C be a cycle in G of length 5. We show how to find a longer cycle in G. Ꮖ (a) Let x be a vertex of G that is not on C. Show that there are three C-paths Po, P1, P2 that are disjoint except at the shared initial vertex x and only intersect C at their final vertices. (b) Show that at least two of Po, P1, P2 have final vertices that are adjacent along C.arrow_forward
- Holt Mcdougal Larson Pre-algebra: Student Edition...AlgebraISBN:9780547587776Author:HOLT MCDOUGALPublisher:HOLT MCDOUGALBig Ideas Math A Bridge To Success Algebra 1: Stu...AlgebraISBN:9781680331141Author:HOUGHTON MIFFLIN HARCOURTPublisher:Houghton Mifflin Harcourt