Practice Problem 6-Elizabeth's Trip

Practice Problem 6-Elizabeth's Trip

Elizabeth visits her friend Andrew and then returns home by the same route. She always walks 2 kilometers per hour (km/h) when walking uphill, 6 km/h when walking downhill, and 4 km/h when walking on level ground. Suppose the path from Elizabeth's home to Andrew's home consists of 'x' meter in the level ground, 'y' meter in the uphill, 'z' meter in the  downhill and Elizabeth starts from home by 6 a.m.Write an algorithm and the subsequent Python code to determine when Elizabeth will reach Andrew's home and when she will reach her home back if she spends 'm1' minutes in Andrew's home. For example, if x is 1000, 'y' is 500, 'z' is 300  and m1 is '30' minutes, then Elizabeth takes 30 min to reach Andrew's home so she will reach Andrew's home by 6 hour 30 min. Elizabeth will take 26 min to walk from Andrew's home to her home and time when will reach her home back is 7 hour 26 min.
The hour can be expressed in 12-hour format (not 24-hour format).  The minutes elapsed should be rounded down to the nearest integer.

Input Format

First line contains the distance ‘x’ in plain
Next line contains the distance ‘y’ in uphill
Next line contains the distance ‘z’ in downhill
Next line contains the value for ‘ml’ minutes spent at Andrew’s home

Output Format

Print time by which Elizabeth will reach Andrew’s home. Print hours and minutes separated by a space

Print time by which Elizabeth will reach back her home. Print hours and minutes separated by a space

PROGRAM:

x=float(input())
y=float(input())
z=float(input())
ml=float(input())
hr=6
def round2(n):
    if(n-round(n)>=0.5):
        return(round(n)+1)
    else:
        return(round(n))
tmin=round2(x/4*(18/(5*60)))+round2(y/2*(18/(5*60)))+round2(z/6*(18/(5*60)))
if(tmin<60):
    print(hr,' ',tmin)
else:
    hr=hr+tmin//60
    tmin=tmin%60
    print(hr,' ',tmin)
tmin2=tmin+ml+round2(x/4*(18/(5*60)))+round2(y/6*(18/(5*60)))+round2(z/2*(18/(5*60)))
if(tmin2<60):
    print(hr,' ',tmin2)
else:
    hr=int(hr+tmin2//60)
    tmin2=int(tmin2%60)
    print(hr,' ',tmin2)

PROCESSING:

def round2(n):
 if(n-round(n)>=0.5):
  return(round(n)+1)
 else:
  return(round(n))
tmin=round2(x/4*(18/(5*60)))+round2(y/2*(18/(5*60)))+round2(z/6*(18/(5*60)))
if(tmin<60):
 print(hr,’ ‘,tmin)
else:
 hr=hr+tmin//60
 tmin=tmin%60
 print(hr,’ ‘,tmin)
tmin2=tmin+ml+round2(x/4*(18/(5*60)))+round2(y/6*(18/(5*60)))+round2(z/2*(18/(5*60)))
if(tmin2<60):
 print(hr,’ ‘,tmin2)
else:
 hr=int(hr+tmin2//60)
 tmin2=int(tmin2%60)
 print(hr,’ ‘,tmin2)

PSEUDOCODE:

1.START
2.READ x,y,z,ml
3.SET hr=6
4.DEFINE function round2(n):
 4.i)IF n-round(n)>=0.5:
  4)i)a) RETURN round(n) +1
 4).ii ELSE:
  4)ii)b) RETURN round(n)
5.COMPUTE tmin=round2(x/4*(18/(5*60)))+round2(y/2*(18/(5*60)))+round2(z/6*(18/(5*60)))
6.IF (tmin<60):
 6.i) DISPLAY hr , tmin
7)ELSE:
 7)i COMPUTE hr=hr+tmin//60
 7)ii COMPUTE tmin=tmin%60
 7)iii DISPLAY hr,min
8. COMPUTE tmin2 =tmin+ml+round2(x/4*(18/(5*60)))+round2(y/6*(18/(5*60)))+round2(z/2*(18/(5*60)))
9.IF(tmin2<60):
 9)i DISPLAY(hr,’ ‘,tmin2)
10.ELSE:
 10)i COMPUTEhr=int(hr+tmin2//60)
 10)ii COMPUTE tmin2=int(tmin2%60)
 10)iii DISPLAY (hr,’ ‘,tmin2)
11.END

Comments

Post a Comment

Popular posts from this blog

MATLAB WEEK-2

Image
MATLAB Plotting of curves and surfaces Week: 2 METHOD 1 x=linspace(0,1,101) plot(x,x.^3, 'r+' ,x,sin(x), 'b-' ,x,exp(x), 'g.' ) METHOD 2 using Hold on clear all x=linspace(0,1,101) plot(x,x^3, 'r*' ) hold on plot(x,sin(x), 'g.' ) hold on plot (x,exp(x), 'b+' ) If we remove hold on, only last graph will be displayed. METHOD 3 using subplot x=0:.1:2*pi; subplot(2,2,1); plot (x,sin(x)); subplot(2,2,2); plot(x,cos(x)); subplot(2,2,3); plot(x,exp(-x)); subplot(2,2,4); plot(x,sin(3*x)); Diffrentiation syms x y f=x^2+2*x*y+y*sin(x) diff(f,x) diff(f,y) f =2*x*y + y*sin(x) + x^2 ans = 2*x + 2*y + y*cos(x) ans = 2*x + sin(x) Integration syms x f=x^3 + 3*x^2 + 5*x + 12 int(f,x,0,2) f = x^3 + 3*x^2 + 5*x + 12 ans = 46 Plotting graph syms x f=sin(2*x)+ cos(3*x) ezplot(f) ...
Read more

PRACTICE PROBLEM 8

Image
PRACTICE PROBLEM 8 Verification of 'L' shaped arrangement of Coins on Game Board (Id-2435) Consider a nxn board game with four types of coins red, green, blue and yellow. Given the state of the board with coins in all cells, develop an algorithm and write a C program to check if the same coins are placed in ‘L’ shape on the board. The number of cells in the vertical and horizontal line of ‘L’ shape should be same and should be greater than 1. Red coins are represented by ‘r’, blue coins are represented by ‘b’, green coins are represented by ‘g’ and yellow coins are represented by ‘y’.  For example, given the configuration of a 4 X 4 board with coins as shown below, b r y r r r y b y r b b b r r r the program must print 'Yes'. As there is a 'L' shape as shown in the figure below. Input Format Number of rows, r Number of columns, c Next ‘r x c’ lines contains the elements in the matrix Elements in the matrix given row by row ...
Read more

Practice Problem 6-Isomorphic Numbers

ISOMORPHIC NUMBERS Given ‘n’ integers, write an algorithm and the subsequent Python code to print all numbers that are isomorphic to the first number. Two numbers with non-distinct (numbers in which digits get repeated) are said to be isomorphic if they have the same number of digits in it and the sets of positions  having the same  digits are equal.. For example: • 12321 is isomorphic to 83538 . Both the  numbers are of length five.  In 12321, positions 2 and 4 have the same digit 2, Positions 1 and 5 have same digit 1. Hence the set of positions having the same digit are {{1,5},{2,4}. Similarly , for the number 83538, the set of positions having the same digit is {{1,5}, {2,4}}. • 1232 is not isomorphic to 2342 because set of places having same digits for 1232 is {{2, 4}} and for 2342 is {{1, 4}} (digits are numbered from left to right starting from 1). • 12 is not isomorphic to 10. Write a function to check whether two  numbers are isomorphic....
Read more