Now we go over to look at the stands. It has ståtribuner and their stands. All stands have a name, capacity and price. His Terraces also has a number of seat rows. We assume that all the rows are the same length, so that the number of seats each. row is the capacity divided by the number of rows.

For ståtribunene you only need to keep track of how many seats are sold, while at their stands, one must know how many are sold on each row. We assume that the seats are sold in ascending order within each row. In addition, we assume that the program, not the buyer, determine which row to use, something you will need for the task c

Some stands are the VIP stands. There we will also keep track of the name of those who will sit on the various sites.

Task A:

Tribune classes shall have the following instance variables (not given in the exam, but are given here because you have not yet come as far as the exam):

Class Tribune:

private final String name grandstand;
private final int capacity;
private final int price;

The class Staa:

private int antSolgteBilletter;

Ride class:

private int [] antOpptatt / / table size: the number of rows

The class VIP:

private String [] [] spectator / / table size: the number of rows * number of seats per row

Draw a class diagram corresponding to Figure 1, for stand-classes. You will have a total of 4, or 5, stand classes. This class diagram you will not need to submit.

In the following we assume that all instance variables are private. Constructors and access methods need to program as you need them.

Task B:

For all stand types, we have methods to find the number of tickets sold () and find income (). Income is the price multiplied by the number of tickets sold. Programs this.

(Hint: Both of these methods should exist in the class Tribune.)

Task C:

Now you can program your ticket purchase. This will be done by creating two methods (in stand-classes), both called buy tickets (), which returns an array of ticket objects. The first method takes as parameters the number of tickets requested, the other takes as parameter a table of text strings (the name of those who will have tickets). For all stand types except the VIP stands, the two methods give the same results as method one, while the VIP grandstands method should return a zero (no one can buy a ticket on the VIP grandstands without giving names). For all types of stand is that if you want more tickets than can be processed, you get none. At its limit this stands the fact that all tickets sold in an order, should be on the same row. On ståtribuner only the total capacity and how many so far been sold, which puts limitations.

(Hint: Both buy tickets () methods to exist in the class Tribune.)

Task D:

Make a small test program where you create two ståtribuner, a regular grandstand seating and a VIP grandstand. Collect the stands in a table of type Tribune [].

Buy tickets for all the stands, and print the tickets.

For each stand, you should also print tribune's name, capacity, number of tickets sold and revenue. (You may want to have a toString () method in class Tribune do the job.)