Fuel efficiency of a multi-leg journey Program Plan: Declare the “MPG” function. Assign the values to the variables. Iterate the “for” loop until it reaches the last line in the text file. Set the value. Check “leg” is not equal to newline. In “try” block, Split the odometer reading and amount of gas from the user input and assign it into the separate variables. Increment the “count” value. Calculate the distance traveled, total distance. Calculate the MPG for leg. Set the new odometer reading. Display the leg. Add values to trip total. Break the function. In exception block, break the function. Return the value to the main function. Declare a main function. Inside the main function, Get the input file name from the user. Open the file. Get the starting odometer reading from the user. Call the function “MPG”. Calculate the total MPG. Display the result. Call the main function.

Question

Want to see the full answer?

Answer 1

Question

Chapter 8, Problem 10PE

Program Plan Intro

Fuel efficiency of a multi-leg journey

Program Plan:

Declare the “MPG” function.

Assign the values to the variables.

Iterate the “for” loop until it reaches the last line in the text file.

Set the value.

Check “leg” is not equal to newline.

In “try” block,

Split the odometer reading and amount of gas from the user input and assign it into the separate variables.

Increment the “count” value.

Calculate the distance traveled, total distance.

Calculate the MPG for leg.

Set the new odometer reading.

Display the leg.

Add values to trip total.

Break the function.

In exception block, break the function.

Return the value to the main function.

Declare a main function. Inside the main function,

Get the input file name from the user.

Open the file.

Get the starting odometer reading from the user.

Call the function “MPG”.

Calculate the total MPG.

Display the result.

Call the main function.

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Students have asked these similar questions

Exercise 1 Function and Structure [30 pts] Please debug the following program and answer the following questions. There is a cycle in a linked list if some node in the list can be reached again by continuously following the next pointer. #include typedef struct node { int value; struct node *next; } node; int 11_has_cycle (node *first) if (first == node *head = { NULL) return 0; first; while (head->next != NULL) { } if (head first) { return 1; } head = head->next; return 0; void test ll_has_cycle () { int i; node nodes [6]; for (i = 0; i < 6; i++) { nodes [i] .next = NULL; nodes [i].value = i; } nodes [0] .next = &nodes [1]; nodes [1] .next = &nodes [2]; nodes [2] .next = &nodes [3]; nodes [3] .next nodes [4] .next &nodes [4]; NULL; nodes [5] .next = &nodes [0]; printf("1. Checking first list for cycles. \n Function 11_has_cycle says it has s cycle\n\n", 11_has_cycle (&nodes [0])?"a":"no"); printf("2. Checking length-zero list for cycles. \n Function 11_has_cycle says it has %s…

how to read log logs

Discrete Mathematics for Computer Engineering