Suppose we perform a sequence of n operations on a data structure such that if some condition C(k) holds then the kth operation
1 answer:
You might be interested in
Answer:
The Java Program for the given problem is as below. Directly copy the code and run it on your machine.
Explanation:
Refer the Screenshots attached for the output.
import java.io.BufferedReader;
import java.io.InputStreamReader;
public class TheSpeedOfSound {
public static void main(String[] s)
{
String medium;
double distance;
double time;
try{
BufferedReader choice = new BufferedReader(new InputStreamReader(System.in));
System.out.println("Enter one of the following: air, water, or steel: ");
medium = choice.readLine(); // reading input i.e. air, water or steel
//check for air water and steel
if (medium.equalsIgnoreCase("air") || medium.equalsIgnoreCase("water") || medium.equalsIgnoreCase("steel")){
System.out.println("Enter the distance the sound wave will travel: ");
distance = Double.parseDouble(choice.readLine()); // read distance value if it is air water or steel
switch (medium)
{
//if medium is air
case "air":
time = distance/1100;
System.out.print("It will take " + time + " seconds.");
break;
//if medium is water
case "water":
time = distance/4900;
System.out.print("It will take " + time + " seconds.");
break;
//if medium is steel
case "steel":
time = distance/16400;
System.out.print("It will take " + time + " seconds.");
break;
}
}
else{
System.out.print("Sorry, you must enter air, water, or steel.");
}
}
catch(Exception e){
e.printStackTrace();
}
}
}
Answer:
Explanation;
else
System.out.println("f1 and f2 are not equal");
switch (input.charAt(0)
{
case '+':
f3 = f1.add(f2);
System.out.println("f1+f2=" + f3);
break;
case '-':
f3 = f1.subtract(f2);
System.out.println("f1-f2=" + f3);
break;
case '*':
f3 = f1.multiply(f2);
System.out.println("f1*f2="+f3);
break;
case '/':
f3 = f1.divide(f2);
System.out.println("f1/f2="+f3);
break;
default:
System.out.println("Illegal command: " + input );
break;
}
}// end of while loop
} // end of main
}
Note ; this is the last part of the programme check the attachment from 1-5 this is the 6th .
