Answer ASAP and I'll give brainliest, thanks, and five stars!
2 answers:
You might be interested in
Answer:
Total number of character comparison = 43
Explanation:
Using the Brute force algorithm
The string of n characters is known as text, and the string of m characters is known as the pattern.
From the given information:
The text (n)=THERE_IS_MORE_TO_LIFE_THAN_INCREASING_ITS_SPEED
The pattern (m) = GANDHI
The total no of characters that we have in the text = 47
The total number of characters in pattern = 6
For a brute force algorithm;
Since; the first character of the pattern does not exist in the text, then the number of trials made can be attempted can be expressed as = n – m + 1
= 47 – 6 + 1
= 47 – 5
= 42
Thus; the algorithm will attempt the trial 42 times.
Now, for loop in the algorithm to run 42 times, the G in the pattern will have to align against the for T in the text, and in the last case, it will be aligned against the last space.
On each attempted trial, the algorithm will make one unsuccessful comparison.
However, at the trial at which the G in the pattern Is aligned with the G in the text, there will be two successful comparisons.
Hence, we can calculate the total number of character comparison as follows:
Total number of character comparison =
Total number of character comparison = ( (( 42 – 1) × 1 ) + ( 1 × 2) )
Total number of character comparison = 41 + 2
Total number of character comparison = 43
Answer:
Explanation:
12 seconds to try one combination will be equivalent to
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 .
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 .
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 to get the total number of time needed to guarantee access to database =