PLZ help with the following:In Java Figure 2 and Figure 3 show the sample outputs.>>>>>>Welcome to "FastestPath">>>>>>For the following path:0 5 90 7 61 12The shortest time to the end is 24>>>>>>>Figure 2: Sample output>>>>>»Welcome to "FastestPath">>>>>>For the following path:e 15 27 9 12 26 32The shortest time to the end is 68<<<<<<< The game of "FastestPath" consists of a path (a 1-D array) withn positive integers to represent ncities in a path (except the first index which has always value 0). The aim of the game is to movefrom the source city (located at index 0) to destination (located at last index) in the shortest time.The value at each index shows the travel time to enter the city located in the corresponding index.Here is a sample path where there are 6 cities (n is 6):|590 761 12Always start the game from the first city and there are two types of moves. You can either moveto the adjacent city or jump over the adjacent city to land two cities over. The total travel time ofa game is the sum of the travel times of the visited cities.In the path shown above, there are several ways to get to the end. Starting in the first city, our timeso far is 0. We could travel to city 2, then travel to city 4, then travel to last city for a total traveltime of 90 + 61 + 12 = 163. However, a fastest path would be to travel to city 1, then travel to city3, and finally travel to last city, for a total travel time of 5 + 7+ 12 = 24.Write a recursive solution to this problem that computes the shortest travel time of the game anddisplay in the output. Your program does not have to output the actual sequence of moves, onlythe shortest travel time of this sequence.Figure 2 and Figure 3 show the sample outputs.

//Program in Javaimport java.util.Arrays;import java.util.Scanner; public class Main{ // function…

Write a recursive solution to this problem that computes the shortest travel time of the game and display in the output. Your program does not have to output the actual sequence of moves, only the shortest travel time of this sequence.

Write a recursive solution to this problem that computes the shortest travel time of the game and display in the output. Your program does not have to output the actual sequence of moves, only the shortest travel time of this sequence.

Programming Logic & Design Comprehensive

9th Edition

ISBN:9781337669405

Author:FARRELL

Publisher:FARRELL

Chapter6: Arrays

Section: Chapter Questions

Problem 17RQ

See similar textbooks

Related questions

Q: The Fibonacci series: 0, 1, 1, 2,3,5,8,13,21... begins with terms 0 and 1 and has the property that…

A: The program is written in C Language. Please find the source code and output in the following steps.

Q: Write a recursive method that will compute the number of even digits in anumber.

A: "Since you have not mention any programming language, so will write our program in C language". C…

Q: Write a program to find s of the following equation by using recursive function

A: Write a program to find s of the following equation by using recursive function:

Q: The following program is a non-recursive solution. Fill out the numbered blanks in the program and…

A: Working of a Douglas Peuskar Algorithm

Q: There is an error in the following recursive method, which implements a binary search. Find the…

A: First of all, the array a should be declared at class level or else it should be passed as parameter…

Q: This program has a bug that leads to infinite recursion. Modify fn(int x, int y) method to fix the…

A: The bug is a logical error that produces incorrect errors or halts the program execution due to a…

Q: Write a recursive function print that, given an integer number p > 0, prints counting forward from 1…

A: #include<iostream>using namespace std;//recursive functionvoid print(int p){ //base…

Q: Write a recursive method for countdown. For example, if the user enters 10, the method should…

A: Code: As no coding language is specified providing the code in c++: #include <iostream>using…

Q: implement two recursive versions of the linear search that gets an array of songs and a title and…

A: NOTE Below is the answer for the given question. Hope you understand it well. If you have any…

Q: The recursive call in the following method is ____________________. int factorial(int n) {…

A: Given: The recursive call in the following method is ____________________. int factorial(int n) {…

Q: In this problem, you will write different programs to x^N, where x ∈ R, n ∈ N. b) Devise a…

A: Please refer below for your reference: Language used is C++: 1) Using pow method: #include…

Q: Write a recursive function that computes and returns the sum of all elements in an array, where the…

