subject

The Marietta Country Club has asked you to write a program to gather, then display the results of the golf tournament played at the end of March. The Club president Mr. Martin has asked you to write two programs. The first program will input each player's first name, last name, handicap and golf score and then save these records in a file named golf. txt (each record will have a field for the first name, last name, handicap and golf score).
The second program will read the records from the golf. txt file and display them with appropriate headings above the data being displayed.
If the score is = Par, then display 'Made Par'
If the score is < Par, then display 'Under Par'
If the score is > Par, then display 'Over Par'
There are 16 players in the tournament. Par for the course is 80. The data is as follows:
Andrew Marks 11.2 72
Betty Franks 12.8 89
Connie William 14.6 92
Donny Ventura 9.9 78
Ernie Turner 10.1 81
Fred Smythe 8.1 75
Greg Tucker 7.2 72
Henry Zebulon 8.3 83
Ian Fleming 4.2 72
Jan Holden 7.7 84
Kit Possum 7.9 79
Landy Bern 10.3 93
Mona Docker 11.3 98
Kevin Niles 7.1 80
Pam Stiles 10.9 87
Russ Hunt 5.6 73

ansver
Answers: 1

Another question on Computers and Technology

question
Computers and Technology, 21.06.2019 23:30
Show that there is a language a ⚆ {0, 1} â— with the following properties: 1. for all x â a, |x| ≤ 5. 2. no dfa with fewer than 9 states recognizes a. hint: you don’t have to define a explicitly; just show that it has to exist. count the number of languages satisfying (1) and the number of dfas satisfying (2), and argue that there aren’t enough dfas to recognize all those languages. to count the number of languages satisfying (1), think about writing down all the strings of length at most 5, and then to define such a language, you have to make a binary decision for each string about whether to include it in the language or not. how many ways are there to make these choices? to count the number of dfas satisfying (2), consider that a dfa behaves identically even if you rename all the states, so you can assume without loss of generality that any dfa with k states has the state set {q1, q2, . . , qk}. now think about how to count how many ways there are to choose the other four parts of the dfa.
Answers: 3
question
Computers and Technology, 22.06.2019 07:30
What type of computer network ensures high security ?
Answers: 1
question
Computers and Technology, 22.06.2019 17:40
Gabe wants to move text from one document to another document. he should copy the text, paste the text, and open the new document highlight the text, select the cut command, move to the new document, make sure the cursor is in the correct location, and select the paste command select the save as command, navigate to the new document, and click save highlight the text, open the new document, and press ctrl and v
Answers: 1
question
Computers and Technology, 23.06.2019 08:30
All of these are true about using adhesive except: a. dissimilar materials can be joined. b. mixing tips are product and material specific. c. a specific application gun may be required. d. two-part adhesives are dispensed using two mixing tips
Answers: 3
You know the right answer?
The Marietta Country Club has asked you to write a program to gather, then display the results of th...
Questions
question
Mathematics, 05.07.2020 03:01
question
Mathematics, 05.07.2020 03:01
question
Mathematics, 05.07.2020 03:01
question
English, 05.07.2020 04:01
question
Business, 05.07.2020 04:01
question
Social Studies, 05.07.2020 04:01
question
Mathematics, 05.07.2020 04:01
question
Mathematics, 05.07.2020 04:01
Questions on the website: 13722362