Blog

Raquel is going on a really long trip, and will need many to…

Raquel is going on a really long trip, and will need many toys to be entertained. Prof. Brito allows her to use two bags, with capacities respectively. Design a Dynamic Programming algorithm for Raquel such that: given an array W and L for toys numbered , where W[i] is the weight of toy i, and L[i] is the liking coefficient for each toy (the higher L[i], the more she likes toy i), your algorithm outputs the maximum sum of the L values of both bags. For now, Raquel only has 1 of each toy. Example: W=[8, 11, 9, 4], L=[2, 5, 1, 3], , your algorithm should return 8=5+3 as a result of placing toy 2 in the second bag, and toy 4 in the first bag. Note that you can fill the second bag with toys 1 and 4, and place toy 3 in the first bag, but the sum of the L values in this case is 2+3+1=6

A college statistics professor gave the same quiz (scored ou…

A college statistics professor gave the same quiz (scored out of a total of 10 points) to his studentsover the past seven years. The distribution of the scores for two different years are displayed in the histograms below. The x-axis on each diagram represents the number of points scored on the quiz (0-10) ; the y-axis is the number of students achieving that score. Which set of scores would you expect to have a lower standard deviation? (You can just say the first graph or second graph if you can’t read the Roman Numerals) Explain your reasoning in complete sentences in the answer box below.