A: public class Main{ //recursive function to compute and return the sum of all elements in an array…

Q: Write a direct and indirect recursive method for validating input data for the triangle program.…

A: The equations given for the triangle are:- float s = (sA + sB + sC) / 2; float per = (sA + sB +…

Q: write a recursive method to schedule compatible activities that result in the maximum usage of the…

A: Algorithm: We will first sort the activity array according to the stop time. Then we will apply…

Q: using python! Write a recursive function stars that excepts a positive integer as an argument and…

A: Python is used to answer this question.

Q: Write a recursive method named displayStars to generate a pattern of stars with numbers such as the…

A: I have given an answer in step 2.

Q: Write a recursive function called PrintNumPattern() to output the following number pattern. Given a…

A: Here, Code instruction is given.

Q: When a program has a logic error and reaches an infinite recursion the program is always going to…

A: Given : When a program has a logic error and reaches an infinite recursion the program is always…

Q: g(x) = g(x - 1) * g (x - 3) if x is even and x > 3 = g(x - 2) if x is odd and x > 3 = x…

A: The base case is when X is less than or equal to 3 and in all other cases we call the function…

Q: The word ladder game was invented by Lewis Carroll in 1877. The idea is to begin with a start word…

A: import java.io.BufferedReader; import java.io.File; import java.io.FileReader; import…

Q: Write a python program to print an for n=0,1,2,3,4,5 for the above recursive function. Check the…

A: Given: Write a python program to print an for n=0,1,2,3,4,5 for the above recursive function.

Q: A positive integer is entered through the keyboard, write a function to display the Fibonacci series…

A: Note: Here you didn't mention any programming language so we are going to solve this problem using…

Q: Do it quickly I don't have my system right now so i need your help Write a program to take…

A: NOTE: As the programming language is not mentioned in the question. So, we have solved this question…

Q: Write a program to display a fibonacci series upto n terms using the recursive function.

A: As the programming language is not mentioned so I am using a C language to write a code. If you want…

Q: Can the Main function be called recursively? Write a simple program that counts and shows the number…

A: logic:- Yes, main function can be called recursively. Inside main function write one statement i.e…

Q: Write a recursive function called print_num_pattern() to output the following number pattern. Given…

A: Here is the python code: num1 = 12num2 = 3def print_num_pattern(num1,num2): if (num1 == 0 or…

Q: A recursive sequence is defined by - d k = 6 d k − 1 + 3 , for all integers k ≥ 2 and d1 = 2 Use…

A: The above given question needed little correction as it is not satisfy the recursive function.…

Q: Write a recursive program that takes a positive integer as an input and returns the sum of the…

A: The program is completed in python. Here the input is: 45678 Output: 4+5+6+7+8 = 30

Q: Rewrite the function up() using the loop instead of the recursion, to do the same task.

A: Program: // C Program#include <stdio.h>// up functionint up(int x){ /* old code…

Q: Write a recursive method for countdown. For example, i the user enters 10, the method should perform…

A: Please fidn the answer below

Q: For this exercise, you are going to write a recursive function that counts down to a Blastoff! Your…

A: import java.util.Scanner; public class Countdown{public static void main(String[] args){// Start…

Q: Consider a network of streets laid out in a rectangular grid, In a northeast path from one point in…

A: Answer: Program plan: Include the required header file • Function Definition: o Define the…

Q: Java - Write an iterative method that calculates the SUM of all integers between 1 and a given…

A: //iterative method to calculates the sum of all integers between 1 and N public static int…

Q: Write a code to display a fibonacci series upto n terms using recursive function. Please make it…

A: As the programming language is not mentioned so I am using a C language to write a code. If you want…

Q: Create a program that asks a user to input a number and then finds the sum of digits of the number…

A: Here we have to write program that finds sum of digits of number using recursion in matlab

Q: Write a recursive function called numbers that receives a single integer value and will print the…

A: According to the Question Below the Complete Program: Program Output:

Q: Given a is a nonzero real number and n is a nonnegative integer. Write a program to compute a",…

A: PROGRAM EXPLANATION(C++): Include the header file. Define the base case like If n == 0 then a^0…

Q: What should the parameter inside the recursive function in LINE 11 contain so that when user enters…

A: In Step 2, I have provided CORRECT OPTION with brief explanation---------- In further steps ,…

Q: Write a recursive function, reverseDigits, that takes an integer as a parameter and returns the…

A: RECURSIVE FUNCTION: int rev_dig = 0; int base_pos = 1; //Recursive function int reverseDigits(int n)…

Q: The factorial of a number n is n! = n(n-1)(n-2)... (n(n-2))1. For instance, the factorial of 5 is:…

A: Coded using C language.

Q: Can the Main function be called recursively? Write a simple program that counts and shows the number…

A: The solution for the above given question is given below:

Q: Write a program to find the power of a number using the recursion.

A: Each time powerFunc() function is called with one less value of power till its value becomes 0.…

Q: True or False? The sequence is defined recursively as an = an-1]+[1; ao = 3 Then ag = 3 . True False

Q: Write a program that has a main() function that calls a recursive method repeatPrint(String s,…

A: We are going to use recursion in c++ to print the image shown above.

Q: The following recursion occurs when there are more than two calls for each non-base case: :…

A: Introduction: Recursion: The process in which a function calls itself directly or indirectly is…

Q: Given a positive integer num, sum all numbers from 0 to num that are divisible by 4 using recursion.…

A: class SolutionMethod { public int sumDivisible(int num) { // stopage condition if (num <= 0)…

Q: Write recursive function for blobDetect in picture through this code provided. #include #include int…

A: Answer: I have done code and also I have attached code and code screenshot as well as output

Concept explainers

Structured English

Structured English uses a simple English language to make structured programming easier for non-professionals. The program is divided into various parts that are known as logical statements. These statements are written in a simple English language.

Question

PLZ help with the following:

In Java

Figure 2 and Figure 3 show the sample outputs.
>>>>>>Welcome to "FastestPath">>>>>>
For the following path:
0 5 90 7 61 12
The shortest time to the end is 24
>>>>>>>
Figure 2: Sample output
>>>>>»Welcome to "FastestPath">>>>>>
For the following path:
e 15 27 9 12 26 32
The shortest time to the end is 68
<<<<<<<

The game of "FastestPath" consists of a path (a 1-D array) withn positive integers to represent n
cities in a path (except the first index which has always value 0). The aim of the game is to move
from the source city (located at index 0) to destination (located at last index) in the shortest time.
The value at each index shows the travel time to enter the city located in the corresponding index.
Here is a sample path where there are 6 cities (n is 6):
|
5
90 7
61 12
Always start the game from the first city and there are two types of moves. You can either move
to the adjacent city or jump over the adjacent city to land two cities over. The total travel time of
a game is the sum of the travel times of the visited cities.
In the path shown above, there are several ways to get to the end. Starting in the first city, our time
so far is 0. We could travel to city 2, then travel to city 4, then travel to last city for a total travel
time of 90 + 61 + 12 = 163. However, a fastest path would be to travel to city 1, then travel to city
3, and finally travel to last city, for a total travel time of 5 + 7+ 12 = 24.
Write a recursive solution to this problem that computes the shortest travel time of the game and
display in the output. Your program does not have to output the actual sequence of moves, only
the shortest travel time of this sequence.
Figure 2 and Figure 3 show the sample outputs.

Expert Solution

This question has been solved!

Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.

SEE SOLUTION Check out a sample Q&A here

Step 1

VIEW

Step 2

VIEW

Step by step

Solved in 2 steps with 1 images

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions

Implement a city database using ordered lists. Each database record contains the name of the city (a string of arbitrary length) and the coordinates of the city expressed as integer x and y coordinates. Your database should allow records to be inserted, deleted by name, and searched by name. Another operation that should be supported is to print all records within a given distance of a specified point/coordinate. The order of cities should be alphabetically by city name. Implement the database using: an array- based list implementation. By using JAVA.
Retrieving a value using its associated key can be accomplished using anindexer, which works just like an indexer for an array. A key is passed in asthe index value, and the value associated with the key is returned, unless thekey doesn’t exist, in which a null is returned.Write short code segment demonstrates how this technique works:
Sudoku is a popular logic puzzle that uses a 9 by 9 array of squares that are organized into 3 by 3 subarrays. The puzzle solver must fill in the squares with the digits 1 to 9 such that no digit is repeated in any row, any column, or any of the nine 3 by 3 subgroups of squares. Initially, some squares are filled in already and cannot be changed. For example, the following might be a starting configuration for a Sudoku puzzle: Create a class SudokuPuzzle.java Download SudokuPuzzle.java that has the attributes • board—a 9 by 9 array of integers that represents the current state of the puzzle, where 0 indicates a blank square • start—a 9 by 9 array of boolean values that indicates which squares in board are given values that cannot be changed and the following methods: • SudokuPuzzle—a constructor that creates an empty puzzle • toString—returns a string representation of the puzzle that can be printed • addInitial(row, col, value)—sets the given square to the given value as an…
Design and implement a service that simulates PHP loops. Each of the three loop variants should be encapsulated in an object. The service can be controlled via a parameter and execute three different simulations. The result is returned as JSON. The input is an array consisting of the letters $characters = [A-Z]. -The For loop should store all even letters in an array.-The Foreach loop simulation is to create a backward sorted array by For loop, i.e. [Z-A] .-The While loop should write all characters into an array until the desired character is found. Interface:-GET Parameter String: loopType ( possible values: REVERSE, EVEN, UNTIL )-GET parameter String: until (up to which character) Output:JSON Object: {loopName: <string>, result: <array> }
Given an 8-element array: A = {x1, X2, X3, X4, X5, X6, 7, x8}, we would like to find its 3rd smallest element. It is known that x₁ and 8 are the two extreme elements: max and min, but we do not know which one is the max and which one is the min. It is also known that x4 and x5 are the two medians: left-median and right-median. What is the minimum number of comparisons you need to find the 3rd smallest element of the original array? Ans:
Person receives text (string) messages on his/her phone. Message memory of a phone is very limited. A buffer is provided for storing messages when phone memory gets full. Message from buffer is loaded into phone memory when space is available. Messages are moved from buffer to phone in such a way that first received message is viewed first on screen. Implement buffer only using array. question solved in data structure
Java Programming language Chef recorded a video explaining his favorite recipe. However, the size of the video is too large to upload on the internet. He wants to compress the video so that it has the minimum size possible. Chef's video has N frames initially. The value of the ith frame is A₂. Chef can do the following type of operation any number of times: Choose an index i (1 ≤ i ≤ N) such that the value of the ith frame is equal to the value of either of its neighbors and remove the ith frame. Find the minimum number of frames Chef can achieve. Input 1 2 11 output 1
You are a movie theater manager. You are given a two-dimensional array with 6 rows and 6 columns - 36 elements with O value, that represent empty theater seats. All 36 tickets for session were sold, so you need to identify all of the seats with value 1. Write a program that replaces all O values in the given array, by 1 and outputs the resulting matrix. Use nested for-loops to iterate over two-dimensional matrix.
Function PrintArray(integer array(?) dataList) returns nothing integer i for i = 0; i < dataList.size; i = i + 1 dataList[i] = Get next input Put dataList to output Put "_" to output // Your solution goes here. Modify as needed i = 0 Complete the PrintArray function to iterate over each element in dataList. Each iteration should put the element to output. Then, put "_" to output. Ex: If dataList's elements are 2 4 7, then output is: 2_4_7_ Function Main() returns nothing integer array(3) userNums integer i for i = 0; i < userNums.size; i = i + 1 userNums[i] = Get next input PrintArray(userNums)
A deque DQUE is to be implemented using a circular one-dimensional array of size N. Execute procedures to:i) insert and delete elements from DQUE at either end;ii) implement DQUE as an output restricted deque;iii) implement DQUE as an input restricted deque;iv) for the procedures, what are the conditions used for testing whether DQUE is full (DQUE_FULL) and empty (DQUE_EMPTY)?
Given two arrays A and B of equal size N, the task is to find a vector containing only those elements which belong to exactly one array - either A or B - but not both. That is, if some element x appears in both A and B it should not be included in the output vector. Complete the implementation of "getVector(vector<ll>A, vector<ll>B, int N)" function. Example: Input: 1 3 5 7 1 3 2 4 6 7 8 Output: 3 5 1 3 2 4 6 8 The driver codes are attached in the images below. DO NOT CHANGE THE PROVIDED DRIVER CODES AT ALL, LEAVE THEM EXACTLY THE SAME. ONLY ADD CODE TO THE "getVector(vector<ll>A, vector<ll>B, int N)" FUNCTION
Write a program that inputs a matrix and displays the trans- pose of that matrix. A transpose of a matrix is obtained by converting all the rows of a given matrix into columns and vice versa.