Answer:
Network based coverages are LAN, WAN, MAN and WLAN
Any u just get the pointer and hilight it then u paste
Answer:
// here is code in c.
#include <stdio.h>
// main function
int main()
{
// variable to store year
int year;
printf("enter year:");
// read the year
scanf("%d",&year);
// if year>=2101
if(year>=2101)
{
printf("Distant future");
}
//if year in 2001-2100
else if(year>=2001&&year<=2100)
{
printf("21st century");
}
//if year in 19011-2000
else if(year>=1901&&year<=2000)
{
printf("20th century");
}
// if year<=1900
else if(year<=1900)
{
printf("Long ago");
}
return 0;
}
Explanation:
Read the year from user.After this, check if year is greater or equal to 2101 then print "Distant future".If year is in between 2001-2100 then print "21st century".If year is in between 1901-2000 then print "20th century".Else if year is less or equal to 1900 then print "Long ago".
Output:
enter year:2018
21st century
Wiki is short for Wikipedia and if someone on wiki leaks some personal information or something not to be released yet, that would be a wiki leak
Answer:
B. R is NP Hard
Explanation:
Given:
S is an NP complete problem
Q is not known to be in NP
R is not known to be in NP
Q is polynomial times reducible to S
S is polynomial times reducible to R
Solution:
NP complete problem has to be in both NP and NP-hard. A problem is NP hard if all problems in NP are polynomial time reducible to it.
Option B is correct because as given in the question S is an NP complete problem and S is polynomial times reducible to R.
Option A is not correct because R is not known to be in NP
Option C is not correct because Q is also not known to be in NP
Option D is not correct because Q because no NP-complete problem is polynomial time reducible to Q.
