Lab 08 Agenda
Clone lab08
This is the same as previous labs. Remember to run
ssh-add when you log in, so you don't get repeatedly asked for you ssh password. Go to the
CS35 github org, to find the clone link for your repo on the web interface.
$ cd ~/cs35/labs
$ git clone <link you got from github> ./lab07
Quiz 2 Recap
- memory diagrams aren't going away. You'll probably see them on quiz3 and the final.
- Pay attention to the ADT interface. A Stack has no
get(i) method.
- Review ADT methods, implementations, runtimes.
Lab 08 Implementation
The first part of this lab will ask you to implement the Dictionary ADT using a HashTable implementation that resolves collisions via chaining. Unit tests are provided. You will just need to modify
hashTable.h and
hashTable-inl.h for this part
Lab 08 Application
The second part asks you to design an Scrabble Assistant application.
main.cpp is provided. You just need to modify
scrabbleAssistant.* to implement the methods described. You will want to use one or more HashTables in your implementation.
The anagrams part is tricky. Please read the instructions provided to guide your solution.
Written Part
The written part of this lab is very short. You will be generating one image and writing just a paragraph or two explaining your graph. Be sure to add,commit,push your
.png file with your solution.
Most of this code has been written for you in experiment.cpp. Your only implementation task is to implement getExperimentKeys function in experimentUtil.cpp. You must implement this function to generate the appropriate number of keys of the approapriate type in such a way that the keys are unique, but generate many collisions when using the bad hash function.