Advantages of ASCII over EBDCDIC
1 answer:
You might be interested in
Answer:
--- True
--- False
--- True
Explanation:
Required
Determine if the statements are true or not.
To do this, we convert DE from base 16 to base 10 using product rule.
So, we have:
In hexadecimal.
So, we have:
Hence:
(a) is true
First, convert D7 to base 10 using product rule
So, we have:
Next convert 215 to base 2, using division rule
Write the remainders from bottom to top.
<em>Hence (b) is false</em>
Convert 13 to base 10 using product rule
Hence; (c) is true
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