Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

Java programming (blueJ). Thanks! Name SECTION 1. Lab Startup. Note: the files for this lab are on D2L/LaboB Start the BlueJ IDE progran. If there

Java programming (blueJ). Thanks! image text in transcribed
Name SECTION 1. Lab Startup. Note: the files for this lab are on D2L/LaboB Start the BlueJ IDE progran. If there is a project that is open project. using BlueJ create a project naned labe" and save it on your flash drive SECTION 2. Write a program that reads in a set of employee nanes and their salaries from as a rixed length record from a file named salaries.txt. The program is to read each record and then parse the input into the parts. Keep track of the employee with the largest salary and at the end of the progran print that employee with her/his salary name: the name of the employee, type string salary: the salary of the employee, type double maxNane: the name of the employee having the maximum salary, type String maxsalary: the salary of the employee having the maximum salary, type double salariesRec: The fixed length record, type string. Each record is 38 characters as follows: name: salary: 24..29 0..23 Employee Nane Salary im Davis 2050000 15850.90 3242500 17409.80 3543100 14235.89 36144.06 Joe Cool Kristi Smith Mabel Werth Bob Marley Fred Mertz Lucy VanPelt Employee: Lucy Vanpelt has the largest salary: 36144.88 End of Progran open salaries file for input print column headings while(not EOF): read salariesRec; parse name from salariesRec parse salary from salariesRec print name, salary if maxSalary

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_2

Step: 3

blur-text-image_3

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

Graph Databases In Action

Authors: Dave Bechberger, Josh Perryman

1st Edition

1617296376, 978-1617296376

More Books

Students also viewed these Databases questions