Explanation:
The X's have been correctly placed in the chart
A surge suppressor, which is also commonly known as a surge protector, is an important equipment that helps prevent damage to electric components from an unexpected increase of voltage. Let’s assume that you are living in a county where the effective utility voltage is between 110 to 120 volts. Assume that the accepted peak voltage should not be anything higher than 170 volts. If there is a surge and this surge reaches peak levels of 170 volts and higher, surge suppressors should jump in and prevent the peak AC voltage from going above the threshold.
People tend to confuse line conditioners and surge suppressors. While surge suppressors protect components from surges, line conditioners are built to make up for the loss of voltage from the lines. It does so by storing some power energy. This stored energy can later be modified and used when the volts drops to the desired 110 volts.
A UPS has DC battery power that provides battery backup power when the electricity goes off or when the levels of voltage drop significantly. When the electricity goes off means that the voltage is at 0 volts and it is the work of the UPS to kick its backup power in.
Answer:
A. The amount of food to take on the journey
Explanation:
Hope you get it right!!
Answer:
the answer is going to be printer
Using the knowledge in computational language in C++ it is possible to write a code that Find the Average of the sum of prime numbers between 1 to any given number
<h3>Writting in C++ code:</h3>
<em />
<em>#include <iostream></em>
<em>using namespace std;</em>
<em>bool isPrime(int n){</em>
<em> for(int i = 2; i < n/2; i++){</em>
<em> if(n%i == 0){</em>
<em> return false;</em>
<em> }</em>
<em> }</em>
<em> return true;</em>
<em>}</em>
<em>int findPrimeSum(int n){</em>
<em> int sumVal = 0;</em>
<em> for(float i = 2; i <= n; i++){</em>
<em> if(isPrime(i))</em>
<em> sumVal += i;</em>
<em> }</em>
<em> return sumVal;</em>
<em>}</em>
<em>int main(){</em>
<em> int n = 15;</em>
<em> cout<<"The sum of prime number between 1 to "<<n<<" is "<<findPrimeSum(n);</em>
<em> return 0;</em>
<em>}</em>
See more about C++ code at brainly.com/question/19705654
#SPJ1
