CMIS 102 Hands-On Lab Week 8

Week 8 - Concerts Overview

This hands-on lab allows you to follow and experiment with the critical steps of developing a program including the program description, analysis, test plan, and implementation with C code. The example provided uses sequential, repetition, selection statements, functions, strings and arrays.

Program Description

Compute the value of the ticket sales for concerts and the total sales for a series of concerts. Then display the concert information in a sorted list.

Technologies used in this project:

• strings stored as char arrays
• 2-dimensional char and int arrays
• getting data from the user into the various arrays
• using only part of an array for valid data
• computing array arithmetic – vector inner products to compute a value
• sorting using selection sort
• displaying data in arrays Interaction

Outline:

1. Get the ticket price for each 3 categories.
   1. float
2. Get the band name and numbers of fans for each category of each concert. a. String int int int
3. NOTE: spaces are not allowed in the band names, so use underscores instead of spaces. c. Period will end the input.
4. Internal computations:
   1. Compute the value of the sales for each concert.
   2. Compute the total value of the ticket sales.
   3. Sort the concerts by value of the ticket sales.
5. Display the resulting data in a nice format.

Notes:

1. This program is not expected to behave nicely if the input does not follow the specifications above.
2. All numbers this program will handle should be of moderate size. The exact meaning of moderate is made precise by the data types, print statements, and array sizes.

Analysis

1. Since we are going to do sorting, we will need to hold the data in arrays.
2. We will use functions to simplify the code and reflect a modular approach to the design of the project.
3. We will use global variables to reduce the amount information transferred in parameter lists.
4. We will use a fixed number of categories but let the number of concerts by determined by the user at run time, up to a maximum value.
5. The user will end inputting the group information with a flag value, a period.
6. Basic data types
   1. ticket prices – float
   2. name of concert/band – char array
   3. number of concerts and number of fans in each category at each concert – int
   4. number of concerts – int.
   5. value of tickets – float
7. We will use nested loops to handle most operations:
   1. reading the ticket prices
   2. reading the group name and attendance
   3. computing the value of the ticket sales
   4. printing the array of data
   5. sorting the arrays by the value of the ticket sales

Pseudo-code:

Global variables:

• Constants using define declarations o MAXN – the maximum number of characters in a band name o MAXG – the maximum number of concerts/bands/groups o MAXC – the maximum number of categories  Arrays:
  • char group [MAXG][MAXN] – the name of each group
  • int fans [MAXG][MAXC] – the number of fans at a concert by category o float prices [MAXC] – the ticket price of each category
  • float sales [MAXG] – the total value of the tickets for each concert
• int count o the actual number of active concerts/bands/groups o this number is determined at run time in the getData function
  • used throughout the rest of the program to only look at data in the group, fans and sales arrays that is actually active.

Pseudo-Code:

1. main
   1. getData – get ticket prices by category & get data for the concerts
   2. computeSales – compute sales for each concert
   3. printArray – print raw concert data
   4. sortBySales – sort the concerts by value of sales, use selection sort
      1. findMinSales – find min sales in unsorted rest of array
      2. switchRows – as needed
   5. printArray – print sorted concert data
2. getData
   1. prompt for ticket prices
   2. get ticket prices into prices array
   3. prompt for band name and fans in each category at each concert
   4. insert data into appropriate arrays, ending with a period
      1. loop on concert
         1. get group name
         2. loop inside on number of categories
      2. computeSales
         1. for each group
            1. sales for that group = 0
            2. for each category
               1. sales = sales + price of category * number of fans in that category

4. printArray
   1. print column headers
   2. for each group
      1. print the group name
      2. for each category
         1. print the number of fans in that category iii. print the sales for that concert/group
      3. sortBySales
         1. COMMENTS: for each row (group + fans + sales)
            1. for each row index, starting at index 0
            2. the rows that have indices less than the current index are sorted, and are already the smallest sales elements in the entire data set.

• thus, the next step is to find the smallest sales row in the remaining elements and switch that row with the current index row

1. for index = 0 to number of active rows, step index by 1
   1. target = findMinSales (index) ii. if target not equal to index, switchRows (target, index)
2. findMinSales (index)
   1. set target as index
   2. min
   3. for the rest of the array, starting at index+1, indexing by i
      1. if sales [i] < min
         1. target = i
         2. min = sales [target]
      2. return target
   4. switchRows (m, n)
      1. Temporary locations
         1. char tc
         2. int ti

• float v

1. switch group names by stepping through all the letters (i) in each char array:
   1. tc = group [m][i]
   2. group [m][i] = group [n][i]

• group [n][i] = tc

1. switch fan entries, stepping by (i) over the fans array:
   1. ti = fans [m][i]
   2. fans [m][i] = fans [n][i]

• fans [n][i] = ti

1. switch sales:
   1. v = sales [m]
   2. sales [m] = sales [n] iii. sales [n] = v

Test Plan

To verify this program is working properly a variety of test cases should be used.

The following is just one test case, which only tests a very few aspects of the program.

You should be thinking about other data sets to test other aspects of the program, and also create more realistic test sets.

Coding Plan

These are the steps taken to develop the base code of this project.

You should start with this code to address the Learning Exercises below.

