HONORS DISCRETE PRACTICE MULTIPLE CHOICE

Chapter 1 - VOTING
Pick the MOST ACCURATE Answer Choice

Use the following preference schedule to answer questions #1 - 10:

Voters 8 5 6 3 9
1st A A B C D
2nd B D C B B
3rd C C D A A
4th D B A D C
1) How many candidates are in this election?
A) 5 B) 4 C) 31 D) 16

2) How many distinct ballots were cast?

A) 5 B) 4 C) 31 D) 16

3) How many people voted in this election?

A) 5 B) 4 C) 31 D) 16

4) Using the plurality method, who is the winner?

A) A B) B C) C D) D

5) Using the plurality-with-elimination method, who was eliminated 1st?

A) A B) B C) C D) D

6) Using the method of pairwise comparisons, who is the winner?

A) A B) B C) C D) D

7) Using the extended Borda Count ranking method, which candidate comes in
last place?
A) A B) B C) C D) D

8) Using the recursive plurality method, which candidate comes in second?

A) A B) B C) D D) None

9) Which of the candidates was the Majority candidate?

A) None B) A C) B D) C

10) Which of the candidates was the Condorcet candidate?

A) A B) B C) C D) D
 HONORS DISCRETE PRACTICE MULTIPLE CHOICE
CHAPTER 2 Weighted Voting
Pick the MOST ACCURATE Answer Choice

For questions #1 – #8: Use 36: 18, 11, 7, 4, 2

1) What is the quota of this weighted voting system?
A) 5 B) 22 C) 36 D) 42

2) How many players are in this weighted voting system?

A) 5 B) 22 C) 36 D) 42

3) How many votes are in this weighted voting system?

A) 5 B) 22 C) 36 D) 42

4) What is the minimum possible number for quota of this weighted voting system?
A) 5 B) 22 C) 36 D) 42

5) What is the maximum possible number for quota of this weighted voting system?
A) 5 B) 22 C) 36 D) 42

6) Which of the following would represent ¾ majority for this weighted voting system?
A) 27 B) 31 C) 32 D) 42

7) What is the total number of possible coalitions?

A) 16 B) 24 C) 31 D) 120

8) What is the total number of sequential coalitions?

A) 16 B) 24 C) 31 D) 120

9) In the weighted voting system 26: 15, 10, 5which of the following is true.
A) P1 is a dictator. C) Only P1 and P2 have veto power.
B) All have veto power. D) P2 and P3 are the dummies.
For #10 - 13: Use [12: 8, 6, 5]
10) Which isn’t a winning coalition?
A) {8, 6} B) {5, 8} C) {8, 5, 6} D) {6, 5}

11) Which player is critical in {8, 6, 5}?

A) P1 B) P2 C) P3 D) All of the above

12) Which player is pivotal in <8, 5, 6>?

A) P1 B) P2 C) P3 D) All of the above

13) Which of the following is true?

A) P1 has veto power B) P2 has veto power
C) P3 has veto power D) All of the above
HONORS DISCRETE PRACTICE MULTIPLE CHOICE
CHAPTER 3 - Fair Division
Pick the MOST ACCURATE Answer Choice

For Questions #1 – 3: Three players agree to split jolly ranchers using the method of
markers. The marks for the 3 players are shown below.
Player 1 Player 1

A C C W A A G W G B A B W C B
Player 2 Player 3 Player 2 Player 3

1) According to player one which of the following isn’t a fair amount of jolly ranchers?
A) ACCWA B) ACCW C) AGWGB D) ABWCB

2) Which of following is the correct allocation of jolly ranchers?

A) P1 = 1st Segment, P2 = 2nd Segment, P3 = 3rd Segment
B) P1 = 3rd Segment, P2 = 2nd Segment, P3 = 1st Segment
C) P1 = 3rd Segment, P2 = 1st Segment, P3 = 2nd Segment
D) P1 = 2nd Segment, P2 = 1st Segment, P3 = 3rd Segment

3) Which of the following is the leftover for the method?

A) A B) A, A C) W, G D) B, W, C, B

Use the following to answer questions #4 - #8: Method of Sealed Bids.

Player A Player B Player C
Item #1 1380 1200 1000
Item #2 720 500 725
Item #3 900 1000 750
4) Who will receive the Item #1? A) A B) B C) C D) All players
5) What is the fair dollar share for Player B?
A) 1200 B) 825 C) 900 D) 1000

