A segment 2 cm long is how many millimeters long? A. 0.2 mm. B. 2mm. C. 20 mm. D. 200 mm. E. None correct.

Choose the best answer for each question. Which of the following must the police have in order to obtain a search warrant from a judge? F. bail. G. a Miranda Warning. H. habeas corpus. I. probable cause.

Choose the best answer for each question. When the Fed writes lending rules for banks, it is acting as a F. government banker. G. money supplier. H. regulator. I. watchdog of the financial system's health.

Draw a diagram that shows how the sun is responsible for the production of wind energy.

Kobe's test scores were 85, 80, 80, 85, 80, 90, and 95. What is the mode of the scores? A. 80. B. 85. C. 15. D. 82.5. E. None correct.

Explain opportunity cost in making an economic decision.

How does relativity combine space and time coordinates into spacetime?

Concern the problem of identifying a counterfeit coin (one that is two heavy or too light) from a set of n coins. A balance scale is used to weigh a group of any number of coins from the set against a like number of coins from the set. The outcome of such a comparison is that group A weighs less than, the same as, or more than group B. A decision tree representing the sequence of comparisons done will thus be a ternary tree, where an internal node can have three children. One of five coins is counterfeit and is lighter than the other four. The problem is to identify the counterfeit coin. a. What is the number of final outcomes (the number of leaves in the decision tree)? b. Find a lower bound on the number of comparisons required to solve this problem in the worst case. c. Devise an algorithm that meets this lower bound (draw its decision tree).

Which of the following is considered a nonrenewable resource? A. sunlight, B. wood, C. water, D natural gas.

How do you factor by grouping?

Write the solution set of {x|x is a negative integer and x>-5} in roster notation.

Determine whether each table represents a linear function. Plot the points on a graph to find collinear points.

$$\begin{array}{|c|c|} \hline a & C(a) \\ \hline 0 & 0 \\ \hline 1 & 1 \\ \hline 2 & 4 \\ \hline 3 & 9 \\ \hline 4 & 16 \\ \hline \end{array}$$

Give a regular expression for the set recognized by the finite-state machine.

$$\begin{array}{lllr} \text{ } & \text{Next state} & \text{ } & \text{Output}\\ \text{Present state} & \text{Present input} & \text{ } & \text{ }\\ \text{ } & \text{0} & \text{1} & \text{ }\\ \hline \text{$s_{0}$} & \text{$s_{2}$} & \text{$s_{1}$} & \text{1}\\ \text{$s_{1}$} & \text{$s_{3}$} & \text{$s_{1}$} & \text{1}\\ \text{$s_{2}$} & \text{$s_{3}$} & \text{$s_{4}$} & \text{0}\\ \text{$s_{3}$} & \text{$s_{3}$} & \text{$s_{3}$} & \text{0}\\ \text{$s_{4}$} & \text{$s_{5}$} & \text{$s_{3}$} & \text{0}\\ \text{$s_{5}$} & \text{$s_{2}$} & \text{$s_{3}$} & \text{1}\\ \end{array}$$

Answer the following true-false question. The composition of two permutation functions on a set is a permutation function on the set.