| CS285 -- Lab 6: WordSearch Revisited |
|
|
OverviewIn this lab, you will modify your program from lab 4 to use a hash table (developed in lab 5) to store the dictionary instead of the STL set. ProceduresSimply do what is explained in the overview above. Once this has been accomplished, you may modify your program as much as you like. You are not required to use the hash table or the set in your final implementation. However, if you choose to do this, you must justify the changes you made and be prepared to demonstrate the hash table version if asked. Remember that extra credit will be awarded to the team that produces the best wordsearch game by the beginning of the week 10 lab. The best game will be determined by a class vote during the last class meeting in week 10. Lab report (due 11:00pm, Thursday, February 14)Please use this XML template as a starting point for your report. Your report should include:
As with any report you submit, correct spelling and grammar are required. In addition, your report should be submitted electronically following the Electronic submission guidelines. (You may wish to consult the sample report before submitting your report.) Be sure to keep copies of all your files, in case something gets lost. It may be wise to keep a diskette backup as well. Your grade will depend on quality of design, clarity of code and documentation, as well as whether your program produces the correct results. If you have any questions, consult your instructor. |
| © 2001-2002 Dr. Christopher C. Taylor | Office: CC-27C | Phone: 277-7339 | Last Updated: Tue Feb 12 10:18:53 2002 |
| I am responsible for all content posted on these pages; MSOE is welcome to share these opinions but may not want to. | |||