If a person walks up a mountain for 18 minutes at 20mph and then returns down the same path at 60mph then his average speed was 30mph. Write a task that restores the average speed traveled if you are given the time to climb, the level of climbing and the level of descent. The rise time is given in minutes. Return the value as a whole number (mph). No wrapping is required. Examples aveSpd (18, 20, 60) <-> 30 aveSpd (30, 10, 30) 15 aveSpd (30, 8, 24) 12 Plese give solution in Java Script

If a person walks up a mountain for 18 minutes at 20mph and then returns down the same path at 60mph then his average speed was 30mph. Write a task that restores the average speed traveled if you are given the time to climb, the level of climbing and the level of descent. The rise time is given in minutes. Return the value as a whole number (mph). No wrapping is required. Examples aveSpd (18, 20, 60) <-> 30 aveSpd (30, 10, 30) 15 aveSpd (30, 8, 24) 12 Plese give solution in Java Script

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter5: Control Structures Ii (repetition)

Section: Chapter Questions

Problem 21PE

See similar textbooks

Similar questions

An obvious continuation is to use random numbers to create namesfor the stars and planets. Instead of creating random strings of characters, names usually follow certain rules. Select a set of real-world names (e.g. from J.R.R. Tolkien’sworld) and invent a set of rules that they follow. Design and implement a methodthat creates new names based on the set of rules and random numbers.
Implement in Java using ScheduledExecutorService the schedule(callable) method, that runs after a delay of 7 seconds. The callable task should calculate the factorial of 20 and return this value. Print the obtained value in the screen. Factorial of 0 is 0! =1 Factorial of 1 is 1! =1 Factorial of n is n! =n*(n-1)! = n*(n-1) *…*2*1 2-Implement in Java the methods scheduleAtFixedRate() and scheduleWithFixedDelay() having 2 seconds delay. The code should display the value of a counter. The counter should be initialized to 0 and incremented during each execution of the task. The period used of both methods is 2 seconds
can you solve this please? Adopt appropriate Java animation code to implement the video in the file “test4.wmv” and given that the parametric equation for a circle. x=r*cos(t) y=r*sin(t) with t in range [0, 2p] and r is the radius of the circle. (the circle goes in a loop like in the images, i did my best to try to explain it , please try to do it ) and here is a sample of what they want me to use : package javaapplication1;import java.awt.*;import java.awt.event.*;import javax.swing.*;import java.awt.geom.*;import java.util.Random;import javax.imageio.*;import java.io.File;import java.io.IOException;import java.awt.image.BufferedImage;import java.awt.event.*;import java.util.Calendar; public class JavaApplication1 extends JApplet { public static void main(String[] args) { JFrame frame=new JFrame(); frame.setTitle("hello"); frame.setDefaultCloseOperation(JFrame.EXIT_ON_CLOSE); JApplet applete =new JavaApplication1(); applete.init();…
Consider the code below. In Big-O notation, what is the order of it? Explain your answer. for (int pass = 1; pass <= n; pass++){ for (int i = 0; i < n; i++) { for (int count = 1; count < 10; count++) { task T // some task which takes t time units } }}
Your task: Remove any word that does not start with a capital letter. For instance, for the input text of "Hello, 2022 world!", we should get "Hello, 2022 !".
You have a card on which the letter J is written on one side and K on the other. You want to seeall of the possible ways the card will land if you drop it n times. Write a recursive method thatprints each session of dropping the cards with J's and K's. For example if you drop it 4 times in agiven session, all possible ways to drop it are as follows (in exactly the specified order): J J J JJ J J KJ J K JJ J K KJ K J JJ K J KJ K K JJ K K KK J J JK J J KK J K JK J K KK K J JK K J KK K K JK K K K
Improve the method printList to print out the details of all publications ordered on the category of the publications, and then on the title within each category. Note: currently there are only 2 categories, i.e. Book and Journal, but the project may be expended by adding other categories, e.g. Newspaper etc. Here are my four classes. public class Database {private ArrayList<Publication> publicationList; // An array list collection of publications /*** Create a new database*/public Database() {publicationList = new ArrayList<Publication>();} /*** Add a publication** @param publication The publication to be added*/public void addPublication(Publication publication) {if (publicationList.contains(publication)) {System.out.println("This publication has already been added to the list: " + publication);} else {publicationList.add(publication);}} /*** Get the total number of publications** @return The total number of publications*/public int getTotal() {return…
Write a simulation of T20 match. There are two teams, Team A and Team B. For every balldelivered generate a random number from -1 to 6 (both inclusive). A -1 means that batsmanis out, any other number is the runs scored on that delivery. A 0 in this case represent a dot ball.After every 12 balls, generate a random value which represents the weather conditions.Random Number Weather Condition Score Limits0 Sunny 0-61 Cloudy 0-42 Windy 0-33 Drizzle 0-24 Rain Match stoppedTeam A plays continuously until all players are out or 120 balls are delivered or match is stoppeddue to the rain.Team B plays continuously until all players are out or 120 balls are delivered they have scoredmore than Team A or match is stopped due to rain. Every time a rain event occurs, deduct 12balls from both innings. A match result should be draw if any of the innings is less than 18 balls.You have to maintain 2d array, store player id and player score. Count total scores of teamsdepending upon preceding…
Identify errors from the following program and correct them. import java.swing.*; import java.awt.*; public class Cake extends Panel { public final double CREAM_CHEESE = 0.50 public final double BUTTER = 0.25; public final double PEACH_JELLY = 0.75; public final double BLUEBERRY_JAM = 0.75; private JCheckBox creamCheese; private JCheckBox butter; private JCheckBox peachJelly; private JCheckBox blueberryJam; public Cake() { setLayout new GridLayout(4, 1)); creamCheese = new JCheckBox("Cream cheese"); butter = new JCheckBox("Butter"); peachJelly = new JCheckBox("Peach jelly"); blueberryJam = new JCheckBox("Blueberry jam"); setBorder(BorderFactory.createTitledBorder("Cake Decorations")); add(creamCheese); add(butter); add(peachJelly); add(blueberryJam); } public double getDecorationCosts() { double decorationCosts = 0; if (creamCheese.isSelected()) decorationCosts += CREAM_CHEESE; if (butter.isSelected()) decorationCosts += BUTTER; if (peachJelly.isSelected())…
Write an improved version of the chaos . py program from Chapter 1 thatallows a user to input two initial values and the number of iterations, and then prints a nicely formatted table showing how the values changeover time. For example, if the starting values were . 25 and . 26 with 10iterations, the table might look like this: index 0.25 0.26----------------------------1 0 . 731250 0 . 7503602 0 . 766441 0 . 7305473 0 . 698135 0 . 7677074 0 . 821896 0 . 6954995 0 . 570894 0 . 8259426 0 . 955399 0 . 5606717 0 . 166187 0 . 9606448 0 . 540418 0 . 1474479 0 . 968629 0 . 49025510 0.118509 0 . 974630
The obvious next step is to name the stars and planets using random numbers. Names usually follow certain rules rather than being made up of random strings of characters. Choose a set of real-world names (for example, from J.R.R. Tolkien's world) and create a set of rules for them to follow. Create and implement a method for generating new names based on a set of rules and random numbers.
A dog is running up a staircase with n steps and can hop either 1 step, 2 steps, or 4 steps at a time. Implement a method to count how many possible ways the dog can run up the stairs. Note that for n = 1, 2, and 4 there are 1, 2, 6 ways to run up the stairs, respectively. [Adapted from CCI, pg. 150]