CSCI 3333
Data Structures
Summer 2008
Homework #3

Due Date: June 30th (Monday)

Goals

This is a more involving assignment to further familiarize yourself with your language of choice and object-oriented programming. It also encourages students to think about appropriate data structures.

Specification

Write a program to process the dictionary file words.txt, to find all words forming from unique sets of characters.  For example, the word "age" will be selected as there are no other words that can be formed from the characters 'a', 'e' and 'g'.  On the other hand, "tea" should not be selected since "eat", "ate", etc., are also words in the dictionary.

All selected words with lengths of 5 and smaller should be stored into the file "word_set1.txt".  The other words with lengths greater than 5 should go to the file "word_set2.txt".

In the output, eliminate words

Note that such word sets can be useful for games like Jumbo.

Also create a file "other_word_set.txt" that stores all other words (i.e. words that do not have unique sets of forming characters.)

Submission