3.

a) Find the acceleration of gravity at the height of 2.0 x 10⁶ above the earth.

b) A spherical asteroid that is the size of Texas would have a mass about 2.4 x 10²¹kg and radius of 4.7x 10⁵ meters. Find the acceleration of gravity on this asteroid.
c) Name three controls on a car that control acceleration.

d) Explain how the spin cycle of a washing machine removes most of the water from the wet clothes.

Over the period of 1926-2014 and among the investment classes presented, ______ had the highest average return, ______ had the lowest average return, and ______ had the highest risk premium.

1. Suppose we perform a binomial experiment 50 times where the probability of success on any given trial is 0.20. Which of the following is correct?

1. μ = 10 and σ = 3.16

2. μ = 8 and σ = 3.16

3. μ = 10 and σ = 2.83

4. μ = 8 and σ = 2.83

2. Suppose the average number of Funko Pops owned by a Statistics instructor is 7 with a standard deviation of 2.3 Pops. What would be the z-score of Mr. James, who owns 13 Pops?

1. z = 13

2. z = 2.61

3. z = -2.61

4. z = 1.53

3. All of the following can be approximated using a normal distribution EXCEPT

1. The number of successful outcomes for a binomial experiment with 10 trails where the probability of success on any given trail is 0.85

2. The average sample mean for samples of size 20 from a population that is normally distributed

3. The average sample mean for samples of size 50 from a population that is strongly skewed to the left

4. The number of successful outcomes for a binomial experiment with 30 trails where the probability of success on any given trail is 0.25

Match the following aqueous solutions with the appropriate letter from the column on the right.

The taxi and takeoff time for commercial jets is a random variable x with a mean of 8.5 minutes and a standard deviation of 3.1 minutes. Assume that the distribution of taxi and takeoff times is approximately normal. You may assume that the jets are lined up on a runway so that one taxies and takes off immediately after the other, and that they take off one at a time on a given runway.

(a) What is the probability that for 34 jets on a given runway, total taxi and takeoff time will be less than 320 minutes? (Round your answer to four decimal places.)


(b) What is the probability that for 34 jets on a given runway, total taxi and takeoff time will be more than 275 minutes? (Round your answer to four decimal places.)


(c) What is the probability that for 34 jets on a given runway, total taxi and takeoff time will be between 275 and 320 minutes? (Round your answer to four decimal places.)

It's true — sand dunes in Colorado rival sand dunes of the Great Sahara Desert! The highest dunes at Great Sand Dunes National Monument can exceed the highest dunes in the Great Sahara, extending over 700 feet in height. However, like all sand dunes, they tend to move around in the wind. This can cause a bit of trouble for temporary structures located near the "escaping" dunes. Roads, parking lots, campgrounds, small buildings, trees, and other vegetation are destroyed when a sand dune moves in and takes over. Such dunes are called "escape dunes" in the sense that they move out of the main body of sand dunes and, by the force of nature (prevailing winds), take over whatever space they choose to occupy. In most cases, dune movement does not occur quickly. An escape dune can take years to relocate itself. Just how fast does an escape dune move? Let x be a random variable representing movement (in feet per year) of such sand dunes (measured from the crest of the dune). Let us assume that x has a normal distribution with μ = 10 feet per year and σ = 2.7 feet per year.

Under the influence of prevailing wind patterns, what is the probability of each of the following? (Round your answers to four decimal places.)

(a) an escape dune will move a total distance of more than 90 feet in 7 years


(b) an escape dune will move a total distance of less than 80 feet in 7 years


(c) an escape dune will move a total distance of between 80 and 90 feet in 7 years

Use the following information to answer questions 9 – 12: The following joint probability distribution describes the number of bridesmaids and groomsmen at weddings. To avoid lengthy arithmetic, it assumes there are always 1, 2, or 3 bridesmaids and either 1, 2, or 3 groomsmen.

9. What is the marginal probability that a wedding will have 2 bridesmaids?

10. Suppose you know that a wedding is going to have 2 groomsmen; what is the expected number of bridesmaids that will be at that wedding?

11. Is the number of bridesmaids independent of the number of groomsmen? (So, are these two random variables independent?) (Yes or No)

12. What is the correlation between the number of bridesmaids and the number of groomsmen? (Hint: this will take a while to do. You need to first calculate the expected value of each random variable, then the covariance between the variables, then each variables standard deviation, and then you can find the correlation) (Your answer will be between -1 and 1)

Please provide the missng code(parts) for the given code in java. ASAP.
import java.util.Stack;

class StackQueue<T> implements Queue<T>{
        private Stack<T> inStack;
        private Stack<T> outStack;
        private int size;

        public StackQueue(){
                inStack = new Stack<T> ();
                outStack = PART(a);
                size = 0;
        }

        public int size(){
                return size;
        }

        public boolean isEmpty(){
                return size==0;
        }

