All categories

3 years ago

HELP ME ILL GIVE BRAINLY Input 50 numbers and then output the average of the negative numbers only. Write in pseudocode!

Computers and Technology

1 answer:

Mumz [18]3 years ago

3 0

Answer:

The explanation is for 10 inputs though. You'd have to follow these steps to find input 50 numbers.

Explanation:

This is how I wrote it in the Plain English programming language which looks like pseudo-code but compiles and runs (to save you all the rest of the steps):

To run:

Start up.

Write "Enter 10 numbers separated by spaces: " on the console.

Read a reply from the console.

Loop.

If the reply is blank, break.

Get a number from the reply.

Add 1 to a count.

Add the number to a total.

Repeat.

Write "The total is: " then the total on the console.

Put the total divided by the count into an average.

Write "The average is: " then the average on the console.

Refresh the screen.

Wait for the escape key.

Shut down.

You might be interested in

Which of the following is a good conductor of electricity and heat?

Zarrin [17]

The answer is A metal

7 0

3 years ago

Read 2 more answers

Each JavaScript command line ends with a(n) ____ to separate it from the next command line in the program.

kykrilka [37]

The answer is :
semicolon (;)

8 0

2 years ago

Oxnard Casualty wants to ensure that their e-mail server has 99.98 percent reliability. They will use several independent server

sattari [20]

Answer:

The smallest number of servers required is 3 servers

Explanation:

Given

$Reliability = 99.98\%$

$Individual Servers = 95\%$

Required

Minimum number of servers needed

Let p represent the probability that a server is reliable and the probability that it wont be reliable be represented with q

Such that

$p = 95\%\\$

It should be noted that probabilities always add up to 1;

So,

$p + q = 1$ '

Subtract p from both sides

$p - p + q = 1 - p$

$q = 1 - p$

Substitute $p = 95\%\\$

$q = 1 - 95\%$

Convert % to fraction

$q = 1 - \frac{95}{100}$

Convert fraction to decimal

$q = 1 - 0.95$

$q = 0.05$

------------------------------------------------------------------------------------------------

To get an expression for one server

The probabilities of 1 servers having 99.98% reliability is as follows;

$p = 99.98\%$

Recall that probabilities always add up to 1;

So,

$p + q = 1$

Subtract q from both sides

$p + q - q = 1 - q$

$p = 1 - q$

So,

$p = 1 - q = 99.98\%$

$1 - q = 99.98\%$

Let the number of servers be represented with n

The above expression becomes

$1 - q^n = 99.98\%$

Convert percent to fraction

$1 - q^n = \frac{9998}{10000}$

Convert fraction to decimal

$1 - q^n = 0.9998$

Add $q^n$ to both sides

$1 - q^n + q^n= 0.9998 + q^n$

$1 = 0.9998 + q^n$

Subtract 0.9998 from both sides

$1 - 0.9998 = 0.9998 - 0.9998 + q^n$

$1 - 0.9998 = q^n$

$0.0002 = q^n$

Recall that $q = 0.05$

So, the expression becomes

$0.0002 = 0.05^n$

Take Log of both sides

$Log(0.0002) = Log(0.05^n)$

From laws of logarithm $Loga^b = bLoga$

So,

$Log(0.0002) = Log(0.05^n)$ becomes

$Log(0.0002) = nLog(0.05)$

Divide both sides by $Log0.05$

$\frac{Log(0.0002)}{Log(0.05)} = \frac{nLog(0.05)}{Log(0.05)}$

$\frac{Log(0.0002)}{Log(0.05)} = n$

$n = \frac{Log(0.0002)}{Log(0.05)}$

$n = \frac{-3.69897000434}{-1.30102999566}$

$n = 2.84310893421$

$n = 3 (Approximated)$

Hence, the smallest number of servers required is 3 servers

6 0

3 years ago

A computing company is running a set of processes every day. Each process has its own start time and finish time, during which i

Helga [31]

Answer:

Above all else, let us show that this issue has the greedy choice property.

This implies that worldwide ideal arrangement can be gotten by choosing local ideal arrangements. Presently notice the following:

The global optimal solution of the issue requests us to track down the minimum number of times process_check module should be run.

It is likewise referenced that during each running interaction, process_check module should be called atleast once. Along these lines, the minimum possible number of process_check calls happens when process_check is made close to the quantity of the processes that are run.

Along these lines, we see that the global optimal solution is shaped by choosing optimal answer for the nearby advances.

Along these lines, the issue shows greedy choice property. Thus, we can utilize a greedy algorithm for this issue.

The greedy step in this calculation is to postpone the process_check as far as might be feasible. Thus, it should be run towards the finish of each interaction. So the following algorithm can be utilized:

Sort the cycles by utilizing the completion times.

Towards the finish of the 1st process in the arranged list, run the process_check module. Right now any process that is now running is removed the arranged rundown. The main interaction is additionally removed from the sorted list.

Now repeat stage 2, till all processes are finished.

In the above mentioned algorithm, the costliest advance is the step of sorting. By utilizing the optimal sorting algorithm, for example, merge sort, we can achieve it in O(n log n) asymptotic time.

Along these lines, this greedy algorithm additionally takes O(n log n) asymptotic time complexity.

5 0

3 years ago

A large retailer is asking each customer at checkout for their zip code. if the zip code is the only recorded variable, what is

Varvara68 [4.7K]

Answer:

Nominal

Explanation:

So while singing the question, let's further move to the answer. So let's see here and there.
The first option is B. S, which corrects gross sectional data, And the 2nd 1 of Nominal, C. Is correct nominal. So here are the buddha points which are given in the question.
The first one, option B is correct cross-sectional data, And the 2nd 1, is option C. Is correct nominal.

To learn more about it, refer

to brainly.com/question/25458754

#SPJ4

7 0

2 years ago