Answer:
The correct answer is:
C. ndx = 0;
while (ndx < 3) {
ar[ndx] = 0;
ndx++;
}
Explanation:
The declaration given is:
int ar[3];
This means the array consists of three locations and is named as ar.
We know that the indexes are used to address the locations of an array and the index starts from 0 and goes upto to 1 less than the size of the array which means the indexes of array of 3 elements will start from 0 and end at 2.
Now in the given options we are using ndx variable to run the while loop.
So the code to assign zero to all elements of array will be
ndx = 0;
while(ndx<3)
{
ar[ndx] = 0;
ndx++;
}
Hence, the correct answer is:
C. ndx = 0;
while (ndx < 3) {
ar[ndx] = 0;
ndx++;
}
Answer: A. It’s a robust way to find information
Explanation:
Hope this help.
Answer:
The programming code can be found in the explanation part, please go through it.
Explanation:
Code:
#include<stdio.h>
#include<stdlib.h>
#include <pthread.h>
// function check whether a number
// is prime or not
int isPrime(int n)
{
// Corner case
if (n <= 1)
return 0;
// Check from 2 to n-1
for (int i = 2; i < n; i++)
if (n % i == 0)
return 0;
return 1;
}
void* printPrimes(void *vargp)
{
int *n = (int *)vargp;
int i=0;
for (i=2;i<=n;i++)
{
if (isPrime(i)) printf("%d\n", i);
}
}
// Driver Program
int main(int argc, char* argv[])
{
int n = atoi(argv[1]);
pthread_t tid;
pthread_create(&tid, NULL, printPrimes, (void *)n);
pthread_exit(NULL);
return 0;
}
Answer: You reserve memory locations for an array when you _____.
use the keyword new
