Here is a step-by-step solution to the problem:

1. First, we need to check if the size of the array is greater than 3. If not, we print "Invalid Array Size." and end the program.

2. Next, we need to check if all the elements in the array are greater than 1. If not, we print "Invalid Array Elements." and end the program.

3. Now, we need to find all the prime numbers in the array. A prime number is a number that has only two distinct positive divisors: 1 and itself. So, we iterate through each element in the array and check if it is a prime number. To check if a number is prime, we can iterate from 2 to the square root of the number and check if the number is divisible by any of these. If it is, then it is not a prime number.

4. We keep a sum of all the prime numbers and also count the number of prime numbers.

5. Finally, we calculate the average of the prime numbers by dividing the sum by the count. If the count is 0, i.e., there are no prime numbers, we print "No Prime Numbers!".

6. We print the average up to 3 decimal points.

This is the general algorithm to solve the problem. The actual implementation would depend on the programming language you are using.

Question

Here is a step-by-step solution to the problem:

1. First, we need to check if the size of the array is greater than 3. If not, we print "Invalid Array Size." and end the program.

2. Next, we need to check if all the elements in the array are greater than 1. If not, we print "Invalid Array Elements." and end the program.

3. Now, we need to find all the prime numbers in the array. A prime number is a number that has only two distinct positive divisors: 1 and itself. So, we iterate through each element in the array and check if it is a prime number. To check if a number is prime, we can iterate from 2 to the square root of the number and check if the number is divisible by any of these. If it is, then it is not a prime number.

4. We keep a sum of all the prime numbers and also count the number of prime numbers.

5. Finally, we calculate the average of the prime numbers by dividing the sum by the count. If the count is 0, i.e., there are no prime numbers, we print "No Prime Numbers!".

6. We print the average up to 3 decimal points.

This is the general algorithm to solve the problem. The actual implementation would depend on the programming language you are using.

Knowee AI · Accepted Answer

Here is a step-by-step solution to the problem:

1. First, we need to check if the size of the array is greater than 3. If not, we print "Invalid Array Size." and end the program.

2. Next, we need to check if all the elements in the array are greater than 1. If not, we print "Invalid Array Elements." and end the program.

3. Now, we need to find all the prime numbers in the array. A prime number is a number that has only two distinct positive divisors: 1 and itself. So, we iterate through each element in the array and check if it is a prime number. To check if a number is prime, we can iterate from 2 to the square root of the number and check if the number is divisible by any of these. If it is, then it is not a prime number.

4. We keep a sum of all the prime numbers and also count the number of prime numbers.

5. Finally, we calculate the average of the prime numbers by dividing the sum by the count. If the count is 0, i.e., there are no prime numbers, we print "No Prime Numbers!".

6. We print the average up to 3 decimal points.

This is the general algorithm to solve the problem. The actual implementation would depend on the programming language you are using.

Question

Solution

Similar Questions

Upgrade your grade with Knowee