These functions are part of a simple shopping cart application where the user is asked to select items to add to their cart by item name. The program maintains a list of item names for sale and checks the names entered against the list available for sale. If it finds a match, it adds the item into the shopping cart. The shopping cart is a structure which keeps a list of the items in the cart and the number of items in the cart. Items are indicated by their position in the name array. There is a parallel arral of prices so that once the index of the item in the item name array is known, the index can be used to find the associated price. At the end of the program, an itemized list of the cart contents and prices is shown with a total with taxes calculated. This is a list of the functions you need to create black box test data for: /* * Find the position of a string in an array of strings. * @param str - the string to find * @param list - the list of strings to search * @param nstrings - the number of strings in the list * @returns the position of the string in the list or -1 if not found */ int findString(const char str[], const char list[][MAX_STRING_LEN + 1], const int nstrings); /* * Initialize all members of an array to a single value. * @param ar - the array to initialize * @param value - the value to set all array members to * @param size - the size of the array */ void init(int ar[], const int value, const int size); /* * Add an item to the shopping cart. * @param cart - the cart to add to * @param item - the item to add * @returns zero on success or non-zero if an error occurs */ int add2Cart(struct Cart* cart, const int item); /* * Clear input buffer until next newline character. */ void clear(); White Box Testing Now, you should consult the code supplied with this workshop. Examine the code for each of the functions and add white box tests to the black box tests you created previously. Be sure to indicate if it is a white box or black box test as shown in the example. You can add the white box tests as additional rows to the table you created for each function.

#define _CRT_SECURE_NO_WARNINGS #include #include

#define MAX_STRING_LEN 25 #define MAX_PRODUCTS 10 #define MAX_CART 10 #define TAX_RATE 0.13

struct Cart { int items[MAX_CART]; int nItems; };

/* * Find the position of a string in an array of strings. * @param str - the string to find * @param list - the list of strings to search * @param nstrings - the number of strings in the list * @returns the position of the string in the list or -1 if not found */ int findString(const char str[], const char list[][MAX_STRING_LEN + 1], const int nstrings) { int i, result = -1, found = 0; for (i = 0; i < nstrings && !found; i++) { if (0 == strcmp(str, list[i])) { result = i; } } return result; }

/* * Initialize all members of an array to a single value. * @param ar - the array to initialize * @param value - the value to set all array members to * @param size - the size of the array */ void init(int ar[], const int value, const int size) { int i;

for (i = 0; i < size; i++) { ar[i] = value; } }

/* * Add an item to the cart. * @param cart - the cart to add to * @param item - the item to add * @returns zero on success or non-zero if an error occurs */ int add2Cart(struct Cart* cart, const int item) { int result = 0;

if (cart->nItems >= MAX_CART) { result = -1; } else { if (item >= 0 && item < MAX_PRODUCTS) { cart->items[cart->nItems] = item; cart->nItems++; } else { result = -2; } } return result; }

/* * Clear input buffer until next newline character. */ void clear() { char ch; while ((ch = getchar()) != ' '); }

int main(void) { struct Cart cart = { {0}, 0 }; double prices[MAX_PRODUCTS] = { 1.99, 2.48, 4.56, 3.47, 6.99, 2.99 }; char descriptions[][MAX_STRING_LEN + 1] = { "flour", "sugar", "bananas", "potatoes", "milk", "tea" }; char productName[MAX_STRING_LEN + 1] = { 0 }; int i, finished = 0, numProducts = 6; int total = 0, tax = 0;

init(cart.items, -1, MAX_CART); printf("******************** "); printf("* Seneca Groceries * "); printf("******************** ");

do { printf("Enter item to purchase (end to stop): "); scanf("%30[^ ]", productName); clear(); if (!(finished = !strcmp("end", productName))) { int n = findString(productName, descriptions, numProducts); if (n < 0) { printf("Sorry, we do not have %s ", productName); } else { int rc = add2Cart(&cart, n); if (rc) printf("could not add item to cart "); } } } while (!finished);

printf(" Your Order: "); for (i = 0; i < cart.nItems; i++) { printf("%30s%8.2lf ", descriptions[cart.items[i]], prices[cart.items[i]]); total += (int)(prices[cart.items[i]] * 100 + 0.5); }

printf("%30s%8.2lf ", "TOTAL", total / 100.0); tax = (int)(TAX_RATE * total + 0.5); total = total + tax; printf("%30s%8.2lf ", "TAX", tax / 100.0); printf("%30s%8.2lf ", "GRAND TOTAL", total / 100.0);

return 0; }

Did you find more test cases via black box or white box techniques? Do you believe adequate testing could be done with just one of the techniques? Was it easier to develop black box or white box tests? Why is one faster than the other? Consider how you would set up integration tests for the functions above. What would be your general approach to creating integration tests? Do you need to create additional code to set up and run the test? How will you write code to compare the results to ensure they are correct? How much additional time do you think writing the additional code will take? Create one integration test for the combination of two functions above. Show the code you created to set up the test, execute the test and compare the result to the expected result. You only need to demonstrate one set of test data, but it should be obvious how to add more tests easily. Comment your code to point out the set up, execution, and comparison parts of the code.