Answer:
#include <stdlib.h>
#include <time.h>
#include <iostream>
using namespace std;
int main() {
srand(time(NULL));
cout << rand() % 30 << endl;
cout << rand() % 30 + 30 << endl;
cout << rand() % 30 + 60 << endl;
}
Explanation:
rand() returns a pseudo-random integral number in the range between 0 and RAND_MAX. By applying the modulo operator, you map that to the desired range (30 in your case), then you add an offset.
Answer: Computer generations: There was First Generation 50s,60s. 2nd 60s,70s, 3rd, 70s, Present, and 4th Future.
Computer evolutions: The first modern computer was created in the 1930s and was called the Z1, which was followed by large machinery that took up entire rooms. In the '60s, computers evolved from professional use to personal use, as the first personal computer was introduced to the public.
Explanation: This took me about 10 minutes. Enjoy.
Question Completion with Options:
a. Ill only.
b. I only.
c. II and III only.
d. I and II only.
e. Il only
f. I and Ill only.
Answer:
The best method to use to sort the array in descending order is:
e. Il only
Explanation:
The Merge Sort is similar to the Insertion Sort but, it is better with its sorting versatility. It repeatedly breaks down a list into several sub-lists until each sub-list consists of a single element and then, merging the sub-lists in a manner that results in a sorted list. The Merge Sort has been described as a "divide and conquer" technique because of how it splits a list into equal halves before combining them into a sorted whole.
Answer:
The components within the computer can get damage during travel, so he could improve the box protection with foam thingies
Explanation:
