Question: 5-9) (Find the two highest scores) Write a program that prompts the user to enter the number of students and each students name and score,
5-9) (Find the two highest scores) Write a program that prompts the user to enter the number of students and each students name and score, and finally displays the student with the highest score and the student with the second-highest score.
SAMPLE RUN #4: java TwoHighestScores
Interactive Session Standard Input Standard Error (empty) Standard Output Hide Invisibles
Highlight: NoneStandard Input OnlyPrompts OnlyStandard Output w/o PromptsFull Standard OutputAllShow Highlighted Only
Enterthenumberofstudents:6 Student1of6 Enterstudent'sname:TuckerMansfield Enterstudent'sscore:33.33 Student2of6 Enterstudent'sname:BarbaraStevenson Enterstudent'sscore:89.56 Student3of6 Enterstudent'sname:ScottFitzPatrick Enterstudent'sscore:78.80 Student4of6 Enterstudent'sname:AmyDickstein Enterstudent'sscore:93.3 Student5of6 Enterstudent'sname:ThomasCollins Enterstudent'sscore:96.7 Student6of6 Enterstudent'sname:RichardGoldstein Enterstudent'sscore:85.5 Thehighestscorewas96.70andThomasCollinsgotit Thesecondhighestscorewas93.30andAmyDicksteingotit
5-18) (Display four patterns using loops) Ask the user to enter an integer to set a limit for nested loops and generate the following four patterns: Enter an integer to be a limit of the pattern:6 Pattern A: 1 1 2 1 2 3 1 2 3 4 1 2 3 4 5 1 2 3 4 5 6 Pattern B: 1 2 3 4 5 6 1 2 3 4 5 1 2 3 4 1 2 3 1 2 1 Pattern C: 1 2 1 3 2 1 4 3 2 1 5 4 3 2 1 6 5 4 3 2 1 Pattern D: 1 2 3 4 5 6 1 2 3 4 5 1 2 3 4 1 2 3 1 2 1
SAMPLE RUN #4: java LoopPattern
Interactive Session Standard Input Standard Error (empty) Standard Output Hide Invisibles
Highlight: NoneStandard Input OnlyPrompts OnlyStandard Output w/o PromptsFull Standard OutputAllShow Highlighted Only
Enteranintegertobealimitofthepattern:5 PatternA: 1 12 123 1234 12345 PatternB: 12345 1234 123 12 1 PatternC: 1 21 321 4321 54321 PatternD: 12345 1234 123 12 1
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
