( Posting Again , I hope I will get full and correct Answer this time. PLease Gi
ID: 3837732 • Letter: #
Question
( Posting Again , I hope I will get full and correct Answer this time. PLease Give me answer in JUST C++ launguage , this is very important final project question , please give me FULL answer)
Write a complete program to hash a list of 200 words to a hash table using linear probing and a 70% load factor. Print the table. Give the number of probes for each word and the average number of probes to search for each word. The program should allow the user to interact with the program until the user wishes to stop. The user should be allowed to delete a word, search for a word and give the number of probes to find that word. The program shou1d rehash all words if 10% (20) of the words are deleted. The program should print the table every time it hashes/rehashes the words.
You are to create a Word Dictionary that contains 200 words – You can read from any document to get the words (cannot contain: common words, contain numbers, duplicate words) Your input file (a separate program) is the following - You are to create NumberWord list that takes the words in the Word Dictionary and converts them to numbers using ascii values. Each letter of the word is given a numeric value from the asci table (all letter should be converted to lowercase).
Hash each word to a hash table using linear probing and a 70% load factor for full credit, you must
Use functions
Use header files to hold all function definitions
The program will rehash if 10% or more of the words are deleted
Should catch the following errors:
Word not in the list
A word that is supposed to be in the list but was deleted and there is no holding spot to designate that the word has been deleted
Try/catch for input and output files
Should give the number of probes to search and locate all the words in the Word List
The end user should be able to
to delete word(s)
search for a word
Explanation / Answer
3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 #include #include #include #include #include #include #include "IndDicT.h" #include "List.h" #include "Meaning.h" #include using namespace std; IndDicT Dictionary; int main() { ifstream inFile; string inFileName; cout > word; getline(inFile, meaning); dictionary.insert(word, meaning); } string wordSearch; cout > wordSearch; List* found; //Testing lookUp function found = dictionary.lookUp(wordSearch); if (found) { coutRelated Questions
Navigate
Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.