Skip to content
Snippets Groups Projects
Commit 4447efe9 authored by Adam Blank's avatar Adam Blank
Browse files

Removes more questions from WriteUp.md

parent 3e33c19e
No related branches found
No related tags found
No related merge requests found
...@@ -44,9 +44,10 @@ than a Binary Search Tree. ...@@ -44,9 +44,10 @@ than a Binary Search Tree.
<pre>TODO</pre> <pre>TODO</pre>
### ChainingHashTable ### ### ChainingHashTable ###
Your ChainingHashTable should take as an argument to its constructor the type of "chains" it uses. Determine Your ChainingHashTable takes as an argument to its constructor the type of "chains" it uses. Which type
which type of chain is (on average) best: an MTFList, a BST, or an AVL Tree. Explain your intuition on why of chain between MTFList, BST, and AVL Tree do you think works best on average? For this question, we
the answer you got makes sense (or doesn't!). only want your intuition. (There are no wrong answers here as long as you back up your answer.) You
do not need to actually do an experiment, but you are welcome to if you like.
<pre>TODO</pre> <pre>TODO</pre>
### Hash Functions ### ### Hash Functions ###
...@@ -55,17 +56,6 @@ Compare the runtime of your ChainingHashTable when the hash function is varied. ...@@ -55,17 +56,6 @@ Compare the runtime of your ChainingHashTable when the hash function is varied.
hash function make? (You should keep all other inputs (e.g., the chain type) constant.) hash function make? (You should keep all other inputs (e.g., the chain type) constant.)
<pre>TODO</pre> <pre>TODO</pre>
### General Purpose Dictionary ###
Compare BST, AVLTree, ChainingHashTable, and HashTrieMap on alice.txt. Is
there a clear winner? Why or why not? Is the winner surprising to you?
<pre>TODO</pre>
### Top K Sort ###
TopKSort should theoretically be better than HeapSort for small values of k. Determine (using timing)
which n (input size) and k (number of elements sorted) makes TopKSort worthwhile over your best sort from the previous
experiment.
<pre>TODO</pre>
### uMessage ### ### uMessage ###
Use uMessage to test out your implementations. Using N=3, uMessage should take less than a minute to load using Use uMessage to test out your implementations. Using N=3, uMessage should take less than a minute to load using
your best algorithms and data structures on a reasonable machine. your best algorithms and data structures on a reasonable machine.
......
0% Loading or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment