TIK2O
Problem Solving Take Home Test
Please write an algorithm for the following problem. Remember that solutions should be simple, clear, and obvious.
The Jumble Problem: Word X is a jumble of word Y if the letters
in X can be rearranged to give Y. Example: backwards drawbacks. Given a finite
dictionary of size N, find the largest group of words all of which
are jumbles of each other.
Your algorithm should be able to find the largest group of jumbles and the number
of words in that group.
Marking:
/10 |
App |
Solution includes logical steps to solve the problem. |
/10 |
Com |
Solution is easy to understand. (Simple, clear, and obvious) |
/10 |
Thk |
If implemented solution would produce the correct result. |
| /10 |
Knw |
Solution is computationally simple. Ie. It would not require millions of comparisons to find the correct answer. |
If your solution does not produce the correct result in some or all cases please include an explanation of why and when it would not work. This shows me that you understand the errors in your solution and will result in a better mark.
©2003 C. Whittington