        public T first(){
                if (size == 0) return null;;
                if (outStack.empty())
                        while (!inStack.empty())
                                outStack.push(inStack.pop());
                return PART(b); //return the element at the top of the outStack without removing it from the stack
        }

        public void enqueue(T x){
                PART(c); //push x to inStack 
                size++;
        }

        public T dequeue(){
                if (size == 0) return PART(d);
                if (outStack.empty())
                        while (!inStack.empty())
                                outStack.push(inStack.pop());
                size--;
                return PART(e); //Removes and returns the element at the top of the outStack
        }

        public String toString(){
                Stack<T> temp = new Stack<>();
                String ans = "StackQueue: ";
                if (isEmpty()) return ans;;
                if (outStack.empty())
                        while (!inStack.empty())
                                outStack.push(inStack.pop());

                while (!outStack.empty()){
                        T x = outStack.pop();
                        ans += (x + " -> ");
                        temp.push(x);
                }

                while (!inStack.empty())
                        outStack.push(inStack.pop());
                while (!outStack.empty()){
                        T x = outStack.pop();
                        ans += (x + " -> ");
                        temp.push(x);
                }

                while (!temp.empty())
                        outStack.push(temp.pop());

                return ans;
        }

        public static void main(String[] args){
                StackQueue<Integer> q = new StackQueue<>();
                q.enqueue(0);
                System.out.println("first element: " + q.first());
                q.enqueue(1);
                q.enqueue(2);
                q.dequeue();
                System.out.println(q.toString());
                System.out.println("first element: " + q.first());
                q.enqueue(3);
                q.enqueue(4);
                q.enqueue(5);
                System.out.println(q.toString());
                q.dequeue();
                System.out.println(q.toString());
                System.out.println("first element: " + q.first());
        }

}

/**
 * Interface for a queue: a collection of elements that are inserted
 * and removed according to the first-in first-out principle.
 */
interface Queue<T> {

  /**
   * Inserts an element at the rear of the queue.
   * @param e  the element to be inserted
   */
  void enqueue(T e);

  /**
   * Removes and returns the first element of the queue.
   * @return element removed (or null if empty)
   */
  T dequeue();

  /**
   * Returns the number of elements in the queue.
   * @return number of elements in the queue
   */
  int size();

  /**
   * Tests whether the queue is empty.
   * @return true if the queue is empty, false otherwise
   */
  boolean isEmpty();


  /**
   * Returns, but does not remove, the first element of the queue.
   * @return the first element of the queue (or null if empty)
   */
  T first();

}

Java code. You will need to make classes that could be used to stage a battle as described below.

You have been tasked to create a number of items that can be used in an online game. All items can be used on a game character who will have a name, a number of health-points and a bag to hold the items.  

Here are examples of items that can be made:

Here are examples of characters that can be made:

All items can be added to any character's bag and also used on any character. (For instance the Rusty Knife could be used on a character to lower their health by 3 points.)

Armor and weapons can be equipped (worn) and removed. Spells can also be equipped (memorized) which casts a glow around the character and removed (forgotten) which removes the glow. In the future, any time a character equips or removes any item, their appearance will be altered. These methods -- for now -- can just have a body which says either "equipping" or "removing."

Both spells and letters have some text that could be read.  Whenever a spell or letter is used, the text will also be read (displayed). However these items can be read independently from their use on a character.

Build these items using good interface and abstract class design as appropriate. Set the toString() method of the Character class to return a character's name and current health. You should have a good object oriented structure and good method signatures.

To illustrate this, in a driver class, two characters, Godwin and Marilyn are created. They begin by having items added to their bags (both Godwin and Marilyn get a copy of the Note from Zelda). Then the items they have are used on themselves or one another as follows:

This is a sample of how a Driver could work, staging a battle between the defensive Godwin and the offensive Marilyn.

- The Protection Spell is used on Godwin (by Godwin)
- The Rusty Knife is used on Godwin (by Marilyn)
- The Gladiator's Shield is used on Godwin (by Godwin)
- The Rusty Knife is used on Godwin (by Marilyn)

a/Use Excel to find the discrete probability and cumulative probability of the Binomial distribution with probability of success p = 0.75 and n = 80. Find its mean and variance. b/Based upon Excel chart, what can you conclude about the binomial convergence? Hint: Use binom.dist function on Excel and sketch the curve.

Read in the movies.csv into a dataframe named movies, display the first 5 rows and answer the below 10 questions

url = 'https://raw.githubusercontent.com/PacktPublishing/Pandas-Cookbook/master/data/movie.csv'

6) Use the count method to find the number of non-missing values for each column.

[ ]

7) Display the count of missing values for each column

[ ]

8) List the frequency for the top ten directors

[ ]

9) List the top ten director_name that has the highest average of director_facebook_likes

[ ]

10) List the top ten movie_title that has the longest duration

[ ]