This is a rather complex project, and it should be developed in SMALL steps, making SMALL changes to the code and testing each change carefully before moving on to the next step. Since we have a pretty good pseudo-code representation of this project, and a good test plan, we should be able to develop the steps we think this project will require.

We are guided here by the requirements of our environment, particularly getting the C compiler to accept our code at each step without error messages.

It is also helpful to have some idea of how long each step should take, so that if our actual time trying to complete a step is getting out of hand, we know it is time to change our strategy for that step by, for example:

• taking a break,
• looking for more specific information (don’t take too long here either!),
• asking someone (your instructor is the best choice) for help!

C Code

The following is the C Code that will compile in execute in the online compilers.

// C code 
// This code will compute the values of the sales ticket sales for concerts 
// and sort the entries by those values 
// Developer: Faculty CMIS102 
// Date: Jan 31, XXXX 
 
#include < stdio.h> 
 
#define MAXN 100 // max characters in a group/concert name 
#define MAXG  50 // max concerts/groups 
#define MAXC   3 // max categories 
 char  group  [MAXG][MAXN]; int   fans   [MAXG][MAXC]; float prices [MAXC]; float sales  [MAXG]; int   count = 0; 
 
void printArray () { 
  printf ("%15s%5s%5s%5s%10s\n",    "Concert", "s1", "s2", "s3", "Sales");   for (int i = 0; i < count; i++) {     printf ("%15s", group [i]);     for (int j = 0; j < MAXC; j++) {       printf ("%5d", fans[i][j]); 
    } // end for each category     printf ("%10.2f\n", sales [i]); 
  } // end for each group 
} // end function printArray 
 
void computeSales () {   for (int i = 0; i < count; i++) {     sales [i] = 0; 
    for (int j = 0; j < MAXC; j++) {       sales [i] += prices [j] * fans [i][j]; 
    } // end for each category 
  } // end for each group } // end function computeSales 
 void switchRows (int m, int n) {   char tc;   int  ti;   float v; 
  // printf ("Switching %d with %d\n", m, n);   for (int i = 0; i < MAXN; i++) {     tc = group [m][i];     group [m][i] = group [n][i];     group [n][i] = tc; 
  } // end for each character in a group name   for (int i = 0; i < MAXC; i++) {     ti = fans [m][i];     fans [m][i] = fans [n][i];     fans [n][i] = ti; 
 
  } // end for each fan category   v = sales [m];   sales [m] = sales [n];   sales [n] = v; 
} // end switch 
 int findMinSales (int m) {   float min = sales [m];   int target = m; 
  for (int i = m+1; i < count; i++)     if (sales [i] < min) {       min = sales [i];       target = i;     } // end new max found   return target; 
} // end function findMinSales 
 void sortBySales () {   int target; 
  for (int i = 0; i < count; i++) {     target = findMinSales (i);     if (target > i)       switchRows (i, target); 
  } // for each concert } // end function sortBySales 
 
void getData () { 
  // for (int i = 0; i < MAXG; i++) sales [i] = 0; 
  printf ("Enter ticket prices in each of %d cateogories: ", MAXC);   for (int i = 0; i < MAXC; i++)     scanf ("%f", &prices [i]); 
  printf ("-- Enter group and fans in %d categories\n", MAXC);   printf ("   . to finish entries:\n");   for (int i = 0; i < MAXG; i++) {     scanf ("%s", &group[i]);     if (group [i][0] == '.')        break;     count++; 
    for (int j = 0; j < MAXC; j++)       scanf ("%d", &fans[i][j]); 
  } // end for each group 
} // end function getData 
 int main(void) {   getData ();   computeSales ();   printArray (); 
  printf ("\n --- Sorted ---\n");   sortBySales ();   printArray ();   printf("... bye ...\n");   return 0; 
} 

Learning Exercises for you to complete

1. Demonstrate you successfully followed the steps in this lab by preparing screen captures of you running the lab as specified in the Instructions above.
   1. Add a function to print welcome information, including your name and an introduction to the project, and, of course, call this function as the first instruction in main.

NOTE: It is convenient to put each test case into its own data file so you don’t have to type a rather large set of input over and over again. Then you can just copy/paste the data into the interaction panel of the IDE you are using.

2. Modify the program to add a function to compute and display the total sales for all the concerts. Support your experimentation with screen captures of executing the new code.
3. Enhance the program to allow the user to enter 4 categories.

Explain the changes you made to the code, and create appropriate test data files. Support your experimentation with screen captures of executing the new code.

4. Prepare a new test table with at least 2 more test cases listing input and expected output for the new code you created, supporting 4 categories.
5. Create a variety of test cases focusing on the sorting algorithm, such as the final element is the smallest, the entire set is already sorted, etc.

Explain the purpose of each test case, and check your code against each of those cases.

6. Try using different inputs:
   1. What changes would you suggest to handle larger, more realistic numbers?
   2. What happens if any of the numbers, such as the ticket prices, are negative?
   3. What are your recommendations concerning negative input values?

7. What changes should be made to the code if the customer wished to sort on the number of fans in category 1, the first of the three (or four) categories?

Make those changes, test your code and confirm that it is working correctly.

Grading guidelines