print("——OR——") Input ("Temperature value in degree Celsius:"), celsius 2 = float) Celsius 2 = (Fahrenheit 2 * 9/5) + 32; print the result.
The user's input is taken. Enter the temperature in celsius by typing it into the input box. Fahrenheit is equivalent to (celsius multiplied by 1.8) + 32 print(str(celsius)+ "A degree in Celsius is equal to a " + str(fahrenheit)+ " degree in Fahrenheit. The change from C to F is therefore 100/180, or 5/9. It is 180/100 or 9/5 from F to C. As a result, the conversion yields °F = °C (9/5) + 32. As a result, the equation for changing from the Celsius to Fahrenheit scale becomes °F = °C (9/5) + 32. To convert from degrees Fahrenheit to degrees Celsius, do the inverse calculation: subtract 30 from the degrees Fahrenheit reading, then multiply the result by two to obtain the degrees Celsius reading.
Learn more about conversion here-
brainly.com/question/13163755
#SPJ4
Answer:
wear a mask use hand sanitizer dont get in contact with anyone between 6 feet
Explanation:
Answer:
<em>Solution</em>:
The statements are listed below.
<em>(A) Functional requirement </em>
- Functional specifications refer to the handling of calls.
- Minimum call number should be 3000, and a functional requirement.
<em>(B) Non-functional requirement</em>
- Non-functional requirement is the default option.
- Payment in "Visa" is required and this is not a functional requirement.
<em>(C) Data requirements</em>
- Data requirements apply to quantity of order.
- When the quantity of data exceeds then an exception should be notified
<em>(D) Business requirements. </em>
- Product reviews are subject to business requirements.
Answer:
See explaination
Explanation:
Keep two iterators, i (for nuts array) and j (for bolts array).
while(i < n and j < n) {
if nuts[i] == bolts[j] {
We have a case where sizes match, output/return
}
else if nuts[i] < bolts[j] {
this means that size of nut is smaller than that of bolt and we should go to the next bigger nut, i.e., i+=1
}
else {
this means that size of bolt is smaller than that of nut and we should go to the next bigger bolt, i.e., j+=1
}
}
Since we go to each index in both the array only once, the algorithm take O(n) time.