![Java How To Program (Early Objects)](https://www.bartleby.com/isbn_cover_images/9780133807943/9780133807943_largeCoverImage.jpg)
Concept explainers
(Computerization of Health Records) A health-care issue that has been in the news lately is the computerization of health records. This possibility is being approached cautiously because of sensitive privacy and security concerns, among others. [We address such concerns in later exercises.] Computerizing health records could make it easier for patients to share their health profiles and histories among their various health-care professionals. This could improve the quality of health care, help avoid drug conflicts and erroneous drug prescriptions, reduce costs and, in emergencies, could save lives. In this exercise, you’ll design a “starter” HealthProfile class for a person. The class attributes should include the person’s first name, last name, gender, date of birth (consisting of separate attributes for the month, day and year of birth), height (in inches) and weight (in pounds). Your class should have a constructor that receives this data. For each attribute, provide set and get methods. The class also should include methods that calculate and return the user’s age in years, maximum heart rate and target-heart-rate range (see Exercise 3.16), and body mass index (BMI; see Exercise 2.33). Write a Java app that prompts for the person’s information, instantiates an object of class HealthProfile for that person and prints the information from that object—including the person’s first name, last name, gender, date of birth, height and weight—then calculates and prints the person’s age in years, BMI, maximum heart rate and target-heart-rate range. It should also display the BMI values chart from Exercise 2.33.
![Check Mark](/static/check-mark.png)
Want to see the full answer?
Check out a sample textbook solution![Blurred answer](/static/blurred-answer.jpg)
Chapter 3 Solutions
Java How To Program (Early Objects)
- ! (asap)arrow_forward( C PROGRAMMING ONLY) 1. Red Stringby CodeChum Admin For the Japanese, who know so much and intuit more, human relations are predestined by a red string that the gods tie to the pinky fingers of those who find each other in life. Legend has it that the two people connected by this thread will have an important story, regardless of the time, place or circumstances. The red string might get tangled, contracted or stretched, as surely often happens, but it can never break. A red string is basically like a connection. And in programming, a connection from one variable to another can be simulated by a pointer. Let's do that! Instructions: In the code editor, you are provided with an initial code where a constant variable is declared.Your only task is to assign the address of this variable to the first pointer found at line 9.Output My·destiny·=·11arrow_forwardCould you make it in C++ language?arrow_forward
- (Mechanics) The deflection at any point along the centerline of a cantilevered beam, such as the one used for a balcony (see Figure 5.15), when a load is distributed evenly along the beam is given by this formula: d=wx224EI(x2+6l24lx) d is the deflection at location x (ft). xisthedistancefromthesecuredend( ft).wistheweightplacedattheendofthebeam( lbs/ft).listhebeamlength( ft). Eisthemodulesofelasticity( lbs/f t 2 ).Iisthesecondmomentofinertia( f t 4 ). For the beam shown in Figure 5.15, the second moment of inertia is determined as follows: l=bh312 b is the beam’s base. h is the beam’s height. Using these formulas, write, compile, and run a C++ program that determines and displays a table of the deflection for a cantilevered pine beam at half-foot increments along its length, using the following data: w=200lbs/ftl=3ftE=187.2106lb/ft2b=.2fth=.3ftarrow_forwardMatlab:Please write the codes, I do not want a manual solutionarrow_forward*Data Structures and Algorithm (C Programming) In economics, arbitrage is the practice of taking advantage of a difference in prices in two or more markets; striking a combination of matching deals to capitalize on the difference, the profit being the difference between the market prices at which the unit is traded. Arbitrage can become a source of gain when applied to currency exchanges. Consider the fol- lowing currency exchange ratios as an example: 1 U.S. dollar buys 0.7292 euros, 1 euro buys 105.374 Japanese yen, 1 Japanese yen buys 0.3931 Russian rubles, 1 Russian ruble buys 0.0341 U.S. dollars. Then you could take 1 U.S. dollar and buy 0.7292 euros with it, with which you can buy 76.8387 yen (because 0.7292 * 105.374 = 76.8387). Then take the 76.8387 yen and buy 30.2053 rubles (because 76.8387 * 0.3931 = 30.2053), and finally take the 30.2053 rubles and buy 1.03 dollars (because 30.2053 * 0.0341 = 1.0300). Assume that you are given the pairwise trading ratios among n…arrow_forward
- Bad News Bearers Introduction There is some bad news to be delivered, and X has taken on the dangerous mission. Nobody really wants to be the one to take the news; the way goes through enemy territory and, even if the messenger gets through, the classic fate of the bearer of bad news may be waiting. (Let's just say, this is how the phrase "Don't shoot the messenger" became relevant.) To determine which messenger will be sent, X sits all of his messengers down in a circle, selects a number, and starts to count off. Messengers are allowed to leave the circle one by one, and the last messenger left is the one who will deliver the bad news. The counting off procedure is slightly unusual, however, because it is actually the messenger after the last one counted who gets to leave the circle. Consider the following example with 5 messengers, in which the number selected for counting off is 7. We'll start at the "head" of the list and move forward. Since it is circular, the "head"…arrow_forwardC++ pleasearrow_forwardPython Knapsack Problem: imagine you are carrying a knapsack with capacity to hold a total of weight C. You are selecting among n items with values A={a_1, a_2, ... , a_n} and associated weights W={w_1, w_2, ... , w_n}. Here the weights and values are all positive. You wish to maximize the total value of the items you select not exceeding the given weight capacity, example, maximize sum_{a in A} such that sum_{w in W} <= C. Note that you can only select your items once. Reformulate this as a bottom-up dynamic programming problem as follows. Define K_{i,j} as the highest possible value sum considering items 1 through i and total weight capacity j (j <= C). What is the base case i.e. K_{0,j} for all j and K_{i,0} for all i. What is the loop statement?arrow_forward
- Computer Networking Lab:arrow_forwardC Proggraming Found in the Shuffle (Strings) An ordinary deck of playing cards contains 52 cards, each of which has a suit and a value. Most card games require that a deck be shuffled at the beginning of a play. However, sometimes the deck isn't shuffled well enough, and there are arrangements of cards in the deck which may cause a bias in the play. Two such arrangements are a same-suit sequence and an ascending sequence. A same-suit sequence is simply a sequence of consecutive cards in the deck with the same suit. An ascending sequence is a sequence of consecutive cards in the deck that follow one another in increasing value, with Ace following King and preceding two. Thus, 2S, 5S, KS, 3S AS is a same-suit sequence of length five, and 9C, 10D, JC, QS, KH, AC, 2D is an ascending sequence of length seven, and 2H 3H 4H 5H 6H is both a same-suit and ascending sequence of length five. The Problem Given a deck of cards, determine the length of the longest same-suit sequence and the…arrow_forwardFill in the blanks. Line # Code i-1 for (x = 2; x <-n'n; x++){ 3 print i 4 i-i+1 5 The number of times the comparison operation in Line 2 is executed is n-1 The number of times the print operation in Line 3 is executed is The number of times the addition operation is executed in Line 4 is The running time is fin) is e 1. (Note: Write the simplest possible function ofn, ie, without constants and lower order terms.arrow_forward
- C++ for Engineers and ScientistsComputer ScienceISBN:9781133187844Author:Bronson, Gary J.Publisher:Course Technology Ptr
![Text book image](https://www.bartleby.com/isbn_cover_images/9781133187844/9781133187844_smallCoverImage.gif)