CMPS 3350 - Lab 6

Rules:

Use this dictionary file: /home/fac/gordon/public_html/3350/dictionary.txt

Your program must have...
   . at least one function other than main.
   . one or more conditional statements.
   . one or more loops.

Code will have perfect bracing, spacing, and indenting.

Each program will have a comment block at the top.

Do not choose the same challenge as the student sitting next to you.

Output will be neat

$ ./lab6

3350 Lab-6 Challenge number nn

68 words found:

lorem ipsum dolor sit amet consectetur adipiscing elit sed do eiusmod tempor
incididunt ut labore et dolore magna aliqua enim ad minim veniam quis nostrud
exercitation ullamco laboris nisi ut aliquip ex ea commodo consequat duis aute
irure dolor in reprehenderit in voluptate velit esse cillum dolore eu fugiat
nulla pariatur excepteur sint occaecat cupidatat non proident sunt in culpa qui
officia deserunt mollit anim id est laborum

End of program.

3350/6/lab61.cpp

List the 40 longest words in the dictionary with no duplicate letters.
Neatly display the words without any scrolling or word wrapping.

3350/6/lab62.cpp

How many words are made up of exactly 3 different letters.
Look only at words that are at least 4-letters long.
Neatly display the words.

3350/6/lab63.cpp

How many words have just 1-letter that's not a vowel?
Vowels are a, e, i, o, u.
Only look at words that have at least 2-letters.
Neatly display the words.
Show which is the longest word.

3350/6/lab64.cpp

Sort the letters of each individual word in the dictionary lexicographically.
Look at just the new words created.
There will now be some duplicate words.
How many new words occur more than once?
Neatly display the duplicated words.

3350/6/lab65.cpp

How many words, when spelled backwards, match another word in the dictionary?
The word cannot be a palendrome.
Neatly display the words.

3350/6/lab66.cpp

Read each word in the dictionary.
Replace each letter 'o', 'i', 'n' with a zero.
Replace each letter 'e', 't', 'a' with a 1.
Throw out the other letters.
You now have a binary number. What is the binary value?
Keep a running total of all binary numbers.
Display the first word having a binary value.
Display each word having a value larger than the largest binary value so far.
Display the total of all binary values.

3350/6/lab67.cpp

Look for words with letters ordered lexicographically in ascending sequence?
Look at words that are at least 3-letters long.
Neatly display the words.