When ranking data how are the ranks of the same value determined?

What is Discriminate Function Analysis?  How does it differ from many other technique?  

Kriging, Counting cells and Thiesson polygons are all methods of what?  Why are these methods preferred?

What are Type I and Type II errors in testing a statistical hypothesis?  If you limit the possibility of a Type I error what happens regarding a Type II error?

When conducting a statistical test on the computer the p value indicates what? How does this compare to the traditional method of using a pre-selected level of significance?

What is the difference between parametric and nonparametric data?  Why is this difference important in study design and choice of statistical tests?

90% of patients have how many parathyroid glands?

Hormones are released by glands from which of the following body systems?

True or False: Dijkstra’s shortest path algorithm is a greedy algorithm.

Problem 5. Maximum Subarray (10 points)Given an array of n numbers, give a divide-and-conquer algorithm that finds the subarray that has themaximum sum and returns its sum. For example, Input: arr[] = [2, 3, -8, 7, -1, 2, 3] Output: 11. Explanation:The subarray [7, -1, 2, 3] has the largest sum 11.