Sale!

COP3223 Intro to C Programming Assignment 2 Solved

$35.00

Category:

Description

5/5 - (1 vote)

Problem A: Roller Coaster Design (coaster.c) (30 points)

Every great theme park has a signature roller coaster. In designing a roller coaster, we must decide how many trains of cars need to be placed on the track. It turns out that no more than 25% of the track can be occupied with these trains to adhere to safety regulations.

 

Thus, if the track is 1000 feet long, and a train is 42 feet long, then up to 5 trains can fit on the track. (To see this, note that 5 trains have a total length of 210 feet, and this value is 21%, less than or equal to 25%, of the total track length of 1000 feet. Note that 6 trains would take up 252 feet, or 25.2% of the track, which is too much.)

 

In a train of cars, the first car is 10 feet long and all subsequent cars are 8 feet long. All cars seat up to 4 people. Since each of these values is constant, please use the following constants to store them:

 

#define FIRST_CAR_LENGTH 10

#define NORMAL_CAR_LENGTH 8

#define CAR_CAPACITY 4

 

For this program, the user will enter the total length of the track and the maximum length of the trains for the track. It is assumed that the trains formed will be as long as possible. For example, if the user enters 30 for the maximum length of the train, then the actual trains will have three cars and be of  length 26, since a four car train would exceed 30 feet.

 

Your program should calculate the number of people that can be supported on the track at one time. (Note: It may be the case that more people can be supported by making a shorter train than possible, but for this particular assignment, maximize the size of each train.)

 

Input Specification

  1. The total length of the track will be a positive integer (in feet) less than 10000.
  2. The maximum length of a train will be a positive integer in between 10 and 100.

 

Output Specification

Output the maximum number of passengers on the roller coaster at any one time with a single statement of the following format:

 

Your ride can have at most X people on it at one time.

 

Early Output Samples

At first, two sample outputs of running the program are included below. Note that these samples are NOT a comprehensive test. You should test your program with different data than is shown here based on the specifications given above.

 

Sample Run #1

What is the total length of the track, in feet?

1000

What is the maximum length of a train, in feet?

42

Your ride can have at most 100 people on it at one time.

 

(Note: Each train has 5 cars on it, and each car has 4 people, at most. Thus, 20 people can sit in one train. As previously established, 5 trains is the maximum for this track, so the maximum number of people this roller coaster can support is 100.)

 

Sample Run #2

What is the total length of the track, in feet?

1000

What is the maximum length of a train, in feet?

49

Your ride can have at most 100 people on it at one time.

 

 

Sample Run #3

What is the total length of the track, in feet?

1000

What is the maximum length of a train, in feet?

18

Your ride can have at most 104 people on it at one time.

 

 

 

Sample Run #4

What is the total length of the track, in feet?

1000

What is the maximum length of a train, in feet?

59

Your ride can have at most 112 people on it at one time.

COP3223 Intro to C

 

 

 

 

Problem B: Roller Coaster Redesign (coasterTwo.c)(50 points)

Your boss has noticed that maximizing the length of the train does not always maximize the number of passengers. She’s come up with a great idea for you to improve your program, so that you can calculate the actual maximum number of passengers the roller coaster can support. Her idea is as follows:

 

Let’s say the maximum length of a train is 55. Then, we can simply start by trying out a train of length 10 (one car), and seeing how many passengers such a train would support. Then, we can try a train of length 18 (two cars) and recalculate the number of passengers this design would support. If this is better than the best design we’ve seen so far, simply save this new value. Continue in this fashion, until we’ve tried all possible trains.

 

In this situation, we would try trains of lengths 10, 18, 26, 34, 42, and 50. (We stop here because the next train, of length 58, would be too long.) In each of these candidate lengths, compute the following quantity: total rollercoaster passengers divided by the total length of all the trains. Store each  value in an array, so you will be storing as many values as there are lengths. Finally, compute the average of those values, and print it out as a final answer.

 

The user will input the same information as was inputted in Part A.

