Practice

PracticeTest
Test

• Read and analyze each problem carefully.

• Choose the letter of the correct answer.
• This serves as a practice set for the actual test.

1. An election is held among four candidates (A, (d)

B, C, and D). Using a voting method we will Number of Votes
call X, the winner of the election is candidate
45 30 25
A. Due to an irregularity in the original vote
count, a recount is required. Before the recount 1st A B C

Rank
takes place, candidate B drops out of the race. 2nd C A A
In the recount, still using voting method X,
3rd B C B
candidate D wins the election. Based on this
information, we can say that voting method X
violates the _____. 4. If there is a majority winner in an election let
(a) monotonicity criterion say candidate X,
(b) Condorcet criterion (a) then candidate X will also be the plurality
(c) majority criterion method winner.
(d) independence of irrelevant alternatives (b) then candidate X will also be the Condorcet
criterion method winner.
2. Arrow's Impossibility Theorem implies (c) then candidate X will also be the Hare
(a) that it is impossible to have a voting system winner.
method that satisfies all of the fairness (d) All the statements are true.
criteria. 5. An election is held among four candidates (A,
(b) that in every election, each of the voting B, C, and D). Using a voting method we will
methods must produce a different winner. call X, the winner of the election is candidate
(c) that there is a voting method that satisfies A. However, candidate D beats each other
all of the fairness criteria. candidate in a head to head, pairwise
(d) None of these. comparison. Based on this information, we can
3. The Mathematics Society is holding an election say that voting method X violates the _____.
for the president. The three candidates are A, (a) monotonicity criterion
B, and C. Forty-five percent of voters like A the (b) Condorcet criterion
most and B the least. Thirty percent of voters (c) majority criterion
like B the most and C the least. Twenty-five (d) independence of irrelevant alternatives
percent of voters like C the most and A the criterion
least. Write out the preference schedule for this 6. For an election with four candidates (A, B, C,
election. D) consider the following preference table:
(a)
Number of Votes Number of Votes

45 30 25 6 3 5 8
st
1st A B C 1 D D A C
Rank

nd
2 B A C A
Rank

2nd B A B
rd
3rd C C A 3 A B B D
th
4 C C D B
(b)
Number of Votes Using the majority method, which candidate
45 30 25
wins the election?
(a) A
st
1 C A A (b) B
Rank

2nd
B B C (c) D
rd (d) No winner
3 A C B
7. For an election with four candidates (A, B, C,
D) consider the following preference table:
(c)
Number of Votes Number of Votes
45 30 25 6 3 5 8
1st A B C 1 st
D D A C
Rank

2nd C A B 2 nd
B A C A
Rank

3rd B C A 3 rd
A B B D
th
4 C C D B

Using the Condorcet method, which candidate

wins the election?
 (a) B 12. Given the graph
(b) D
(c) C
(d) A
8. For an election with four candidates (A, B, C,
D) consider the following preference table:

Number of Votes
6 3 5 8
st
1 D D A C
nd
2 B A C A
Rank

what is the degree of vertex E?

rd
3 A B B D (a) 3
4th C C D B (b) 4
(c) 5
Using the Borda count method, which (d) 6
candidate wins the election? 13. Given the graph
(a) B
(b) D
(c) C
(d) A
9. For an election with four candidates (A, B, C,
D) consider the following preference table:

Number of Votes
6 3 5 8
st
1 D D A C
nd
all the following edges have weight equal to 3
2 B A C A EXCEPT _____.
Rank

3rd A B B D (a) Edge BC

4 th
C C D B
(b) Edge EF
(c) Edge DF
(d) Edge CE
Using the plurality method, which candidate 14. Given the graph
wins the election?
(a) D
(b) A
(c) B
(d) C
10. An election is held among four candidates (A,
B, C, and D). Using a voting method we will
call X, the winner of the election is candidate
A. However, candidate D has more than 50% of
the possible votes. Based on this information,
we can say that voting method X violates the
_____. and using Dijkstra's algorithm from A, which is
(a) monotonicity criterion the third current vertex?
(b) Condorcet criterion (a) vertex F
(c) majority criterion (b) vertex B
(d) independence of irrelevant alternatives (c) vertex D
criterion (d) vertex E
11. Given the graph 15. Given the graph

which of the following is TRUE? and using Dijkstra's algorithm, what is the
(a) Vertices C and H are adjacent. shortest distance from vertex A to vertex D?
(b) The given graph is a multigraph. (a) 1
(c) The given graph contains multiple edges. (b) 2
(d) The given graph is disconnected. (c) 4
(d) 5
 16. Given the graph

and using Dijkstra's algorithm, what is the

shortest distance from vertex A to vertex H?
(a) 6
(b) 2
(c) 4
(d) 5

Answers:
• Check your answers using this key:
https://drive.google.com/open?
id=1TuEgxElSLDBRhDMhyzs7a52tnVtl-
65VCBRfh01uNKY