Answered step by step
Verified Expert Solution
Question
1 Approved Answer
1. (6 pts) Suppose you are counting ballots in an election for Supreme (Yet Somehow Democratically Elected) Ruler of the Universe. Assume you have 1,000
1. (6 pts) Suppose you are counting ballots in an election for Supreme (Yet Somehow Democratically Elected) Ruler of the Universe. Assume you have 1,000 candidates in all, each of whom is assigned a unique ID number from 0 to 999. Within a new class named BallotCounter, write a program that processes a set of ballots. The program should run by allowing the user to enter the ID number of the selected candidate on each ballot. The user should be able to do this for as many ballots as needed, until entering a negative value to exit. Upon exiting, display a list of the candidates' ID numbers and their number of votes received, but only if the candidate received at least one vote. Include error checking to ensure that the user can't type in an ID number above 999. Below is an example of what your program might look like while running (underlined parts indicate user input). Enter candidate's ID number (0-999, any negative number to exit): 123 Enter candidate's ID number (0-999, any negative number to exit): Enter candidato's ID number (0-999, any negative nunber to exit) 123 Enter candidate's ID number (0-999, any negative number to exit): Enter candidate's ID number (0-999, any negative number to exit): 662 Enter candidate's ID number (0-999, any negative number to exit): 2342 Invalid ID number Enter candidate's ID number (0-999, any negative number to exit): 121 Enter candidate's ID number (0-999, any negative number to exit): 5 Enter candidate's ID number (0-999, any negative number to exit) 12 Enter candidate's ID number (0-999, any negative number to exit): 1 Enter candidate's ID number (0-999, any negative number to axit): 1000 Invalid ID number' Enter eandidate 's ID number (0-999, any negative number to exit) 12 Enter candidate's ID number (0-999, any negative number to exit) Election Results: Candidate 0: 1 vote (s) Candidate 5: 2 vote(s) Candidate 7: 1 vote (s) Candidate 12: 1 vote (s) Candidate 121: 1 vote (s) Candidate 123: 3 vote (s) Candidate 662: 1 vote (s)
Step by Step Solution
There are 3 Steps involved in it
Step: 1
Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started