Note that this time you will not be inputting the number N, and you will not print the message about the surplus. This time, however, your program should output the actual number of maximum people the ride can support, the number of cars per train that achieves this maximum, and the final average of the passengers/length ratio.

 

Do the problem in small stages. First, ensure that you are getting the correct enumeration of the various train-lengths, then (for each train lengthcalc) compute how many trains can fit on the track; that gives the number of people on the track simultaneously, check if this beats the max-so-far, if so, replace max. For each train length choice, you need to compute the ratio of people to cumulative car length, and (it is a good idea to) store this in a one-dimensional array that can store decimal values. Finally, compute the average of the ratios, and print that out.

 

 

Input Specification

  1. The total length of the track will be a positive integer (in feet) less than 10000.
  2. The maximum length of a train will be a positive integer in between 10 and 100, inclusive.

 

Output Specification

The output should consist of three lines. The first line outputs the maximum number of passengers on the roller coaster at any one time with a single statement of the following format:

 

Your ride can have at most X people on it at one time.

 

The second line should output the number of cars in the train that achieves this maximum with a single statement of the following format:

 

This can be achieved with trains of Y cars.

 

Note: If there are multiple ways in which the maximum number of people can be supported, output the smallest number of cars that achieves this maximum. (Thus, if both 2 cars and 4 cars lead to 100 people on the ride and this is the maximum, then your program should output 2 cars.)

 

The third line should simply output the average value of people to length, as:

 

AVG Ratio: XXXX.XXX

 

 

Output Samples

Two sample outputs of running the program are included below. Note that these samples are NOT a comprehensive test. You should test your program with different data than is shown here based on the specifications given above.

 

 

 

Sample Run #1

What is the total length of the track, in feet?

1000

What is the maximum length of a train, in feet?

42

Your ride can have at most 112 people on it at one time.

This can be achieved with trains of 4 cars.

AVG Ratio: 0.451

 

 

(Note: The maximum is achieved when each train has 4 cars on it, and each car has 4 people, at most. Thus, 16 people can sit in one train. This train has a length of 34 feet, and since 34 feet x 7 = 238 feet, which is less than 25% of the total track length, this means that exactly 7 trains can be placed on the track at the same time. Thus, 16 people/train x 7 trains = 112 people total.)

 

Sample Run #2

What is the total length of the track, in feet?

4025

What is the maximum length of a train, in feet?

89

Your ride can have at most 480 people on it at one time.

This can be achieved with trains of 6 cars.

AVG Ratio: 0.467

COP3223 Intro to C

 

Problem C: Practice Strings  (lastnames.c)(10 points)

 

Read in n, then n lastnames, and check to see if the first in the list is ever repeated again.

 

Sample Run #1

Enter n, followed by n Last names (each last name must be a single word):  

5 Reagan Bush Clinton Bush Obama

First name in list is not repeated.

 

Sample Run #2

Enter n, followed by n Last names (each last name must be a single word):

4 Bush Clinton Bush Obama

First name in list is repeated.

COP3223 Intro to C

 

 

Part D: Embed all the above Parts in a menu (menu.c) (10 points)

 

Write this similar to bankinclass.c

 

Deliverables

Four source files:

 

1) coaster.c, for your solution to problem A

2) coasterTwo.c for your solution to problem B

3) lastnames.c for your solution to problem C

            4) menu.c for your solution to part D.

 

All files are to be submitted over WebCourses2, Canvas.

 

Restrictions

Although you may use other compilers, your program must compile and run using Dev C++. Your programs should include a header comment with the following information: your name, course number, section number, assignment title, and date. Include comments throughout your code describing the major steps in solving the problem.

 

Grading Details

Your programs will be graded upon the following criteria:

 

1) Your correctness.

 

2) Your programming style. Even if your program works perfectly, if your programming style is poor, you could get 5% deducted from your grade.

 

3) Compatibility to Dev C++ (in Windows).  If your program does not compile in this environment, you will get a sizable deduction from your grade.

COP3223 Intro to C