1answer.
Ask question
Login Signup
Ask question
All categories
  • English
  • Mathematics
  • Social Studies
  • Business
  • History
  • Health
  • Geography
  • Biology
  • Physics
  • Chemistry
  • Computers and Technology
  • Arts
  • World Languages
  • Spanish
  • French
  • German
  • Advanced Placement (AP)
  • SAT
  • Medicine
  • Law
  • Engineering
Alchen [17]
3 years ago
14

Write an application for Cody’s Car Care Shop that shows a user a list of available services: oil change, tire rotation, battery

check, or brake inspection. Allow the user to enter a string that corresponds to one of the options, and display the option and its price as $25, $22, $15, or $5, accordingly. Display Invalid Entry if the user enters an invalid item.
Computers and Technology
1 answer:
Firdavs [7]3 years ago
3 0

An application for Cody’s Car Care:

#include <iostream>

#include <string>

#include <vector>

using namespace std;

int main()

{

vector<string>stroptions(4);

stroptions[0] = "Oil Change";

stroptions[1] = "Tire Rotation";

stroptions[2] = "Battery Check";

stroptions[3] = "Brake Inspection";

 

vector<int> intprices(4);

intprices[0] = 45;

intprices[1] = 22;

intprices[2] = 15;

intprices[3] = 10;

 

int option;

cout<< "Welcome to Joe's Car Care Shop!" <<endl;

cout<< "Choose a service from our menu:" <<endl;

for(int i = 1; i<= 4; i++)

{

  cout<< "#" <<i<< ": " <<stroptions[i-1] <<endl;

}

cout<< "Choice: ";

bool loop = true;

while(loop)

{

  loop = false;

  cin>> option;

 switch(option)

  {

   case 1:

     cout<< "\nA " <<stroptions[option-1] << " will be: $" <<intprices[option -1] <<endl;

     break;

   case 2:  

     cout<< "\nA " <<stroptions[option -1] << " will be: $" <<intprices[option -1] <<endl;

     break;

   case 3:

     cout<< "\nA " <<stroptions[option -1] << " will be: $" <<intprices[option -1] <<endl;

     break;

   case 4:

     cout<< "\nA " <<stroptions[option -1] <<" will be: $" << intprices[option -1] <<endl;

      break;

    default:

     cout<< "\nYou entered an invalid item! Try again!" <<endl;

     loop = true;

     break;

 }

}

}

You might be interested in
The best presentations try to include as much text as possible on each slide true or false ​
Zina [86]
True is answered of that question
5 0
3 years ago
A bubble starts by comparing the first item in the list to all the remaining items, and swaps where the first item is ____ a lat
Alina [70]

Answer:

greater than

i think

5 0
3 years ago
Read 2 more answers
The first step to changing lanes is
lisov135 [29]
It’s obviously C.Signaling your intent by using your blinkers also known as the lights at the back of your car!
3 0
3 years ago
Read 2 more answers
What are events in computer programming?
N76 [4]

Answer:

mnkn

Explanation:

3 0
3 years ago
Read 2 more answers
Recall that within the ArrayBoundedQueue the front variable and the rear variable hold the indices of the elements array where t
Citrus2011 [14]

Answer:

int n = elements.length;

if(rear < n) {

rear = (rear + 1) % n;

elements[rear] = element;

rear = rear + 1;

}

Explanation:

Options are not made available; However, I'll answer the question base on the following assumptions.

Assumptions

Array name = elements

The front and the rear variable hold the current indices elements

Element to enqueue is "element" without the quotes

To enqueue means to add an element to an already existing queue or to a new queue.

But first, the queue needs to be checked if it can accept a new element or not; in other words, if it's full or not

To do this, we check: if rear < the length of the queue

If this statement is true then it means the array can accept a new element; the new element will be stored at elements[rear] and the rear will be icremented by 1 rear by 1

Else if the statement is false, then an overflow is said to have occurred and the element will not be added.

Going by the above explanation, we have

int n = elements.length;

if(rear < n) {

rear = (rear + 1) % n;

elements[rear] = element;

rear = rear + 1;

}

Additional explanation:

The first line calculates the length of the queue

The if condition on line 2 tests if the array can still accept an element or not

Let's assume this statement is true, then we move to liine 3

Line 3 determines the new position of rear.

Let's assume that n = 6 and current rear is 4.

Line 3 will produce the following result;

rear = (rear + 1) % n;

rear = (4 + 1)% 6

rear = 5%6

rear = 5.

So, the new element will be added at the 5th index

Then line 4 will be equivalent to:

elements[rear] = element;

elements[5] = element;

Meaning that the new element will be enqueued at the 5th index.

Lastly, rear is incremented by 1 to denote the new position where new element can be added.

6 0
3 years ago
Other questions:
  • you install teamviewer on your workstation at home so that you can ac ess it when on the road. how can you be assured that unkno
    9·1 answer
  • [Java] Using the comparable interface
    13·1 answer
  • 50 POINTS!!!!
    8·1 answer
  • A network technician is tasked with designing a firewall to improve security for an existing FTP server that is on the company n
    9·1 answer
  • 14. Which of the following is NOT likely to be one of the future development gaming industry?
    7·1 answer
  • Have all of my coins because i will delete acount there will be part 2, 3 , 4 ,5,6,7,8
    15·2 answers
  • The illustration shows different types of text language.
    5·2 answers
  • Class 10 computer unit 1 all excersise​
    12·1 answer
  • 1.a computer can create an output based on the input of the user.
    13·1 answer
  • To set up scenarios,then set up a list, then set up the reference cell. to set up the cells that display the output results from
    9·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!