Answer:
C. Must be respected if we are to function as complete, self-governing agents.
Explanation:
<em>Privacy</em> is the boundaries that are set up to protect us against unwanted intrusion or interference, and it forms the basis of our interaction with the world.
<em>Privacy laws</em> are set-up to protect individuals from unwanted and unapproved access to privacy by individuals, organizations, and government. This is greatly adhered to in many countries.
To some extent, privacy is considered to overlap with security, because, when private information such as social security number, bank card details, account names, and details, etc. are accessed inappropriately, the individual's security is greatly compromised.
Therefore, privacy must be greatly respected if we are to function as complete, self-governing agents.
The statement which is true about storage media is "Cache memory is much faster than Magnetic disk storage. But it is much expensive than magnetic disks."
The cache memory is faster than both SDDs and HDDs. In mathematical terms, it is 4 time faster than SSDs and 80 times faster than HDDs. Moreover, it is more expensive then the SSDs and HDDs storage. Practically speaking, it is not good to have as much in-memory storage as persistent block storage on SSDs or HDDs.
The remaining statements are incorrect such as "Cost per bit in SSDs is lower than that of a Magnetic tapes". While truth be told the SSD cost more than the Magnetic Tapes.
Magnetic disk storage is faster than SSD storage and hence it is a good candidate for a database that needs faster access time. The statement is also incorrect as SSD are much faster than Magnetic Disk Storage.
Learn more in: brainly.com/question/25026748
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;
}
#1 is A and #2 is B, but I don't know about #3 and #4.
Answer:
Option a is the correct answer for the above question.
Explanation:
- The above question asked about the order of the result which is derived from the above query. The above query holds an order by clause in desc order which is used to produce the result in descending order.
- The descending order result is produced on the behalf of balance_due attributes and the option a also states the same. Hence option a is correct while the other is not because:-
- Other is not states that the result is produced on the behalf of descending order.
