Homework Help is Here – Start Your Trial Now!
Engineering
Computer Engineering
Suppose there are a set of n precincts P1 . . . Pn with m voters in each precinct. Each voter supports one of two possible political parties. (In this country, only 2 political parties exist). We are required to carve the precincts into two electoral districts which each have exactly n/2 precincts. We know exactly how many voters in each precinct support each party. The goal is to strategically assign the precincts to the two districts. Describe an algorithm which determines whether it is possible to define the two districts in such a way that the same political party holds the majority in both districts. Assume n is even. Example: Consider n = 4, with the voters distributed as in the table. In this case. By grouping precincts 1 and 3 into a district and precincts 2 and 4 into a district, the Repulsive party will have a majority in both districts. Though, by total count, the Repulsive party only has a tiny advantage over the Demonic party (205 to 195).

Suppose there are a set of n precincts P1 . . . Pn with m voters in each precinct. Each voter supports one of two possible political parties. (In this country, only 2 political parties exist). We are required to carve the precincts into two electoral districts which each have exactly n/2 precincts. We know exactly how many voters in each precinct support each party. The goal is to strategically assign the precincts to the two districts. Describe an algorithm which determines whether it is possible to define the two districts in such a way that the same political party holds the majority in both districts. Assume n is even. Example: Consider n = 4, with the voters distributed as in the table. In this case. By grouping precincts 1 and 3 into a district and precincts 2 and 4 into a district, the Repulsive party will have a majority in both districts. Though, by total count, the Repulsive party only has a tiny advantage over the Demonic party (205 to 195).

Computer Networking: A Top-Down Approach (7th Edition)
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
See similar textbooks
icon
Related questions
Question

Suppose there are a set of n precincts P1 . . . Pn with m voters in each precinct. Each voter supports
one of two possible political parties. (In this country, only 2 political parties exist).
We are required to carve the precincts into two electoral districts which each have exactly n/2 precincts.
We know exactly how many voters in each precinct support each party. The goal is to strategically
assign the precincts to the two districts.
Describe an algorithm which determines whether it is possible to define the two districts in
such a way that the same political party holds the majority in both districts. Assume n is even.
Example: Consider n = 4, with the voters distributed as in the table.
In this case. By grouping precincts 1 and 3 into a district and precincts 2 and 4 into a district, the
Repulsive party will have a majority in both districts. Though, by total count, the Repulsive party only
has a tiny advantage over the Demonic party (205 to 195).

Precinct 1 3 4. Repulsive party 52 Demonic party 48 78 49 24 22 51 76 Fair and Balanced Districting. Carving up electoral districts is an art! You can carefully craft electoral districts to favor your preferred political party! This can mean the difference between winning and losing elections! It also allows you to marginalize voters! This is super useful to some people! Let's consider a simplified version of the problem. Suppose there are a set of n precincts P,..P, with m voters in each precinct. Each voter supports one of two possible political parties. (In this fictitious country, only 2 political parties are allowed to exist, according to tradition). We are required to carve the precincts into two electoral districts which each have exactly n/2 precincts. We know exactly how many voters in each precinct support each party. The goal is to strategically assign the precincts to the two districts. Describe an algorithm which determines whether it is possible to define the two districts in such a way that the same political party holds the majority in both districts. Assume n is even. Example: Consider n = 4, with the voters distributed as in the table. In this case. By grouping precincts 1 and 3 into a district and precincts 2 and 4 into a district, the Repulsive party will have a majority in both districts. Though, by total count, the Repulsive party only has a tiny advantage over the Demonic party (205 to 195).
Transcribed Image Text:Precinct 1 3 4. Repulsive party 52 Demonic party 48 78 49 24 22 51 76 Fair and Balanced Districting. Carving up electoral districts is an art! You can carefully craft electoral districts to favor your preferred political party! This can mean the difference between winning and losing elections! It also allows you to marginalize voters! This is super useful to some people! Let's consider a simplified version of the problem. Suppose there are a set of n precincts P,..P, with m voters in each precinct. Each voter supports one of two possible political parties. (In this fictitious country, only 2 political parties are allowed to exist, according to tradition). We are required to carve the precincts into two electoral districts which each have exactly n/2 precincts. We know exactly how many voters in each precinct support each party. The goal is to strategically assign the precincts to the two districts. Describe an algorithm which determines whether it is possible to define the two districts in such a way that the same political party holds the majority in both districts. Assume n is even. Example: Consider n = 4, with the voters distributed as in the table. In this case. By grouping precincts 1 and 3 into a district and precincts 2 and 4 into a district, the Repulsive party will have a majority in both districts. Though, by total count, the Repulsive party only has a tiny advantage over the Demonic party (205 to 195).
Expert Solution
steps

Step by step

Solved in 2 steps

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Similar questions
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY
SEE MORE TEXTBOOKS