PS_ch1_Q4

By

 package com.company.Ch1_07_PracticeSet;


import java.util.Scanner;

public class PS_ch1_Q4 {
    public static void main(String[] args) {
        Scanner scan = new Scanner(System.in);
        System.out.println("Enter the distance in km ");
        float km = scan.nextFloat();
        float miles = km * 0.621f;
        System.out.print(km);
        System.out.print("km = " + miles + " miles");
    }
}

Comments

Post a Comment

Popular posts from this blog

#12_Binary searching

By
  #include   <stdio.h> //Binary searching void   display ( int   arr [] ,  int   size ) {      for  ( int  i  =   0 ; i  <   size ; i ++ )     {          printf ( " %d  " ,  arr [i]);     }      printf ( " \n " ); } int   search ( int   arr [] ,  int   size ,  int   element ) {      //Binary searching      int  low  =   0 , high  =   size   -   1 , mid;      while  (high  !=  low)     {          if  ( arr [low]  ==   element )         {              ret...
Read more

#10_Insertion in an array

By
  #include   <stdio.h> //Insertion in an array void   insertion_1 ( int   arr [] ,  int   size ,  int   element ,  int   index ) {      //Insertion for unsorted array      arr [ size ]  =   arr [ index ];      arr [ index ]  =   element ; } void   insertion_2 ( int   arr [] ,  int   size ,  int   element ,  int   index ) {      //Insertion for sorted array      for  ( int  i  =   size   -   1 ; i  >=   index ; i -- )     {          arr [ size ]  =   arr [ size   -   1 ];          size   -=   1 ;     }      arr [...
Read more

#24_Stack_using_an_array

By
  #include   <stdio.h> #include   <stdlib.h> //Stack using an array struct   stack {      int  size;      int  top;      int   * arr; }; int   isEmpty ( struct   stack   * ptr ){      if  ( ptr ->top  ==   - 1 ){          return   1 ;     }      else {          return   0 ;     } } int   isFull ( struct   stack   * ptr ){      if  ( ptr ->top  ==   ptr ->size  -   1 ){          return   1 ;     }      else {          return   0 ;     } } void   Create...
Read more