hit the sign in botten or create new account
Highlight everything with your curser.
Answer:
#include <iostream>
using namespace std;
int * reverse(int a[],int n)//function to reverse the array.
{
int i;
for(i=0;i<n/2;i++)
{
int temp=a[i];
a[i]=a[n-i-1];
a[n-i-1]=temp;
}
return a;//return pointer to the array.
}
int main() {
int array[50],* arr,N;//declaring three variables.
cin>>N;//taking input of size..
if(N>50||N<0)//if size greater than 50 or less than 0 then terminating the program..
return 0;
for(int i=0;i<N;i++)
{
cin>>array[i];//prompting array elements..
}
arr=reverse(array,N);//function call.
for(int i=0;i<N;i++)
cout<<arr[i]<<endl;//printing reversed array..
cout<<endl;
return 0;
}
Output:-
5
4 5 6 7 8
8
7
6
5
4
Explanation:
I have created a function reverse which reverses the array and returns pointer to an array.I have also considered edge cases where the function terminates if the value of the N(size) is greater than 50 or less than 0.
Answer:
The answer is A. CAD which means Computer-Aided Design.
Explanation:
CAD is used for creating different designs, simulations and scientific diagrams, some examples of CAD software include AutoCAD and Solidworks.
For reference the other acronyms mean:
Desktop publishing (DTP)
Computer-based training (CBT)
Web-based training (WBT)
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;
}