6) In the first settlement, how much money will Player C get?

A) 725 B) 2475 C) 825 D) 100

7) What is the total surplus?

A 100 B) 126.66 C) 380 D) 480

8) Which of the following describes Player A’s final settlement?

A) Item #1 and Item #2, Pay 380 and Get 126.66
B) Item #2, Get 280, Get 126.66
C) Item #1, Pay 380 and Get 126.66
D) Item #3, Get 100 and Get 126.66
For questions # 9 - 11: Four players (A, B, C, and D) agree to divide a piece of land using
lone-divider method. The table below shows how each player values each of the four
shares (S1, S2, S3, and S4) of land.
S1 S2 S3 S4 9) Which player is the divider?
A) A B) B
A 30% 22% 33% 15% C) C D) D
B 24% 24% 24% 28%
10) Which shares are fair to player A?
C 25% 25% 25% 25% A) S1 B) S2
D 27% 13% 40% 20% C) S3 D) S1 and S3

11) Which of the following is not a fair division of the land?

A) A = S1, B = S4, C = S2, D = S3 B) A = S3, B = S2, C = S4, D = S1
C) A = S3, B = S4, C = S2, D = S1 D) All divisions are fair.

For #12 – 15: Sarah and Drew wants to divide a chocolate

and banana cake fairly. The total cost of the cake is $6.00.
Drew values chocolate twice as much as he values banana. Chocolate

Banana
12) What value of cake is fair for Drew to receive?
A) $6.00 B) $4.00 C) $3.00 D) $2.00

13) For Ben, how much does he value the banana and chocolate halves of the cake?
A) Banana = $2.00; Chocolate = $4.00 B) Banana = $4.00; Chocolate = $2.00
C) Banana = $1.50; Chocolate = $4.50 D) Banana = $4.50; Chocolate = $1.50

14) For Ben, how much is the piece (pictured to the right) worth?
A) $4.00
B) $3.00
C) $2.00
D) $1.50

15) For Ben, how much is the below piece of 45o of Chocolate and 900 of Banana worth?
A) $3.50
B) $3.00
C) $2.00
D) $1.50
 HONORS DISCRETE PRACTICE MULTIPLE CHOICE
CHAPTER 4 - APPORTIONMENT:
Pick the MOST ACCURATE Answer Choice

For questions 1 - 4: 4 states and 50 seats. The population of each state is provided.
State A B C D
Population 3194 9066 4548 8192

1) The standard divisor is 3) Which modified divisor works for Adam’s

A) 250 B) 500 method?
C) 5000 D) 25000 A) 500 B) 505
C) 510 D) 515

2) The standard quota (two decimal) for 4) Who gets the surplus in Hamilton’s
State A is method?
A) 6.39 B) 7.14 A) State A B) State B
C) 12.78 D) 63.88 C) State C D) State D
5) Under a certain apportionment method, state X has a standard quota of 48.9 and receives
47 seats in the final apportionment. This is called
A) an upper quota violation B) the Alabama paradox. C) the population paradox.
D) the new states paradox. E) a lower quota violation.

6) State Y received 100 seats under a certain apportionment method. 1 more seat was added
to the legislature and then under the same apportionment method Y received 99 seats. This
is called
A) an upper quota violation B) the Alabama paradox. C) the population paradox.
D) the new states paradox. E) a lower quota violation.

For questions 7 - 8: A small airline operates 5 flights (NY, BOS, DC, PHI, ATL) to major
cities on the east coast. There are only 20 airplanes that the airline owns. The airplanes are
apportioned among the flights on the basis of average profit per flight.

7) Which of the following best represents the key terms of an apportionment

(States; Populations; Seats) to the word problem?
A) Flights; Average Profit; Airplanes C) Flights; Airplanes; Average Profit
B) Airplanes; Flights; Average Profit D) Average Profit; Flights; Airplanes

8) Which of following will the standard divisor represent?

