What is the output from main (below) after the following function is called. void calculateCost(int count, double& subTotal, double& taxCost) // definition { if ( count < 10) subTotal = count * 0.50; else subTotal = count * 0.20; taxCost = 0.1 * subTotal; } int main() { double tax = 0.0, subTotal = 0.0; calculateCost(15, subTotal, tax); // function call cout << "The cost for 15 items is " << subTotal << ", and the tax for "<< subTotal << " is " << tax << endl; return 0; }

Answers

Answer 1

Answer:

Explanation:

Related Questions

Which method can be used to place an item at a specific index in a list?

a. append
b. add index
c. insert

Answers

To position an item at a given index in a list, use the insert method. adds a new item to a combo box or selection list before a particular item is selected.

Which procedure can be used to insert an item into a list at a given index?

The extend() method appends a new data collection to a list while the insert() method appends a new item at the specified index, append() adds a new item to the end of a list, and append() adds a new item to the last index of a list.

What variety of inserts are there?

There are two main categories of inserts: those held in place by external threads and those that rely on alternative holding mechanisms (such as knurling, grooves, and interference fits) in lieu of threads.

To know more about index visit :-

https://brainly.com/question/14297987

#SPJ4

What is the difference between planks and boards?

Answers

Answer:

Planks are often used as a work surface on elevated scaffolding and need to be wide enough to provide strength without breaking when walked on. The wood is categorized as a board if its width is less than 21⁄2 in (64 mm), and its thickness is less than 11⁄2 in (38 mm).

2. Busy intersection There is a busy intersection between two one-way streets: Main Street and 1st Avenue. Cars passing through the intersection can only pass through one at a time. When multiple cars arrive at the intersection at the same time, two queues can build up - one for each street. Cars are added to the queue in the order at which they arrive. Unfortunately, there is no traffic light to help control traffic when multiple cars arrive at the same time. So, the local residents have devised their own system for determining which car has priority to pass through the intersection: - If in the previous second, no car passed through the intersection, then the first car in the queue for 1 st Avenue goes first. - If in the previous second, a car passed through the intersection on 1st Avenue, then the first car in the queue for
1st
Avenue goes first. - If in the previous second, a car passed through the intersection on Main Street, then the first car in the queue for Main Street goest first. Passing through the intersection takes 1 second. For each car, find the time when they will pass through the intersection. Function Description Complete the function getResult in the editor below. getResult has the following parameters: int arrival [n]: an array of
n
integers where the value at index
i
is the time in seconds when the
i th car arrives at the intersection. If arrival[i]
=
arrival[j] and
i , then car
i
arrives before car
j
. int street[n]: an array of
n
integers where the value at index
i
is the street on which the
t th car is traveling: Street and 1 for 1 st Avenue. Returns:
int[n]:
an array of
n
integers where the value at index
i
is the time when the
i th car will pass through the intersection Constraints -
1≤n≤10 5
-
0≤arrival[i]≤10 9
for
0≤i≤n−1
- arrival[i]
≤
arrival[i
+1]
for
0≤i≤n−2
-
0≤s
street
[i]≤1
for
0≤i≤n−1

Answers

The program that can be used to illustrate the information of busy intersection between two one-way streets is given below.

The program that features the cars will be:

def getResult(arrival, street):

# Write your code here

result = []

# The first car arrives on Main Street at time 0. The first car arrives on 1st Avenue at time 0. The second car arrives on Main Street at time

1. The third car arrives on 1st Avenue at time 5.

time = 0

main_street_queue = []

first_avenue_queue = []

while len(main_street_queue) > 0 or len(first_avenue_queue) > 0:

if len(main_street_queue) == 0:

car_to_add_to_result = first_avenue_queue.pop(0)