12. Calculate the travel fare. Need C, C++, Java, Python, or Perl code for the below question. Important: Do not copy codes from prepinsta.com. Given, n=8, where n is number of total BusStops.BusStops = ["TH", "GA", "IC", "HA", "TE", "LU", "NI","CA"]Write a code with function getFare(String Source, String Destination) which takeInput as source and destination stops (in the format containing first two charactersof the Name of the Bus Stop) and calculate and return travel fare.Example 1:Input ValuescaCaOutput ValuesINVALID OUTPUTExample 2:Input ValuesNIHAOutput Values23.0 INRNote: Input and Output should be in format given in example.Input should not be case sensitive and output should be in the format INR.C++ Code: Question: A City Bus is a Ring Route Bus which runs in circular fashion. That is, Busonce starts at the Source Bus Stop, halts at each Bus Stop in its Route and at theend it reaches the Source Bus Stop again.If there are n number of Stops and if the bus starts at Bus Stop 1, then after nthBus Stop, the next stop in the Route will be Bus Stop number 1 always.If there are n stops, there will be n paths.One path connects two stops. Distances(in meters) for all paths in Ring Route is given in array Path[] as given below:Path = [800, 600, 750, 900, 1400, 1200, 1100, 1500]Fare is determined based on the distance covered from source to destination stopas Distance between Input Source and Destination Stops can be measured bylooking at values in array Path[] and fare can be calculated as per followingcriteria:• If d =1000 metres, then fare=5 INR. (When calculating fare for others, the calculated fare containing any fractionvalue should be ceiled. For example, for distance 900n when fare initiallycalculated is 4.5 which must be ceiled to 5)Path is circular in function. Value at each index indicates distance till current stopfrom the previous one. And each index position can be mapped with values atsame index in BusStops [] array, which is a string array holding abbreviation ofnames for all stops as-"THANERAILWAYSTN"="TH", "GAONDEVI" = "GA", "ICEFACTROY" = "IC","HARINIWASCIRCLE" = "HA", "TEENHATHNAKA" = "TE", "LUISWADI" = "LU","NITINCOMPANYJUNCTION"="NI", "CADBURRYJUNCTION" = "CA"Given, n=8, where n is number of total BusStops.BusStops = ["TH", "GA", "IC", "HA", "TE", "LU", "NI","CA"]Write a code with function getFare(String Source, String Destination) which takeInput as source and destination stops (in the format containing first two charactersof the Name of the Bus Stop) and calculate and return travel fare.Example 1:Input ValuescaCaOutput ValuesINVALID OUTPUT

I have used Python 3 to solve the above Question.

Answered: 12. Calculate the travel fare. Need C,…

12. Calculate the travel fare. Need C, C++, Java, Python, or Perl code for the below question. Important: Do not copy codes from prepinsta.com.

Operations Research : Applications and Algorithms

4th Edition

ISBN:9780534380588

Author:Wayne L. Winston

Publisher:Wayne L. Winston

Chapter20: Queuing Theory

Section: Chapter Questions

Problem 17RP

See similar textbooks

