Answer:
what issue do you think are important in our life
Answer:
More space
Pen drives generally have more storage capacity than CDs with CDs usually having just around 700 Megabytes for storage. Pen drives on the other hand can reach up to 2 Terabytes of data storage capacity. If the file she needs to save is high, Elsa should use the pen drive.
Scratch resistant
CDs can be scratched on the way to the house and lose some data or make it harder to extract. Pen drives do not have such problems are they are encased in an outer casing.
Portable and Accessible.
Pen drives are easy to carry which makes them portable and they are easier to use because a lot of computers do not have a CD drive but every computer has a port for a pen drive therefore making data in pen drives more accessible.
Answer: The response that is expected when it broadcast an ARP request is one or zero.
Explanation: ARP request means Address Resolution Protocol which is a protocol responsible for the mapping of the IP(Internet protocol)address of a system to the MAC(Media Access Control) layer. Only one response is received only if the IP address is present in the ARP otherwise if the IP address does not matches then no response is returned.Thus only one or zero response can be received when a ARP request is process.
Answer:
D.Custom
Explanation:
When you select Custom installation, all Compulsory subcomponents and products are installed, but the Optional and Recommended sub-components and components can be installed selectively on a product-by-product basis for the licenses selected at install time. It also provides the feature to store it in your desirable disk in the hard drive.
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;
}
