Voting system - JAVA test case

The Scenario — Counting the Votes This year is a big one for active democracy if you happen to live in Queensland. Shortly, we have local government elections across the state, and sometime later in the year – there will be a federal election for the House of Representatives, and quite possibly for the entire Senate as well, depending on how lucky the Prime Minister is feeling at the time1. In this project it is our intention to automate the vote counting for a single House of Representatives (HoR) seat (we may also use the equivalent terms electorate, electoral district, and constituency). We will employ the standard approach, but we will also look at how this might work if the system happened to be different. Those who want or feel they need a general overview of the Australian parliamentary system can find one here: [login to view URL] The essential ideas are described in the examples below. This section has a lot of (mostly straightforward) background, some of which may be unfamiliar to international students and locals who are not political junkies. Look at this material carefully and listen to the podcasts as they become available. 1 For those who want to know more about so-called Double Dissolution elections, please see: [login to view URL] This isn’t required for the assignment. But this is what software developers have to do, to understand a practical problem and then design and code a solution for it. In this case, as our focus is on testing, a lot of the work has already been done for you. But you can’t test if you don’t understand the problem domain. So there is no escaping the background material. You will need to come to grips with two different systems: simple majority voting, and preferential voting. There is a third wrinkle, an approach called optional preferential voting, which we will mention below for the sake of completeness, but you won’t have to manage. Code already provide ~ Just have to add few simple lines of code and debug.