can i get answer without arraylist OVERVIEWBody mass index (BMI) is a value derived from the mass (weight) and height of a person. The BMIis defined as the body mass divided by the square of the body height, and is expressed in units of kg/m,resulting from mass in kilograms and height in meters. The BMI may be determined using a table or chartwhich displays BMI as a function of mass and height using contour lines or colors for different BMIcategories, and which may use other units of measurement (converted to metric units for thecalculation). The BMI is a convenient way for classifying persons in to 4 categories based the BMI valueas shown the following table:BMI valueCategoryLess than 18.5Underweight18.5 to less than 25NormalOverweightObese25 to less than 3030 or higherA national study in some country to analyze the BMI of the people in the country is considered. In thisstudy, a set of cities is selected in the study and randomly specific number of persons are selected tocheck the BMI category of each one.Implement a java project to help in the study analysis with the following steps:Read from the user the number of cities (minimum 6 cities.)• For each city: city name and the number of persons (minimum 10 persons) are entered.• For each person in a city: mass and height should be entered, BMI and BMI category have to becomputed and printed.• For each city, the number of persons and percent ratio in each BMI category should be computedand printed.Finally, the program should print a summary report with the following details:o Number of cities.o Total number of persons and percent ratio of persons in each BMI category in all cities.o The name of the best city which has the maximum percent of persons in normal weightBMI category and these people's percent ratio.O The name of the worst city which has the maximum percent of persons in obese BMIcategory and these people's percent ratio.o The name of the city which has the minimum percent of persons in underweight BMIcategory and these people's percent ratio.

• Read from the user the number of cities (minimum 6 cities.) • For each city: city name and the number of persons (minimum 10 persons) are entered. For each person in a city: mass and height should be entered, BMI and BMI category have to be computed and printed. • For each city, the number of persons and percent ratio in each BMI category should be computed and printed. • Finally, the program should print a summary report with the following details: o Number of cities. o Total number of persons and percent ratio of persons in each BMI category in all cities. o The name of the best city which has the maximum percent of persons in normal weight BMI category and these people's percent ratio. o The name of the worst city which has the maximum percent of persons in obese BMI category and these people's percent ratio. o The name of the city which has the minimum percent of persons in underweight BMI category and these people's percent ratio.

• Read from the user the number of cities (minimum 6 cities.) • For each city: city name and the number of persons (minimum 10 persons) are entered. For each person in a city: mass and height should be entered, BMI and BMI category have to be computed and printed. • For each city, the number of persons and percent ratio in each BMI category should be computed and printed. • Finally, the program should print a summary report with the following details: o Number of cities. o Total number of persons and percent ratio of persons in each BMI category in all cities. o The name of the best city which has the maximum percent of persons in normal weight BMI category and these people's percent ratio. o The name of the worst city which has the maximum percent of persons in obese BMI category and these people's percent ratio. o The name of the city which has the minimum percent of persons in underweight BMI category and these people's percent ratio.

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

So how fast is the merge sort? Does it depend on the type of array? We saw with some of our previous sorts that it depended on the initial array. For example, an Insertion sort was much faster for a nearly sorted array. In this exercise, you are given the Sorter class, which contains a static mergeSort method that takes an int array and length as an input. You are also given the SortTester class which has three static methods for creating 3 different types of arrays. For this test, create one of the three arrays, then take a start time using System.currentTimeMillis(). Next, run the array through the mergeSort method in the Sorter class. Finally, record the end time and print out the results. Repeat this for the other two array types. Sample Output Random Array: ** Results Hidden ** Almost Sorted Array: ** Results Hidden ** Reverse Array: ** Results Hidden **
: Implement a CircularArray class that supports an array-like data structure whichcan be efficiently rotated. If possible, the class should use a generic type (also called a template), andshould support iteration via the standard for (Obj o : circularArray) notation.
What are the similarities and differences between a -HashSet and an ArrayList? Use the descriptions of Set, HashSet, List, and -ArrayList in the library documentation to find out, because HashSet is a -special case of a Set, and ArrayList is a special case of a List
how would you do number 5? this is a non graded practice lab.
code toimplementations of OrderedStructures, we develop a method to find the correct location to insert the value and then use that method as the basis for implementing the public methods—add, contains, and remove
How can I evaluate an ArrayList's efficiency?
How can | iterate over the ArrayList made up of integers using the while loops in the java programming language?
Without using any pre-defined method. Don't copy from internet Two array is given and you check whether these array is equal or not in java. Without using any pre-defined method
Go program using generics Output True False
Declare and implement 5 classes: FloatArray, SortedArray,FrontArray, PositiveArray & NegativeArray.1- The FloatArray class stores a dynamic array of floats and itssize. It has:- A parameterized constructor that takes the array size.- An add method that adds a float at the end of the array.- Overloading for the insertion operator << to write the array to afile (ofstream)- Overloading for the extraction operator >> to read the arrayelements from the file (ifstream) and add them to the array.- A destructor to deallocate the array2- The SortedArray inherits from FloatArray. It has:- A parameterized constructor that takes the array size.- An add method that adds a float at the right place in the arraysuch that the array remains sorted with every add. Don’t add tothe array then sort but rather add in the right place.3- The FrontArray inherits from FloatArray. It has:- A parameterized constructor that takes the array size.- An add method that adds a float at the front of the…
Java programming homework please help
how would you solve this? this is a non graded practice lab