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
Maintenance, Output requirements, Forking. This one is tricky because one would think "input", but everything that is inputted must be outputted, so they are combined. The simple model of development. It's pretty self explanatory. Communications between programmers who are working on related features. Version control is all about communication--- so this is the most logical option. Even though "The features that are currently being development.
Answer:
C) double SHA-1 is stronger because it requires about 2^(160/3) X 2^(160/3) maximum combinations because for each broken first stage, there are 2^(160/3) brute force attempts may be needed.
Explanation:
Double SHA will require about 2^(160/3) X 2^(160/3). for each statage we need to check the 2^(160/3) combinations means it will take lot of time.
What are the multiple choice answers?