Similar questions

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…
A town wishes to build a trail between city A, city B, city C, city D, and city E. The distances, in miles, between any two of the destinations are given in the table. Use the table to answer parts (a) and (b) below. A B C D E A * 154 134 216 129 B 154 * 195 51 243 C 134 195 * 225 220 D 216 51 225 * 308 E 129 243 220 308 * a) Use Kruskal's algorithm to determine the minimum-cost spanning tree that would link each location to create the least expensive trail. Choose the correct graph below. A. ABCD154216225E129 B. ABCD15419551E129 C. ABCD15413451E129 D. ABCD154134216E129 b) If the cost of building such a trail is $3700 per mile, what is the cost of building the trail determined in part (a)? The cost is:
There are 2016 passengers about to board a plane, numbered 1 through 2016 in that order. Each passenger is assigned to a seat equal to his or her own number. However, the first passenger disregards instructions and instead of sitting in seat number 1, chooses and sits down in a randomly chosen seat. Each subsequent passenger acts according to the following scheme: if their assigned seat is available, they will sit there; otherwise, they will pick at random from the remaining available seats and sit there. What is the probability that the 1512th passenger ends up sitting in their assigned seat? A. 1/2016 B. 1/2 C. 5/8 D. 3/4 E. None of the above
Vehicle routing problems concern the linking of a group of customers who must be visited to a set of vehicles and respective drivers, also involving the programming and sequencing of visits. In the method that is based on the concept of gain, the worst possible situation is assumed: the vehicle leaves the DC with the goods destined for a single customer and, after delivery, the vehicle returns to the DC. Then another customer is inserted in this route. This method is known under the name of: ( ) Clark & Wright ( )Insertion of the furthest point ( ) II - OPT ( ) scan ( )III - OPT
A cell-phone carrier is allocated 642 radio frequencies to operate in a city with a hexagon pattern cell design. 42 of the frequencies is reserved for control channel and each phone call uses 2 frequencies per call (1 for transmitting and 1 for receiving). In an advance mobile phone service, use the frequencies distribution to answer the following question. If a pattern of cells has a reuse factor of 12, calculate the number of frequencies per cell for just receiving calls.
Bus timetables specify to the second the exact arrival and departure time of each bus on each stop. You need to pay for the full fare of every bus you ride and different bus lines charge different fees , but they are flat fees (independent of distance travelled on the line) A travel plan is a sequence of stop-time pairs where stop is a location of a bus stop and time is when we arrive at that stop. The plan is feasible if for any two consecutive pairs (a, t) and (b, t′) in the plan there exists a bus that departs after t and arrives at b at exactly t′. That is, a travel plan does not allow us to walk between stops. Assuming that no two buses arrive at the same time at the same stop, a feasible plan uniquely identifies the bus lines that we need to take to realize the plan. The cost of the plan is the sum of the fares we need to pay. Your task is to design an efficient algorithm that given a departure time t, an arrival time t′, an origin stop a and a destination stop b, finds the…
An airline association assigns three-letter codes to represent airport locations. For example, the airport code for Clark, Pampanga, is CPP. Notice that repetition is allowed in forming this code. How many airport codes are possible?
TM M = (Q, E, I, 6, 90, 9a, qr), where Q = {90, 91, 92, 9a, 9r}, Σ = {0, 1}, r = {0, 1, L}, and 8 is: 8(qo, U) = (qr, U, R) 8(90, 0) = 8(go, 1) (91, 0, R) (qo, 1, R) = 8(g1, L) = (ga, U, R) 8(91,0) = (91, 0, R) 8(91, 1) = (92, 1, R) = (92, U, R) 8(92, U) 8(92, 0) = (90, 0, R) 8(92, 1) = (92, 1, R) i. Prove that M is NOT a decider. ii. Mathematically describe the language A that M recognises. Prove that A ≤ L(M). iii. Prove A = L(M). iv. Is A Turing-decidable? [Give clear reasons for your answer. No need for a formal proof.]
If A = {1, 2, 6} and B = {2, 3, 5}, then the union of A and B is
Consider the following network: a.) Find the shortest path from node 1 to node 8 using Dijkstra’s algorithm. Write the length of the shortest path as well as the edges that compose it. b.) Write an integer programming formulation to find the second-shortest path from 1 to 8 in this network. (Hint: if the shortest path is not available, the second-shortest path becomes the shortest path.)
Imagine there are N teams competing in a tournament, and that each team plays each of the other teams once. If a tournament were to take place, it should be demonstrated (using an example) that every team would lose to at least one other team in the tournament.
After college, a group of students of a certain height planned to go to the movies. The cinema they go to is quite unique because the number of cinema rows is always 2 and the number of seats is as many as the number of students. Because this is a unique cinema, the way they sit is also unique. They will try to minimize their height difference with the one next to it so that the biggest height difference of each pair of students next to each other is as minimal as possible. Example: There are 6 students with height of 1, 6, 9, 7, 2, and 3. There are various sequences that can produce the biggest difference in height. Ordering 1:1 3 62 7 9Difference 1 and 3 is 2.Difference 3 and 6 is 3.Difference 2 and 7 is 5.Difference 7 and 9 is 2.So the biggest difference in height is 5. Ordering 2:1 3 26 7 9The biggest difference in height is 2.This difference is also an optimal answer. Format Input : There are T test cases. Each testcase contains integers N which indicates the number of students…