Congest
congested
congestion
congestive
digest
digester
digestibility
digestible
digestibleness
Answer B (Data storage system)
Answer:
the answer is A
Explanation:
carries balance sheet ( 2013)
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:
C code is given below
Explanation:
// Define a function UpdateTimeWindow() with parameters timeStart, timeEnd, and offSetAmount. Each parameter is of type int. The function adds offSetAmount to each of the first two parameters. Make the first two parameters pass-by-pointer. Sample output for the given program:
#include <stdio.h>
// Define void UpdateTimeWindow(...)
void UpdateTimeWindow(int*timeStart, int* timeEnd, int offSetAmount){
*timeStart = *timeStart+ offSetAmount;
*timeEnd = *timeEnd+ offSetAmount;
}
int main(void) {
int timeStart = 0;
int timeEnd = 0;
int offsetAmount = 0;
timeStart = 3;
timeEnd = 7;
offsetAmount = 2;
printf("timeStart = %d, timeEnd = %d\n", timeStart, timeEnd);
UpdateTimeWindow(&timeStart, &timeEnd, offsetAmount);
printf("timeStart = %d, timeEnd = %d\n", timeStart, timeEnd);
return 0;
}
