Today I am going to share with you my ideas about my favourite time of the day. All time is great. It is God's gift to us to make or mar ourselves. I respect time whether in the morning, afternoon, evening, or night; I just love time.
Answer:
The program in C is as follows:
#include <stdio.h>
#include <stdlib.h>
#include <time.h>
int main(){
int dice [1000];
int count [6]={0};
srand(time(0));
for (int i = 0; i < 1000; i++) {
dice[i] = (rand() %(6)) + 1;
count[dice[i]-1]++;
}
for (int i = 0; i < 6; i++) {
printf("%d %s %d %s",(i+1)," occurs ",count[i]," times");
printf("\n");
}
return 0;
}
Explanation:
This declares an array that hold each outcome
int dice [1000];
This declares an array that holds the count of each outcome
int count [6]={0};
This lets the program generate different random numbers
srand(time(0));
This loop is repeated 1000 times
for (int i = 0; i < 1000; i++) {
This generates an outcome between 1 and 6 (inclusive)
dice[i] = (rand() %(6)) + 1;
This counts the occurrence of each outcome
count[dice[i]-1]++; }
The following prints the occurrence of each outcome
for (int i = 0; i < 6; i++) {
printf("%d %s %d %s",(i+1)," occurs ",count[i]," times");
printf("\n"); }
Answer:
An increase in revenue
Explanation:
We cannot predict how much revenue growth we are going to generate, and at what time. And hence, 2 and 3 are not an option here. Also, a TV science show has nothing to do with the quantifiable outcome of a project. And what is true is certainly that there is going to be an increase in revenue, which can certainly predict if we feel work was good and ended with good results. And hence the above option is the correct option for this question.
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.
