The function is not working i have no idea why should be just simple multipy by

You will use a single backing array(instead of two) and two hash functions (both MultiplicativeHashFunction objects), h1 and h2. The z values for your hash functions (and all subsequent hash functions needed when resizing or rehashing) will be taken from an array of integers passed to the CuckooHashTable constructor. The first value in the array will be used for the first incarnation of h1, the second value for the first incarnation of h2, the next two values will be used for the next incarnations of h1 and h2, etc. Note: be careful to follow this. We will be checking your array (via toString()) and correctness will depend on using the same values of z as we do when generating the test code. The MultiplicativeHashFunction objects you will use also have a getParams() method to show the value of z,w,d when that hash function is used. When adding an item, x, that is not in the hash table already, always add it to t[h1(x)] (even if t[h1(x)] is already taken and t[h2(x)] is available). The load factor must always satisfy α=n/t.length≤1/2. If adding an item will violate this then resize the table (doubling its size) and rehash everything (before doing the add). After removing an item, if the load factor satisfies α=n/t.length<1/8 AND the dimension satisfies d≥5 then resize by reducing the size of the bucket table by a factor 2 and rehash everything. Each time you resize you will create two new hash functions using the next two z values (that were initially passed to the constructor). Your constructor should initialize an empty bucket array of size 16 (i.e., d=4). This is the minimum size your bucket array should ever be. Never let the dimension be smaller then 4.

he efficacy of this spending is therefore relatively important. When it comes to contagious diseases, there are generally two strategies that can be adopted. The first involves prevention, which includes vaccinations to lower or eliminate the risk of contracting a disease. The second involves treatment of those unfortunate enough to get sick, treatment typically requires some form of a drug. Since pharmaceutical companies can produce both vaccines and drugs, we would like to understand the incentives they have to develop each type of medicine. To explore this question, consider a population of 100 consumers, 90 of whom have a low disease risk, say 10%. The remaining ten have a high risk – to make things simple, assume they are certain to contract the disease. In addition, suppose the disease generates personal harm equal to the loss of $100 for each individual when they are infected. Suppose also that pharmaceuticals of either form (vaccines or drugs) are costless to produce (once R & D has occurred) and are perfectly effective Question 2. What price would a profit maximising monopolist charge for a vaccine? What are the monopoly profits on the vaccine? What is the efficient outcome (i.e. SMB = SMC)? What is the welfare under the monopoly and at the efficient allocation? Question 3.Now consider the demand for the drug (assume that the vaccine is not available). Construct the demand function for the drug and plot it on a diagram. What price would a profit maximising monopolist charge for the drug? What are the monopoly profits from the drug? What is the efficient outcome? What is the welfare under the monopoly and at the efficient allocation? Question 4. If the R&D costs of the vaccine and drug are the same, what will the pharmaceutical company do? Explain your answer in terms of the variation in the willingness to pay and the size of the R& D costs. What would a social planner do? Question 5. What are the R&D cost for the vaccine and the R&D cost for the vaccine drug that would make a pharmaceutical company indifferent between developing the vaccine and the drug? Is the social planner indifferent in this case? Explain any difference.

