CSC 150 Lab 9-2 More Team Projects


Two are better than one, because they have a good reward for their labor. For if they fall, the one will lift up his fellow. But woe to him that is alone when he falleth, for he hath not another to help him up. Ecc 4:9

This lab requires you to work in teams of two or three: the preferred size for a team is two.

The goal is to work as a team to analyze a problem, devise an algorithm for solving it, and then write a program to implement the solution. The problems come from an annual programming competition among students from schools in the Associated Colleges of the Chicago Area (ACCA).

Team up with one or two other persons in the class to write C++ programs to solve

  1. Problem 4 on the 2004 ACCA programming competition (Novice level)
  2. Problem 5 on the 2004 ACCA programming competition (Novice level)

Each team should appoint a team lead person for each problem. The lead person will be responsible for submitting the solution once it is complete. When submitting the solution by email, the lead person should cc all members of the team so they know the solution has been submitted.

Make sure that all the names of all team members appear in a programmer/author comment section at the top of the source file.

Team projects are due Tuesday of Week 10.



HINT for Transmogrifiers: Consider using a switch statement.


HINT for Word Chain: List all permutations of the numbers 0, 1, 2, 3. You can represent each permutation as a string

0123
0132
0213

etc. You can create a global array of all such strings like this

string perms [] = {"0123", "0132", ...};

You do not need all permutations because more than one permutation would give the same circular word chain. Once you have your array of all needed permutations, read in the four words into a vector of strings. Then write a function that takes a vector of inputted strings and determines whether they form a word chain.