It is false. Just took a quiz with this question. It is 100% FALSE because I put true and got it wrong.
50% is the answer to your question
Answer:
Following are the code in the C language .
int max(int x) // function definition
{
static int largest=0; // variable declaration
if (x>largest) // checking the condition
largest=x; // assign the value of input in the largest variable
return largest; // return the largest number
}
Explanation:
Following are the description of code .
- Decalred a function max of int type which hold a parameter x of int datatype.
- In this function compared the number x with the largest .If this condition is true then largest number hold the value of x variable
- Finally return the largest number .
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
Answer:
Hi!
The answer to:
a. 6 bits.
b. 9 bits.
c. 26 bits.
Explanation:
a. For the states of the U.S.A, you need 50 or more combinations to represents each element.
<u>If you use 6 bits, the possible combinations are 2⁶ = 64. </u>
b. For days in a year, you need 365 or more combinations to represents each element.
<u>If you use 9 bits, the possible combinations are 2⁹ = 512.
</u>
c. For inhabitants of California, you need 36,457,549 or more combinations to represents each element.
<u>If you use 26 bits, the possible combinations are 2²⁶ = 67,108,864.</u> If you use 25 bits instead of 26, then you have 2²⁵ = 33,554,432 combinations. These possible combinations are not enough to represent each inhabitant.
