Questions
What is a price ceiling and when does it becomes binding and non binding? Also provide...

  1. What is a price ceiling and when does it becomes binding and non binding? Also provide an example.
  2. What is a price floor and when does it becomes binding and non binding? Also provide an example.

In: Economics

A random sample of 378 hotel guests was taken at La Mirage and it was found...

A random sample of 378 hotel guests was taken at La Mirage and it was found that 194 requested non-smoking room. Another random sample of 516 hotel guests at Neptune Grand showed that 320 requested non-smoking room. We wan to test the claim that the percentage of guests requesting non-smoking room is different
between the two hotels, using significance level 0.05. Round you answer to 3 decimal places.

In: Statistics and Probability

2. Protein-DNA binding a) List the types of interactions that are involved between a protein that...

2. Protein-DNA binding

a) List the types of interactions that are involved between a protein that binds DNA non-specifically and DNA.

b) List two proteins that bind to DNA non-specifically.

c) List the types of interactions usually involved between a sequence-specific DNA binding protein and DNA.

d) List two proteins that bind DNA specifically.

e) What is the difference between non-specific and specific protein binding to DNA?

In: Biology

Below is a school problem of mine. WHAT I KNOW AND HAVE DONE. i have three...

Below is a school problem of mine.
WHAT I KNOW AND HAVE DONE.
i have three variables for input
n for nunber of wnemies
k for fight capacity

an arraylist set to the size of n because it only needs to be as large as the number of enemies coming.

and x which is just the time stamps that will go into the arraylist.

i also have tHe array sorted from least to greatest because it doesnt matter what order they enter the times at but the time of the oppenets matters.

HELP NEEDED HERE.
I need help on how to handle the conditions of the program.
i know that it takes 1000secs to defeat an enemy. if an enemy appears and it is before 1000secs and less than an avengers capacity i need to add an avenger.
im having trouble on how to implent this into my program.


After many sacrifices and multiple time-heists, our beloved Avengers, finally managed to reverse

Thanos’ snap and bring everyone back to Earth. Now, only the final battle remains. Thanos’

army is huge and unpredictable, and the Avengers need to know when they will be attacking.

Luckily through Dr. Strange’s time travelling skills, he has seen the future and knows the arrival

time for each enemy. It is your job to find out how many avengers are needed to fight off

Thanos’ army.

Please make sure you are using an ArrayList<Integer> in this assignment. This is a requirement.
he timestamps are in chronological order. i.e. they will be entered by the user in increasing order.
To simplify this problem, we will make the following assumptions.

1) Every avenger can fight off equal number of enemies at once.

2) Each enemy takes 1000 seconds to defeat.

3) Multiple enemies may arrive at the same time.

Inputs

Your program will take the following inputs.

N: The total number of enemies to defeat.

K : the number of enemies each avenger can handle at once.

A list of N numbers, representing timestamps (in seconds).

Output

Your program should output the MINIMUM number of avengers needed to fight off Thanos’

army.

Sample Cases

Test Run 1

Input

Enter number of enemies (N) : 2

Enter fighting capacity of each avenger(K) : 1

Enter time of arrival for each enemy

300

1500

Output

1 avenger(s) are needed to fight off the army

Explanation: Avenger 1 starts fighting at t=300, defeats the first enemy at t=1300, can thus fight

the next enemy at t=1500. No additional avengers needed.

Test Run 2

Input

Enter number of enemies (N) : 3

Enter fighting capacity of each avenger(K) : 2

Enter time of arrival for each enemy

500

510

1499

Output

2 avenger(s) are needed to fight off the army

Explanation: Avenger 1 starts fighting at t=500, at t=510, 2nd enemy arrives, A1 can handle 2

enemies at once (see value of K), so still just 1 avenger needed. Next enemy arrives at t=499,

which is less than (500+1000), which means A1 is still fighting off 2 enemies at t=1499. Hence a

2nd avenger is needed, to deal with the last enemy. So minimum number = 2

Test Run 3

Input

Enter number of enemies (N) : 14

Enter fighting capacity of each avenger(K) : 3

Enter time of arrival for each enemy

100

200

345

980

1123

1242

1466

1777

1900

2000

2000

2001

2500

3000

Output

3 avenger(s) are needed to fight off the army

Explanation for Test Run 3 (A1 , A2 , A3 represents each avenger)

earliest

100

A1

earliest

100 200

A1 A1

earliest

100 200 345

A1 A1 A1

earliest

100 200 345 980

A1 A1 A1 A2

earliest

1123 200 345 980

A1 A1 A1 A2

earliest

1123 1242 345 980

A1 A1 A1 A2

earliest

1123 1242 1466 980

A1 A1 A1 A2

earliest

1123 1242 1466 1777

A1 A1 A1 A2

earliest

1123 1242 1466 1777 1900

A1 A1 A1 A2 A2

earliest

1123 1242 1466 1777 1900 2000

A1 A1 A1 A2 A2 A2

earliest

1123 1242 1466 1777 1900 2000 2000

A1 A1 A1 A2 A2 A2 A3

earliest

1123 1242 1466 1777 1900 2000 2000 2001