A) Airplanes per Average Profit
B) Airplanes per Flight
C) Average Profit per Airplane
D) Flights per Average Profit
For questions 9 - 12: The following table gives the standard quota of 5 states in a nation with
a 120,000 total people.
State A B C D E
Standard Quota 13.35 29.45 46 15.43 39.77
9) How many seats exist in this apportionment problem?
A) 5 B) 144 C) 83.3 D) 12, 000
10) Which of the following is NOT an accurate statement for a state’s UPPER quota?
A) A = 13 B) B = 30 C) C = 46 D) D = 16
11) Which of the following is NOT an accurate statement for a state’s LOWER quota?
A) D = 15 B) E = 39 C) C = 45 D) A = 13
12) Which state(s) do not receive a surplus under Hamilton’s method?
A) E B) B C) E and B D) A, C, and D
For questions 13 - 16: 5 states and 250 seats. The population of each state is provided.
State A B C D E
Population 250 875 4700 3825 350

13) Under Hamilton’s Method the apportionment to each state is

A) A = 6; B = 22; C = 117; D = 96; E = 9
B) A = 6; B = 22; C = 118; D = 96; E = 8
C) A = 7; B = 22; C = 117; D = 95; E = 9
D) A = 6; B = 23; C = 116; D = 96; E = 9

14) Under Jefferson’s Method the apportionment to each state is

A) A = 6; B = 22; C = 117; D = 96; E = 9
B) A = 6; B = 22; C = 118; D = 96; E = 8
C) A = 7; B = 22; C = 117; D = 95; E = 9
D) A = 6; B = 23; C = 116; D = 96; E = 9

15) Under Adam’s Method the apportionment to each state is

A) A = 6; B = 22; C = 117; D = 96; E = 9
B) A = 6; B = 22; C = 118; D = 96; E = 8
C) A = 7; B = 22; C = 117; D = 95; E = 9
D) A = 6; B = 23; C = 116; D = 96; E = 9

16) Under Webster’s Method the apportionment to each state is

A) A = 6; B = 22; C = 117; D = 96; E = 9
B) A = 6; B = 22; C = 118; D = 96; E = 8
C) A = 7; B = 22; C = 117; D = 95; E = 9
D) A = 6; B = 23; C = 116; D = 96; E = 9
 HONORS DISCRETE PRACTICE MULTIPLE CHOICE
CHAPTER 5 - EULER CIRCUITS:
Pick the MOST ACCURATE Answer Choice
A B
For questions #1 – 3 refer to Figure #1.
1) Which of the following is NOT a circuit in the graph?
A) C, C B) A, B, F, E, A
C) B, D, C, B D) F, D, C, C, B, E, F
F
2) Which of the following is NOT a path in the graph? E C
A) F, E, B, A, E, F, D B) F, B, C, C, D
D
C) F, E, A, B, F, D D) F, D, E, A, B, F, C, D
FIGURE #1
3) Which one of the following statements is NOT true about this graph?
A) There is a circuit starting and ending at C) It is a connected graph.
E. D) A loop exists.
B) There are multiple edges.
For questions # 4 – 6 refer to the four graphs in Figure #2.

Graph #1 Graph #2 Graph #3 Graph #4

FIGURE #2
4) Which graph(s) have an Euler Circuit?
A) Graph #1 B) Graph #2 C) Graph #3 D) Graph #4 E) Graph #2 + #3

5) Which graph(s) have components?

A) Graph #1 B) Graph #2 C) Graph #3 D) Graph #4 E) None

6) Which graph(s) have an Euler Path?

A) Graph #1 B) Graph #2 C) Graph #4 D) Graph #1 + #4 E) Graph #2 + #4

For #7 - 9: Use Figure #3

7) Which of the following is a bridge in the graph? A B
A) AB B) AF C) DG D) CG C

8) Which of the following is not a multiple edge? F G

A) AB B) CG C) GD D) CE
D E
9) Which is not the correct degree statement?
A) A = 3 B) C = 2 C) D = 4 D) F = 3 FIGURE #3

FIGURE #3
 HONORS DISCRETE PRACTICE MULTIPLE CHOICE
CHAPTER 6 - HAMILTON CIRCUITS:
Pick the MOST ACCURATE Answer Choice

1) The number of edges in K25 is A) 24 B) 25 C) 276 D) 300

2) The number of Hamilton Circuits in K16 is A) 15 B) 120 C) 15! D)

16!
3) If a complete graph has degree 8 for each vertex, then how many edges are in the
graph?
A) 36 B) 8! C) 9! D) 8

4) A complete graph has 465 edges. How many vertices does the graph have?
A) 29 B) 30 C) 31 D) 107,880

5) A complete graph has 40,320 distinct Hamilton’s circuits. How many vertices are there?
A) 6 B) 7 C) 8 D) 9

