Answer:
The program in C++ is as follows:
#include <iostream>
using namespace std;
void display(int array_test [], int n){
for(int i = 0; i<n;i++){
cout<<array_test[i]<<" "; }
}
int main(){
int n;
cin>>n;
int array_test[n];
for(int i = 0; i<n;i++){
cin>>array_test[i];
}
display(array_test,n);
return 0;
}
Explanation:
This defines the display function
void display(int array_test [], int n){
This iterates through the array
for(int i = 0; i<n;i++){
This prints each element of the array
cout<<array_test[i]<<" "; }
}
The main begins here
int main(){
This declares n as integer; n represents the length of the array
int n;
This gets input for n
cin>>n;
This declares the array
int array_test[n];
The following iteration gets input for the array
for(int i = 0; i<n;i++){
cin>>array_test[i];
}
This calls the display function to display the elements of the array
display(array_test,n);
return 0;
}
Answer:
This address is by default a class c network
Explanation:
This IP address in this question is a class c network because it has 196 as its first octet. A class c network is one which has its first octet to be between 192 and 223. the class c network begins with a 110 binary. If ip is between 192 to 223 it belongs to this class. These first 3 octets are the representation of the network number in the address. Class c's were made to support small networks initially.
Answer:
C++ code explained below
Explanation:
#include<bits/stdc++.h>
#include <iostream>
using namespace std;
int FiboNR(int n)
{
int max=n+1;
int F[max];
F[0]=0;F[1]=1;
for(int i=2;i<=n;i++)
{
F[i]=F[i-1]+F[i-2];
}
return (F[n]);
}
int FiboR(int n)
{
if(n==0||n==1)
return n;
else
return (FiboR(n-1)+FiboR(n-2));
}
int main()
{
long long int i,f;
double t1,t2;
int n[]={1,5,10,15,20,25,30,35,40,45,50,55,60,65,70,75};
cout<<"Fibonacci time analysis ( recursive vs. non-recursive "<<endl;
cout<<"Integer FiboR(seconds) FiboNR(seconds) Fibo-value"<<endl;
for(i=0;i<16;i++)
{
clock_t begin = clock();
f=FiboR(n[i]);
clock_t end = clock();
t1=double(end-begin); // elapsed time in milli secons
begin = clock();
f=FiboNR(n[i]);
end = clock();
t2=double(end-begin);
cout<<n[i]<<" "<<t1*1.0/CLOCKS_PER_SEC <<" "<<t2*1.0/CLOCKS_PER_SEC <<" "<<f<<endl; //elapsed time in seconds
}
return 0;
}