C++ 2. A theater seating chart is implemented as a two-dimensional array of ticket prices, Like this 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 20 20 20 20 20 20 10 10 10 10 20 20 20 20 20 20 10 10 10 10 20 20 20 20 20 20 10 10 20 20 30 30 40 40 30 30 20 20 20 30 30 40 50 50 40 30 30 20 30 40 50 50 50 50 50 50 40 30 Write a program that prompts users to pick either a seat or price. Mark sold seats by changing the price to 0. When a user specifies a seat, make sure it is available. When a user specifies a price, find any seat with that price.
C++
2. A theater seating chart is implemented as a two-dimensional array of ticket prices,
Like this
10 10 10 10 10 10 10 10 10 10
10 10 10 10 10 10 10 10 10 10
10 10 10 10 10 10 10 10 10 10
10 10 20 20 20 20 20 20 10 10
10 10 20 20 20 20 20 20 10 10
10 10 20 20 20 20 20 20 10 10
20 20 30 30 40 40 30 30 20 20
20 30 30 40 50 50 40 30 30 20
30 40 50 50 50 50 50 50 40 30
Write a program that prompts users to pick either a seat or price. Mark sold seats by changing the
price to 0. When a user specifies a seat, make sure it is available. When a user specifies a price,
find any seat with that price.
3. A supermarket awards coupons depending on how much a customer spends on groceries.
For example, if you spend Ghc50, you will get a coupon worth eight percent of that amount.
The following table shows the percent used to calculate the coupon awarded for different
amounts spent.
Write a program that calculates and prints the value of the coupon a person can receive based on groceries purchased.
Here is a sample run:
Please enter the cost of your groceries: 14
You win a discount coupon of Ghc 1.12. (8% of your purchase)
Money Spent Coupon Percentage
Less than Ghc10 No coupon
From Ghc10 to Ghc60 8%
More than Ghc60 to Ghc150 10%
More than Ghc150 to Ghc210 12%
More than Ghc210 14%
4. Write array functions that carry out the following tasks for an array of integers. For each function,
provide a test program.
a. Swap the first and last element in an array.
b. Shift all elements by one to the right and move the last element into the first position. For
example, 1 4 9 16 25 would be transformed into 25 1 4 9 16.
c. Replace all even elements with 0.
d. Replace each element except the first and last by the larger of its two neighbors.
e. Remove the middle element if the array length is odd, or the middle two elements if the length
is even.
f. Move all even elements to the front, otherwise preserving the order of the elements.
g. Return true if all elements of the array are identical.
h. Return the second-largest element in the array.
i. Return true if the array is currently sorted in increasing order.
j. Return true if the array contains two adjacent duplicate values.
k. Return true if the array contains duplicate values (which need not be adjacent
Trending now
This is a popular solution!
Step by step
Solved in 4 steps with 2 images
