Lab Exercise #10
for labs meeting Tuesday, Nov. 26, 2002
An airline -- let's call it Cloud Nine Airways -- serves these cities:
Boston (BOS), Chicago (ORD), Newark (EWR), Philadelphia (PHL), Atlanta
(ATL), and Washington Dulles (IAD). Here is a table of their flights. Each
row indicates an origin city; each column indicated a destination city;
each intersection indicates the number of flights each day from
the origin to the destination.
BOS ORD EWR PHL
ATL IAD
----------------------------------
BOS | 0 3 2
0 0 1
ORD | 3 0 3
1 2 2
EWR | 1 3 0
2 0 1
PHL | 0 0 3
0 0 2
SEA | 0 2 0
1 0 1
DCA | 1 3 2
1 1 0
Part 1:
Develop a program that stores the service information in a 2-dimensional
6 x 6 array (you can use initializers to load the information) and then
displays it. To store the 3-letter codes of the cities, use a 1-dimensional
array of strings.
Part 2:
Now modify your program so it also computes and displays the number of
Cloud Nine flights leaving each city each day, and the number of Cloud
Nine flights arriving in each city each day.
(end of lab)