A commercial pear grower must decide on the optimum time to have fruit picked and sold. If the pears are picked now, they will bring $0.30 per pound, with each tree yielding an average of 60 pounds of salable pears. If the average yield per tree increases 6 pounds per tree per week for the next 4 weeks, but the price drops $0.02 per pound per week, when should the pears be picked to realize the maximum return per tree? What is the maximum return?
Thanks in advance.
Please help me with these problems...
4. Ternary Huffman. Trimedia Disks Inc. has developed ternary hard disks. Each cell on a disk can now store values 0, 1, or 2 (instead of just 0 or 1). To take advantage of this new technology, provide a modified Huffman algorithm for compressing sequences of characters from an alphabet of size n, where the characters occur with known frequencies f1, f2, . . . , fn. Your algorithm should encode each character with a variable-length codeword over the values 0, 1, 2 such that no codeword is a prefix of another codeword and so as to obtain the maximum possible compression. Prove that your algorithm is correct.
5. The basic intuition behind Huffman's algorithm, that frequent blocks should have short encodings and infrequent blocks should have long encodings, is also at work in English, where typical words like I, you, is, and, to, from, and so on are short, and rarely used words like velociraptor are longer.
However, words like fire!, help!, and run! are short not because they are frequent, but perhaps because time is precious in situations where they are used.
To make things theoretical, suppose we have a file composed of m different words, with frequencies
f1, . . . , fm. Suppose also that for the ith word, the cost per bit of encoding is Ci. Thus, if we find a prefix-free code where the ith word has a codeword of length li, then the total cost of the encoding will
be (summation) i fi Ci li.
Show how to modify Huffman's algorithm to find the prefix-free encoding of minimum total cost.
6. A server has n customers waiting to be served. The service time required by each customer is known in advance: it is ti minutes for customer i. So if, for example, the customers are served in order of increasing i, then the ith customer has to wait (summation)( j = 1 to i) tj minutes.
We wish to minimize the total waiting time
T = (summation((i = 1 to n) (time spent waiting by customer i)
Give an efficient algorithm for computing the optimal order in which to process the customers.
This is urgent.
Thanks in advance!
The cafateria was accused of cheating students bynot giving them enough coffee in their 12oz cups. 15 cups were selected randomnly, they had a mean of 11.7 with a std dev of 0.5 at 0.01 significance level the claim that the customers were being cheated.
Thanks in advance.
18 people are randomly selected with a mean score of 550 and a std. dev. of 140. Find the 95% confidence interval for the population variance and std.
can you tell me how i find point estimates for population variance and standard deviation?
Thanks in advance.
What my answer is right only.
a^3 = a^x
We can take x = 3, since the bases are equal.
Similarly we can solve the given problem.
Hence the answer would be...
2^(x+2) 5^(6-x) = 10^(x^2)
= (2 x 5)^(x^2)
Compare LHS and RHS
x + 2 = x^2 and 6 - x = x^2
x^2 - x - 2 = 0 x^2 + x - 6 = 0
x = 2, -1 and x = 2, -3
This is our required answer.
a time t=0, a tank contains 4 lbs if salt dissolved in 100 gallons of water. Suppose brine, containing 2 lbs of salt per gallon, enters the tank at a rate of 5 gallons per minute. The mixed solution is allowed to drained from the bottowm of the tank at 5 gallons per minute. find the amount of salt in the tank after 10 minutes
I need the solution and similar kind of problems please