list uses dynamic memory allocation to grow as the size of the data set grows. Unlike linked lists, a binary search tree is very fast to insert, delete and search. Project Description When an author produce an index for his or her book, the first step in this process is to decide which words should go into the index; the second is to produce a list of the pages where each word occurs. Instead of trying to choose words out of our heads, we decided to let the computer produce a list of all the unique words used in the manuscript and their frequency of occurrence. We could then go over the list and choose which words to put into the index. The main object in this problem is a "word" with associated frequency. The tentative definition of "word" here is a string of alphanumeric characters between markers where markers are white space and all punctuation marks; anything non-alphanumeric stops the reading. If we skip all un-allowed characters before getting the string, we should have exactly what we want. Ignoring words of fewer than three letters will remove from consideration such as "a", "is", "to", "do", and "by" that do not belong in an index. In this project, you are asked to write a program to read any text file and then list all the "words" in alphabetic order with their frequency together appeared in the article. The "word" is defined above and has at least three letters. Note: Your result should be printed to an output file named YourUserID.txt. You need to create a Binary Search Tree (BST) to store all the word object by writing an insertion or increment function. Finally, a proper traversal print function of the BST should be able to output the required results. The BST class in the text can not be used directly to solve this problem. It is also NOT a good idea to modify the BST class to solve this problem. Instead, the following codes are recommended to start your program. //Data stored in the node type struct WordCount { string word; int count; }; //Node type: struct TreeNode { WordCount info; TreeNode * left; TreeNode * right; }; // Two function's prototype // Increments the frequency count if the string is in the tree // or inserts the string if it is not there. void Insert(TreeNode*&, string); // Prints the words in the tree and their frequency counts. void PrintTree(TreeNode* , ofstream&); //Start your main function and the definitions of above two functions. Sample Run Please type the text file name: Lincoln.txt Please give the output text file name: mus11.txt You are done! You can open the file "mus11.txt" to check. Press any key to continue ------------------------------------------------------------------------------------------------------------------------------------------------ lincoln.txt--- The Gettysburg Address Gettysburg, Pennsylvania November 19, 1863 Four score and seven years ago our fathers brought forth on this continent, a new nation, conceived in Liberty, and dedicated to the proposition that all men are created equal. Now we are engaged in a great civil war, testing whether that nation, or any nation so conceived and so dedicated, can long endure. We are met on a great battle-field of that war. We have come to dedicate a portion of that field, as a final resting place for those who here gave their lives that that nation might live. It is altogether fitting and proper that we should do this. But, in a larger sense, we can not dedicate -- we can not consecrate -- we can not hallow -- this ground. The brave men, living and dead, who struggled here, have consecrated it, far above our poor power to add or detract. The world will little note, nor long remember what we say here, but it can never forget what they did here. It is for us the living, rather, to be dedicated here to the unfinished work which they who fought here have thus far so nobly advanced. It is rather for us to be here dedicated to the great task remaining before us -- that from these honored dead we take increased devotion to that cause for which they gave the last full measure of devotion -- that we here highly resolve that these dead shall not have died in vain -- that this nation, under God, shall have a new birth of freedom -- and that government of the people, by the people, for the people, shall not perish from the earth. ------------------------------------------------------------------------------------------------------------------------------------------------ mus11.txt 1863 1 Address 1 But 1 Four 1 Gettysburg 2 God 1 Liberty 1 November 1 Now 1 Pennsylvania 1 The 3 above 1 add 1 advanced 1 ago 1 all 1 altogether 1 and 6 any 1 are 3 battle-field 1 before 1 birth 1 brave 1 brought 1 but 1 can 5 cause 1 civil 1 come 1 conceived 2 consecrate 1 consecrated 1 continent 1 created 1 dead 3 dedicate 2 dedicated 4 detract 1 devotion 2 did 1 died 1 earth 1 endure 1 engaged 1 equal 1 far 2 fathers 1 field 1 final 1 fitting 1 for 5 forget 1 forth 1 fought 1 freedom 1 from 2 full 1 gave 2 government 1 great 3 ground 1 hallow 1 have 5 here 8 highly 1 honored 1 increased 1 larger 1 last 1 little 1 live 1 lives 1 living 2 long 2 measure 1 men 2 met 1 might 1 nation 5 never 1 new 2 nobly 1 nor 1 not 5 note 1 our 2 people 3 perish 1 place 1 poor 1 portion 1 power 1 proper 1 proposition 1 rather 2 remaining 1 remember 1 resolve 1 resting 1 say 1 score 1 sense 1 seven 1 shall 3 should 1 struggled 1 take 1 task 1 testing 1 that 13 the 9 their 1 these 2 they 3 this 4 those 1 thus 1 under 1 unfinished 1 vain 1 war 2 what 2 whether 1 which 2 who 3 will 1 work 1 world 1 years 1

sically, Tree 1 is just a vertical line, Tree 2 is that line plus two branches, Tree 3 is Tree 2 but with two additional branches on each of the original ones, and so on. Please help! I don't understand how recursions are supposed to be used with this and how to call a previous tree function. Below are additional instructions my teacher gave me. draw-tree3 [ levels blen bangle] levels : number of levels blen : length of each branch bangle : angle of the branches The branch length should decrease as the function calls itself. This does NOT mean you decrease a variable, it means that just like fib(n-1) or fib(n-2) you decrease the parameter as you pass it to the next copy. ----Your slider is the STARTING value, the parameter can be changed every time your function is called. Have the branch decay by multiplying by 0.85 before passing it to the next recursive call. -When this works, try making the branch decay a slider from 0.1 to 0.9 in increments of 0.01