this code works but displays an incorrect answer. the correct output should be 57.5 Temperature (in C): 20Windspeed (in mph): 15Windchill Temperature (in F): 48.5 def CTOF(celcius_input):far_output=celcius_input*1.8far_output+=32return far_outputdef getWindchill(wind_speed):wind_chill=CTOF(wind_speed)-(0.7*wind_speed)return wind_chilldef main():#wind_chill=0celcius_input=int(input("Temperature (in C): "))wind_speed=int(input ("Windspeed (in mph): "))CTOF(celcius_input)getWindchill(wind_speed)print ( "Windchill Temperature (in F):", getWindchill(wind_speed))main()

Answered: Image /qna-images/answer/6726552f-56ea-46c3-b834-628d33d15529.jpg

Answered: this code works but displays an…

Engineering

Computer Science

this code works but displays an incorrect answer. the correct output should be 57.5

Microsoft Visual C#

7th Edition

ISBN:9781337102100

Author:Joyce, Farrell.

Publisher:Joyce, Farrell.

Chapter8: Advanced Method Concepts

Section: Chapter Questions

Problem 8RQ

See similar textbooks

Similar questions

function result = result = ''; 1 tokens_to_str_code(token_mat, time_unit) 3 for i =1:size(token_mat,1) 4 5 if(token_mat (i,1) if(token_mat(i,2) > 4*time_unit) result = strcat(result,"-"); elseif((token_mat(i,2) > time_unit) && (token_mat(i,2) 8*time_unit) result = strcat(result,"/"); elseif((token_mat(i,2) 11 == 0) 12 13 14 4*time_unit) && (token_mat(i,2) < 8*time_unit)) 15 result strcat(result," "); %3D 16 end 17 end 18 end 19 end 20 21 Check Test Expected Got tokens %3D [1 4; е 3; 1 3; е 1; 1 3; е 1; 1 1; ө 1; 1 1 ]; time_unit = .5; disp( tokens_to_str_code( tokens, time_unit )) tokens = [ 0 4; 1 1457; 0 463; 1 1457; 0 463; 1 497; 0 1423; 1 1457; ---/..--.. --.---/..--.. о 463; 1 1457; 0 463; 1 1457; ө 3343; 1 497; ө 463; 1 497; 0 463; 1 1457; 0 1423; 1 1457; 0 463; 1 497; 0 463; 1 497; e 379 ]; time_unit = 240; disp( tokens_to_str_code( tokens, time_unit ))
in C# Write a program named InputMethodDemo2 that eliminates the repetitive code in the InputMethod() in the InputMethodDemo program in Figure 8-5. Rewrite the program so the InputMethod() contains only two statements: one = DataEntry("first");two = DataEntry("second"); I am getting the error Method DataEntry is defined to eliminate repetitive code 0 out of 1 checks passed. unit Test Incomplete Method DataEntry prompts the user to enter an integer and returns the integer Build Status Build Failed Build Output Compilation failed: 1 error(s), 0 warnings NtTest37b77fb0.cs(21,47): error CS0234: The type or namespace name `DataEntry' does not exist in the namespace `InputMethodDemo2'. Are you missing an assembly reference? Test Contents [TestFixture] public class DataEntryMethodTest { [Test ] public void DataEntryTest() { string consoleInput = "97"; int returnedValue; string expectedString = "Enter third integer"; using (var inputs = new StringReader(consoleInput)) {…
What is the output of this code? def func(a,b): if(b==1): return a else: return a* func(a,b-1) A It adds a and b (B) None of these choices © It multiplies a and b (D) It raises a to the power of b
int calc=1; for (i=1;i
public String cleanNumber(String phoneNumber) { int digit=0; String result = ""; String number= ""; for (int i = 0; i < phoneNumber.length(); i++) { char ch = phoneNumber.charAt(i); if (Character.isDigit(ch)) { number = number + ch; digit++; } } if(digit == 10) System.out.println("("+phoneNumber.substring(1,3)+")"+"-"+phoneNumber.substring(4,6)+phoneNumber.substring(7,10)); else result = "Error"; return result; }} Argument "(444) 999-1234" Actual (44)-) 99- "" Expected "(444) 999-1234" "4449991234" (44)-99234 "" "(444) 999-1234" "444.999.1234" (44)-99.12 "" "(444) 999-1234" What am doing wrong? How can I make the actual look like the expected? What do I have to change?
2. Design of a 4-bit excess-3 counter and 8-bit Up-Down counter. (1) Fig 2 shows the logic symbol of an universal 4-bit counter, its truth table and Verilog code. Nov please design the Verilog code of a 4-bit excess-3 counter (counter from 3 to 12) based on the cod in Fig 2(a). Please fill the blanks to complete the design. CLOCK CNTR4U CLK CLR LD ENP 11 ENT DO D1 D2 D3 778588 88888 QO Q1 -Q2 -Q3 RCO CLR 1 0 0 0 0 0 0 0 0 Inputs LD ENT ENP 1 0 0 0 0 X 0 X X 0 1 X X 1 1 1 0 1 0 1 0 1 1 1 1 Current State Q3 Q2 Q1 QO Fig 2 X X X X X X X X 0 0 0 0 0 0 1 1 1 X module Vrcntr4u( CLK, CLR, LD, ENP, ENT, D, Q, RCO ); input CLK, CLR, LD, ENP, ENT; input [3:0] D; output reg [3:0] Q; output reg RCO; 0 1 1 1 0 1 1 1 1 X Q <= 4'd0; Q <= D; X 0 1 always (posedge CLK) // Create the counter f-f behavior if (CLR == 1) else if (LD == 1) else if ((ENT-1) && (ENP-1)) Q <- Q + 1; else Q <= Q; Q3* 0 D3 Q3 Q3 always (Q or ENT) // Create RCO combinational output if ((ENT == 1) && (Q == 4'd15)) else RCD = 1;…
inhinclude Rsing namespace std; int maxResult( ) int maxVal for (int i { for (int j = 0; j <= n 0; i <= n; i += a) i; j += b) %3D %3D float z = (float)(n (i + j)) / (float)(c); if (floor(z) { int x = int y ceil(z)) i / a; j/ b; maxVal = max(maxVal, x + y (int)z); return maxVal; } int main() { max cout << maxResult( ); return 0; 1 } Input Compilation failed due to fellowing ons main.cpp:7:23: error: 'n' was not declared in this scope 7| for (int i = 0; i <= n; i a) main.cpp:7:31: error: 'a was not declared in this scope for (int i = 0; i <= n; i t= a) %3D main.cpp:9:36: error: b' was not declared in this scope | 6 for (int j = 0; j <= n - i; j - b) %3D main.cpp:11:45: error: 'c was not declared in this scope
a) FindMinIterative public int FindMin(int[] arr) { int x = arr[0]; for(int i = 1; i < arr.Length; i++) { if(arr[i]< x) x = arr[i]; } return x; } b) FindMinRecursive public int FindMin(int[] arr, int length) { if(length == 1) return arr[0]; return Math.Min(arr[length - 1], Find(arr, length - 1)); } What is the Big-O for this functions. Could you explain the recurisive more in details ?
IN JAVA Create a function that takes a string and returns the number of alphanumeric characters that occur more than once. Examples duplicateCount ("abcde") → 0 duplicateCount ("aabbcde") → 2 duplicateCount ("Indivisibilities") → 2 duplicateCount ("Aa") → 0 // Case sensitive
This is the question: Write an application that displays the factorial for every integer value from 1 to 10. A factorial of a number is the product of that number multiplied by each positive integer lower than it. For example, 4 factorial is 4 * 3 * 2 * 1, or 24. The output would then be The factorial of 4 is 24. This is the code given: public class Factorials { public static void main (String args[]) { // Write your code here } }
In C++, you've been thinking about some cascading if/switch structures (aside from those bad dreams, I mean). You wonder if maybe you could make them more re-usable by changing them into loops looking through an array. Let's give it a shot: Given the if structure: if (score >= 90) { grade = 'A'; } else if (score >= 80) { grade = 'B'; } else if (score >= 70) { grade = 'C'; } else if (score >= 60) { grade = 'D'; } else { grade = 'F'; } You see that there are numbers being translated into letters. You envision a set of parallel arrays: cutoffs grades +----+ +---+ | 90 | | A | +----+ +---+ | 80 | | B | +----+ +---+ | 70 | | C | +----+ +---+ | 60 | | D | +----+ +---+ | 0 | | F | +----+ +---+ MAX_cutoff = 5 Now you write a simple loop: i = 0; while (i < MAX_cutoff && score < cutoffs[i]) { i++; } grade…
In C++, you've been thinking about some cascading if/switch structures (aside from those bad dreams, I mean). You wonder if maybe you could make them more re-usable by changing them into loops looking through an array. Let's give it a shot: Given the if structure: if (score >= 90) { grade = 'A'; } else if (score >= 80) { grade = 'B'; } else if (score >= 70) { grade = 'C'; } else if (score >= 60) { grade = 'D'; } else { grade = 'F'; } You see that there are numbers being translated into letters. You envision a set of parallel arrays: cutoffs grades +----+ +---+ | 90 | | A | +----+ +---+ | 80 | | B | +----+ +---+ | 70 | | C | +----+ +---+ | 60 | | D | +----+ +---+ | 0 | | F | +----+ +---+ MAX_cutoff = 5 Now you write a simple loop: i = 0; while (i < MAX_cutoff && score < cutoffs[i]) { i++; } grade…