Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

can someone help me with this work please. hello this is the pdf and the missing information a. Assignment (AO_Sangaree_Dance_Array.doc) b. Template to use to

can someone help me with this work please.
image text in transcribed
hello this is the pdf and the missing information image text in transcribed
image text in transcribed
a. Assignment (AO_Sangaree_Dance_Array.doc) b. Template to use to complete the assignment (Program_template_to_guide_students_SECOND_METH OD.pdf) c. Sample Result of the assignment (Assignment1_results.pdf). Problems The Sangree Old Folks Home is in decp financial trouble and the owntr, old Doc's sangree. decides to go on a massive fundraising campaign. The local high schoel elfers to help by sponsoring a dance marathen. Old Doc Sangree would like you to write a pregam to process the data gathered on the couples who will dance and their sponsors. Input: Every couple that dances is ghen a unique i0 number. Each sponsor is athed how much they are willing to donate for each hour the couple dances and the maximum number of hours they are willing to pay for. Data: ID MRS Rate a) The first number is the ID number of the couple being sponsored (DD) b) The second number represents the maximum number of hours the sponsor is willing to pay for (HRS) c) The third number is a real value which gives the dollar per hour amount that the sponsor will donate (RATE). Output: The Old Doc would appreciate it if you printed out the following information: a. Read the input one at a time into an array of objects. b. Sort the arrays in ascending order by couple ID: if there are Ieveral iors the same, the one with higher dollar per hour pledged should be firs: print these assorted arrays (print ID, HRS, Rate). c. Print an integer count for the number of sponsors followed by an integer count for the real number of couples, and then the real value which represents the total amount of money that will be collected (assuming all couples dance the maximum number of hourst. Print theses three numbers on ene line. The Old Doc would appreciate it if you printed out the following information: a. Read the input one at a time into an array of objects. b. Sort the arrays in ascending order by couple ID; if there are several ID'S the same, the one with higher dollar per hour pledged should be first; print these assorted arrays (print ID, HRS, Rate). c. Print an integer count for the number of sponsors followed by an integer count for the real number of couples, and then the real value which represents the total amount of money that will be collected (assuming all couples dance the maximum number of hours). Print theses three numbers on one line. d. Print out each unique ID number, the total number of sponsors for that ID, and the total amount the couple will collect (again assuming they all dance long enough to collect the full amount pledged). Print these three values on one line for each Unique ID. (These should already be sorted by ID). e. Find the couple who will earn the most money (if they all dance long enough), then print that couple's ID, the number of sponsors they have, and the total amount they will collect. Print these three numbers on the line. f. All output should start with proper heaciings. g. Proper internal documentation. - MUST use the concept of Object Oriented Programming in implementing the program. - Must submit the following with all documents stapled. a. Documented program b. Raw input file c. Documented outputs based on the items 1 through 6 as mentioned in the Output to an output file

Step by Step Solution

There are 3 Steps involved in it

Step: 1

blur-text-image

Get Instant Access to Expert-Tailored Solutions

See step-by-step solutions with expert insights and AI powered tools for academic success

Step: 2

blur-text-image

Step: 3

blur-text-image

Ace Your Homework with AI

Get the answers you need in no time with our AI-driven, step-by-step assistance

Get Started

Recommended Textbook for

Machine Learning And Knowledge Discovery In Databases European Conference Ecml Pkdd 2017 Skopje Macedonia September 18 22 2017 Proceedings Part 3 Lnai 10536

Authors: Yasemin Altun ,Kamalika Das ,Taneli Mielikainen ,Donato Malerba ,Jerzy Stefanowski ,Jesse Read ,Marinka Zitnik ,Michelangelo Ceci ,Saso Dzeroski

1st Edition

3319712721, 978-3319712727

More Books

Students also viewed these Databases questions