Make null and alternative hypothesis for each question

A.Listening;

B.backup;

C.Learning;

D.alternate

A、to make or cut channels in (something)

B、to cut a deep line on the surface of something

C、to direct something through a course

D、null

A、No, they didn’t, because there exists great differences between Chinese and American cultures.

B、No, they didn’t, because many American students segregate themselves from Chinese students by not talking to them.

C、Yes, they did, although in fact they still had fewer American friends than Chinese ones.

D、null

A real estate company is interested in testing whether, on average, families in Gotham have been living in their current homes for less time than the families in Metropolis have. A random sample of 100 families from Gotham and a random sample of 150 families in Metropolis yield the following data on length of residence in current homes: Gotham:months,; Metropolis:months,.suppose. Which of the following represents the result of the relevant hypothesis test？

A、The alternative hypothesis is rejected.

B、The null hypothesis is rejected.

C、The null hypothesis is not rejected.

D、Insufficient information exists on which to make a decision.

As part of an evaluation program, a sporting goods retailer wanted to compare the downhill coasting speeds of 4 brands of bicycles. She took 3 of each brand and determined their maximum downhill speeds. The results are presented in miles per hour in the table below. Trial Barth Tornado Reiser Shaw 1 43 37 41 43 2 46 38 45 45 3 43 39 42 46 Suppose that the null hypothesis has been rejected at a 5% level of significance. The Tukey-Kramer procedure is now applied to make pairwise comparisons between groups. Using an overall level of significance of 0.05, the critical range for the Tukey-Kramer procedure is (correct to the second decimal place) .

从空二叉树开始，严格按照二叉搜索树的插入算法（不进行旋转平衡），逐个插入关键码构造出一棵二叉树，以怎样的顺序插入关键码集合{14，32，47，6，9，12，78，63，29，81}可以使得树的深度最小？ 请依次写出插入到树中的元素，每两个元素之间用一个空格隔开。 如果有多组满足要求的方案，请使得你的答案中先插入的元素尽可能的小。 From a null binary tree, insert key values successively according to the insertion algorithm of a binary search tree strictly (no rotation and balance) to construct a binary search tree. What is the insertion sequence that could make the tree have a smallest depth with a key value set {14，32，47，6，9，12，78，63，29，81}？ Please write down the elements successively, and there is one blank space between two elements. If there are more than one answer that meet the condition, please make the element which needs to be inserted first as small as possible in your answer.

A.NULL||NULL

B.'NULL'||NULL

C.3+NULL

D.(5>NULL)

A．AGE IS NULL

B．NOT(AGE IN NULL)

C．AGE=NULL

D．AGE IS NOT NULL