Answer:
#include <bits/stdc++.h>
using namespace std;
bool isPrime(int n)
{
for(int j=2;j<=n-1;j++) //loop to check prime..
{
if(n%j==0)
return false;
}
return true;
}
int main(){
int n;
cout<<"Enter the integer"<<endl;//taking input..
cin>>n;
if(isPrime(n))//printing the message.
{
cout<<"The number you have entered is prime"<<endl;
}
else
{
cout<<"The number is not prime"<<endl;
}
return 0;
}
Output:-
Enter the integer
13
The number you have entered is prime
Explanation:
The above written program is in C++.I have created a function called isPrime with an argument n.I have used a for loop to check if the number is prime or not.In the main function I have called the function isPrime for checking the number is prime or not.
Answer:
sniffer programs
Explanation:
Software applications called <u>sniffer programs</u> provide the means to record information that passes through a computer or router that is handling Internet traffic.
Answer:
The Following are the solution to this question:
Explanation:
In Option a:
In the point (i) 
is transitive, which means it converts one action to others object because if 
indicates 
. It's true by definition, that becomes valid. But if 
, which implies 
. it's a very essential component. If 
. They 
will also be 
.
In point (ii), The value of 
is convergent since the 
. It means they should be dual a and b constant variable, therefore 
could only be valid for the constant variable, that is 
.
In Option b:
In this algorithm, the input size value is equal to 1 object, and the value of A is a polynomial-time complexity, which is similar to its outcome that is 
. It is the outside there will be a loop(i) for n iterations, that is also encoded inside it, the for loop(j), which would be a loop
. All internal loops operate on a total number of 
generations and therefore the final time complexity is .
C. database administrators are responsible for organizing a company's data making sure all the data is accurate' available' and secure
Answer:
running in the 90 s intensifies
Explanation:
