Answer:
// here is code in java.
import java.util.*;
// class definition
class Main
{
// method that return total fare
public static double fare(double dis)
{
// calculate the total fare
double tot_fare=(4+((dis*1000)/140)*0.25);
return the fare
return tot_fare;
}
//driver method
public static void main (String[] args) throws java.lang.Exception
{
try{
// scanner object to read input string
Scanner s=new Scanner(System.in);
// variable
double dis;
System.out.print("please enter the distance in KM: ");
//read the number
dis=s.nextDouble();
// call the function with "dis" parameter
double ride_fare=fare(dis);
// print the total fare
System.out.println("total fare is: "+ride_fare);
}catch(Exception ex){
return;}
}
}
Explanation:
Read the distance from user with the help of scanner class.Call the function with parameter "dis".Here it will calculate the total fare as (4+((dis*1000)/140)*0.25). Here base fare is $4 and $0.25 for every 140 meter.Then function will return the total fare.
Output:
please enter the distance in KM: 7
total fare is: 16.5
Answer:
Hyper text mark up language. is the full form of HTML
hope it helps
<h3>stay safe healthy and happy.</h3>
Answer:
See explaination for the program code
Explanation:
The code below
Pseudo-code:
//each item ai is used at most once
isSubsetSum(A[],n,t)//takes array of items of size n, and sum t
{
boolean subset[n+1][t+1];//creating a boolean mtraix
for i=1 to n+1
subset[i][1] = true; //initially setting all first column values as true
for i = 2 to t+1
subset[1][i] = false; //initialy setting all first row values as false
for i=2 to n
{
for j=2 to t
{
if(j<A[i-1])
subset[i][j] = subset[i-1][j];
if (j >= A[i-1])
subset[i][j] = subset[i-1][j] ||
subset[i - 1][j-set[i-1]];
}
}
//returns true if there is a subset with given sum t
//other wise returns false
return subset[n][t];
}
Recurrence relation:
T(n) =T(n-1)+ t//here t is runtime of inner loop, and innner loop will run n times
T(1)=1
solving recurrence:
T(n)=T(n-1)+t
T(n)=T(n-2)+t+t
T(n)=T(n-2)+2t
T(n)=T(n-3)+3t
,,
,
T(n)=T(n-n-1)+(n-1)t
T(n)=T(1)+(n-1)t
T(n)=1+(n-1)t = O(nt)
//so complexity is :O(nt)//where n is number of element, t is given sum
Answer:
Line of sight
Explanation:
Your line of sight is the noticeable path of travel from your vehicle to your destination area. This line can be obstructed by a curve, a hill, high-forest wooded zones, large trucks, or other obstruction that prevents drivers from seeing the vehicle ahead. Therefore, if you cannot see around an obstruction, you should slow down and be willing to adjust your position until you can reestablish a clear line of sight to your path of travel and targeting area.