A1 A1 A1 A2 A2 A2 A3 A3

earliest

2500 1242 1466 1777 1900 2000 2000 2001

A1 A1 A1 A2 A2 A2 A3 A3

earliest

2500 3000 1466 1777 1900 2000 2000 2001

A1 A1 A1 A2 A2 A2 A3 A3

Approach

1) Each timestamp represents the time at which an enemy arrives.

2) You can represent the above data structure using an arraylist.

ArrayList<Integer> arr = new ArrayList<Integer>();

3) Every time you encounter a timestamp, you first check to see if 1000 secs has passed

since the earliest timestamp in your list. If yes, then the corresponding avenger has fought

off the earliest enemy in your list and has a ”slot open” to now fight the current enemy.

4) If 1000 secs have NOT passed since the earliest, then do one of the following

a. If the latest avenger is capable of simultaneously fighting more enemies than he is

currently fighting, then assign the current enemy to one of the “empty slots”

b. If all avengers are at full capacity, then introduce a new avenger, increment

minimum number of avengers needed by 1

In: Computer Science

There are millions of unique visitors that consult Wikipedia, the free online encyclopedia. The contents of...

There are millions of unique visitors that consult Wikipedia, the free

online encyclopedia. The contents of the website are written by voluntary

contributors, and rarely does any of the readers make an edit. In 2011,

Wikipedia’s fund-raising campaign showed that only 3% of non-editing readers

donated to this non-profit. So clearly there are millions of readers who free ride

on the efforts of the editors and donors.

a. (5 points) Do you think that the knowledge made available via Wikipedia

is a public good? Evaluate (that is, provide your arguments for or against)

it based on the non-rivalness and the non-excludability features of a

public good.

b. (5 points) If you were to suggest some ways to reduce the free riding, what

would they be? Be specific.

In: Economics

C++ [2] Write a program that prompts the user to enter a non-negative decimal number and...

C++

[2] Write a program that prompts the user to enter a non-negative decimal number and a base in the range 2 <= base <= 16. Write a function multibaseOutput() that displays the number in the specified base. The program terminates when the user enters a number of 0 and a base 0.

Run:
Enter a non-negative decimal number and base (2 <= B <= 16) or 0 0 to terminate: 155 16
    155 base 16 is 9B
Enter a non-negative decimal number and base (2 <= B <= 16) or 0 0 to terminate: 3553 8
    3553 base 8 is 6741
Enter a non-negative decimal number and base (2 <= B <= 16) or 0 0 to terminate: 0 0

In: Computer Science

The life spans of a species of fruit flies have a bell shaped distribution with a...

  1. The life spans of a species of fruit flies have a bell shaped distribution with a mean of 33 days and a standard deviation of 4 days.
  1. The life spans of three randomly selected tires are 34, 30, and 42 days. Find the z-score for these life-spans and specify if any of the life spans are unusual.
  2. The life spans of three fruit flies are 29, 41, and 25 days. Use the empirical rule to determine the percentile rank of each life span.
  3. If a sample of 40 fruit flies is studied, how many fruit flies would have a life span between 25 and 41 days according to Chebychev’s theorem.

In: Statistics and Probability

Barber and Odean, in their 2002 Journal of Finance paper entitled “Trading Is Hazardous to Your...

Barber and Odean, in their 2002 Journal of Finance paper entitled “Trading Is Hazardous to Your Wealth: The Common Stock Investment Performance of Individual Investors” state that:

“Our most dramatic empirical evidence supports the view that overconfidence leads to excessive trading. On one hand, there is very little difference in the gross performance of households that trade frequently (with monthly turnover in excess of 8.8 percent) and those that trade infrequently. In contrast, households that trade frequently earn a net annualized geometric mean return of 11.4 percent, and those that trade infrequently earn 18.5 percent.” Attempt to explain these findings using the behavioural finance theory.

In: Economics

A particular population, for which the frequency curve is bell-shaped (normal), has a mean of μ=100...

A particular population, for which the frequency curve is bell-shaped (normal), has a mean of μ=100 and a standard deviation of σ=18. For samples of size n=36 consider the sampling distribution of the sample mean ("xbar").

Note that 18 36=3 and that

  • 100±(1)(3)⟹97 to 103
  • 100±(2)(3)⟹94 to 106
  • 100±(3)(3)⟹91 to 109

According to the empirical rule, approximately _____ percent of samples of size 36 will produce a sample mean between 97 and 103.

Group of answer choices

99.7

90

95

68

None of the other choices represent a suitable response.

In: Statistics and Probability

Choose a binomial probability experiment. You could flip a coin, or toss a basketball from the...

Choose a binomial probability experiment. You could flip a coin, or toss a basketball from the free throw line and see if you make the shot or miss, or choose another experiment where the outcome is a success or failure (only two possible outcomes.)  

1) Make a guess about the probability of success before doing the experiment.

2) Repeat the experiment 50 times, and record the results.

3) Calculate the empirical probability of success, and compare it to your original guess. Were you close or were you far off?

4) Write a paragraph explaining how you did the experiment and comparing your results to your guess

In: Statistics and Probability