Computers and Technology, 18.10.2021 20:30 evansh78

(Will give Brainliest for answer and no links unless it is accessible) in C#/ Ever heard of acid rain. This is rainfall with a very low pH. Write an application that will enable you to display the pH level for a swimming pool and whether an additive is needed or not. The pH is a measure of how acidic or basic the water is and is typically given on a 0-14 scale. Below 7.0 is defined as acidic, with 7 being neutral. Levels much above 7 are said to be basic or alkaline. Everything that enters a pool has a pH value. To have pH in balance the wayer is adjusted with additions of pH increasers (bases) or pH decreasers (acids) to achieve the range of 7.2-7.8. Allow the user to input the pH level number. Display a message indicating the health (i. e., acidic, neutral, or alkaline) and whether an additive is required. If an additive is required, identify the type. The water shpuld be described as acidic, requiring bases, when the pH is lower than 7. Consider the pH levels as neutral for pH levels in the range 7-7.8 and alkaline, requiring acid for pH levels greater than 7.8. Display an appropriate message when invalid values are entered.

Answers: 2

Show answers

Another question on Computers and Technology

Computers and Technology, 21.06.2019 23:30

Show that there is a language a âš† {0, 1} â— with the following properties: 1. for all x â a, |x| â‰¤ 5. 2. no dfa with fewer than 9 states recognizes a. hint: you donâ€™t have to define a explicitly; just show that it has to exist. count the number of languages satisfying (1) and the number of dfas satisfying (2), and argue that there arenâ€™t enough dfas to recognize all those languages. to count the number of languages satisfying (1), think about writing down all the strings of length at most 5, and then to define such a language, you have to make a binary decision for each string about whether to include it in the language or not. how many ways are there to make these choices? to count the number of dfas satisfying (2), consider that a dfa behaves identically even if you rename all the states, so you can assume without loss of generality that any dfa with k states has the state set {q1, q2, . . , qk}. now think about how to count how many ways there are to choose the other four parts of the dfa.

Answers: 3

Answer

Computers and Technology, 22.06.2019 03:00

Consider this data sequence: "3 11 5 5 5 2 4 6 6 7 3 -8". any value that is the same as the immediately preceding value is considered a consecutive duplicate. in this example, there are three such consecutive duplicates: the 2nd and 3rd 5s and the second 6. note that the last 3 is not a consecutive duplicate because it was preceded by a 7. write some code that uses a loop to read such a sequence of non-negative integers , terminated by a negative number. when the code finishes executing, the number of consecutive duplicates encountered is printed. in this case, 3 would be printed. assume the availability of a variable, stdin, that references a scanner object associated with standard input. that is, stdin = new scanner(system.in); is given.

Answers: 1

Answer

Computers and Technology, 22.06.2019 18:30

The "instance" relationship shows that something is an object of a

Answers: 1

Answer

Computers and Technology, 23.06.2019 05:00

In cell b18, enter a formula to calculate the amount budgeted for meals. this amount is based on the daily meal allowance and the total travel days (# of nights+1).

Answers: 1

Answer

You know the right answer?

(Will give Brainliest for answer and no links unless it is accessible) in C#/ Ever heard of acid rai...

Questions