Project 05: Letter Dice
- CS302 — Advanced Data Structures and Algorithms
- (http://www.cs.utk.edu/-plank)
- Original file: http://www.cs.utk.edui-plankiplank/classes/cs302/Labs/LabA
(http://www.cs.utk.edu/-plank/plank/classes/cs302/Labs/LabA/index.html)
A prior 302/307 TA Camille Crumpton (2017) posted youtube videos to help with this project — they are here. (https://www.youtube.com/playlist? list=PLQFSAfh8OMT6qqWxJ1cRrK7poAk5VcmxS)
Introduction
NOTE: We recommend that you work with a single partner on this project; however, if you think a group of three will help you complete this remotely (mostly through peer-peer discussion: think our in-class exercises) this will be allowed. You also may work alone.
Suppose you are given some number of “word dice”, as in the picture below:
is
We won’t constrain dice to have six sides — we’ll assume that a die may have any number of sides, and that the length of and an input string itself defines the number of sides and possible letters, respectively, of a corresponding die.
For example, let’s assume that the above dice only have three sides each — the sides that you can see. Then, the file Dicetbct (http://vvww.cs.utk.edu/—plank/plank/classes/cs302/Labs/LabA/Dicel .txt) defines the four dice pictured:
