The major difference between a calculator and a computer, when performing calculations, is that a

1 answer:

4 0

a. calculator is faster but needs more human assistance.
b. calculator is slower and needs more human assistance.
c. computer is slower but needs less human assistance.
d. computer is faster but needs more human assistance.

The major difference between a calculator and a computer, when performing calculations, is that a calculator is faster but needs more human assistance. The answer is letter A.

You might be interested in

Use an ifstream object named indata to read the first three integers from a file called lottowins and write each number to stand

Gemiola [76]

Answer:

int x;

indata.open("lottowins");

indata >> x;

cout << x << endl;

indata >> x;

cout << x << endl;

indata >> x;

cout << x << endl;

indata.close();

4 0

3 years ago

a password to a certain database consists of digits that cannot be repeated. if the password is known to consist of at least 8 d

BaLLatris [955]

Answer:

$\frac{10!}{2}mins$

Explanation:

12 seconds to try one combination will be equivalent to $\frac{1}{12}\times 60 = \frac{1}{5} \ mins$

Password contain at least 8 digit i.e. password can contain 8, 9, 10 digit.

Password cannot contain more than 10 digit because it will give room for repetition which it is clearly stated that digit cannot be repeated.

Possible digit that can be used: 9,8,7,6,5,4,3,2,1,0.

Total number of passwords combination possible for each position in 8 digit.

1st position = 10, 2nd position = 9, 3rd position = 8, 4th position = 7, 5th position = 6, 6th position = 5, 7th position = 4, 8th position = 3. Total number of passwords combination possible in 8 digit is equivalent to $\frac{10!}{2}$ .

Total number of passwords combination possible for each position in 9 digit.

1st position = 10, 2nd position = 9, 3rd position = 8, 4th position = 7, 5th position = 6, 6th position = 5, 7th position = 4, 8th position = 3, 9th position = 2. Total number of passwords combination possible in 9 digit is equivalent to $\frac{10!}{1}$ .

Total number of passwords combination possible for each position in 10 digit.

1st position = 10, 2nd position = 9, 3rd position = 8, 4th position = 7, 5th position = 6, 6th position = 5, 7th position = 4, 8th position = 3, 9th position = 2, 10th position = 1. Total number of passwords combination possible in 10 digit is equivalent to 10!.

Adding them up and multiplying by $\frac{1}{5} \ mins$ to get the total number of time needed to guarantee access to database = $[\frac{10!}{2}\times\ \frac{10!}{1} \times 10!] \frac{1}{5}\ mins = \frac{10!}{2}$