CSCI 3333
Data Structures
Summer 2008
Homework #1
Due date: June 16, 2008 (Monday) 3:00pm
Goals
This is a refresher assignment to get familiar with basic program development in a selected language and its environment.
Specification
Consider the dictionary file words.txt, which contains one word per line. Write a program of your language choice to read a list of characters separated by spaces (through the command line) and print out all words containing every input character.
For examples, if the input characters are "a b c d e f"
The output may be:
There are 3 words containing all supplied characters:
1: barefaced
2: boldface
3: feedback
Another example:
Input: "a e i o u q"
Output:
There are 14 words containing all supplied characters:
1: consequential
2: equatorial
3: equinoctial
4: equitation
5: equivocal
6: equivocate
7: grandiloquent
8: inconsequential
9: liquefaction
10: quasiorder
11: quasiperiodic
12: questionnaire
13: sequestration
14: Sequoia
Some test cases:
(1) a b c d e f
(2) a e i o u q
(3) a b c d e f g
(4) w x y
(5) x y w
The teaching assistant will test your program with these five test cases and additional ones.
You can use your choice of language and development environment.
Submission