6) The graph in Figure #1 … A B C

A) has no Hamilton circuit.
B) has a single Hamilton circuit (and its mirror-image circuit).
C) has multiple Hamilton circuits, none contain the edge BD. G
D) has multiple Hamilton circuits, all contain the edge BE.
F E D
FIGURE #1
For questions 7 - 9 refer figure #2:
7) The Nearest Neighbor Algorithm applied to the A
graph finds the solution: 3 1
A) D, C, A, B, E, D 6 10
B) D, E, A, B, C, D E B
5
C) D, A, B, E, C, D 18
D) D, B, E, C, A, D 8
23
13
8) The Cheapest Link Algorithm applied to the graph
finds the solution: D 28 C
A) D, C, A, B, E, D B) D, E, A, B, C, D
FIGURE #2
C) D, A, B, E, C, D D) D, B, E, C, A, D

9) How many different Hamilton circuits would we have to find to use the Brute Force
Algorithm starting at D?
A) 4 B) 5 C) 10 D) 24 E) 12
 HONORS DISCRETE PRACTICE MULTIPLE CHOICE
CHAPTER 7 – TREES and NETWORKS
Pick the MOST ACCURATE Answer Choice
1) Which of the four graphs pictured below are trees?

Graph #1 Graph #2 Graph #3 Graph #4

A) Graph 2 B) Graph 2 and 4 C) Graph 2 and 3 D) Graph 2, 3, 4

2) Which of the four graphs pictured below are not trees?

Graph #1 Graph #2 Graph #3 Graph #4

A) Graph 3 B) Graph 2 and 4 C) Graph 2 and 3 D) Graph 1 and 3

3) The number of vertices in a tree with 12 edges is

A) 10 B) 11 C) 12 D) 13

4) Assume graph G has no loops or multiple edges. Which of the following graphs are
definitely trees?
A) G has 9 vertices and 8 bridges. B) G has 11 vertices and 9 edges
C) G has 7 vertices and no circuits. D) All of the above graphs are trees.

5) The number of edges in a tree with 32 vertices is

A) 30 B) 31 C) 32 D) 33

6) Suppose a graph has 15 vertices and 14 edges. Then

A) Graph must be a tree.
B) Graph is either a tree or it is not connected.
C) G cannot have any circuits.
D) G cannot have more than one path joining any two vertices.

7) How many spanning trees does the graph in Figure #1 have?

 A) 3
B) 4
C) 5
D) 8 FIGURE #1

8) How many spanning trees does the graph in Figure #2 have?

A) 10
B) 15
C) 23 FIGURE #2
D) 24

9) How many spanning trees does the graph in Figure #3 have?

A) 11
B) 55
C) 59 FIGURE #3
D) 60

10) How many spanning trees does the graph in Figure #4 have?
A) 420
B) 419
C) 392 FIGURE #4
D) 20

D
For # 11 and 12, use Figure #5.
171 81
11) Using Kruskal’s algorithm, which edge
should you choose second?
92 140
A) AE B) AB C E
C) BD D) DE 250
163
142
______12) Using Kruskal’s algorithm, 63
which edge should you choose fourth? 261
A) AB B) BC
C) BD D) DE B 134 A
FIGURE #5
HONORS DISCRETE PRACTICE MULTIPLE CHOICE
 First Quarter Material SOLUTIONS
Chapter 1 Chapter 2 Chapter 3:
1) B 1) C 1) B
2) A 2) A 2) D
3) C 3) D 3) B
4) A 4) B 4) A
5) C 5) D 5) C
6) B 6) C 6) D
7) C 7) C 7) C
8) D 8) D 8) C
9) A 9) B 9) C
10) B 10) D 10) D
11) A 11) B
12) C 12) C
13) A 13) A
14) B
15) C

Chapter 4: Chapter 5 Chapter 6 Chapter 7

1) B 1) C 1) D 1) B
2) A 2) A 2) C 2) C
3) D 3) B 3) A 3) D
4) A 4) C 4) C 4) A
5) E 5) E 5) D 5) B
6) B 6) D 6) B 6) B
7) A 7) B 7) C 7) B
8) C 8) D 8) B 8) C
9) C 9) D 9) B
9) B 10) A
10) A 11) D
11) C 12) B
12) D
13) A
14) B
15) C
16) A