FELLING GENEROUS GIVING AWAY POINTS:)
1 answer:
You might be interested in
Answer:
A and C
Explanation:
Option A:
In IPv6 there is a rule to reduce an IPv6 address when there are two or more consecutive segments of zeros just one time. This rule says that you can change the consecutive zeros for “::”
Here is an example
How to reduce the following IPv6 address?
ff02:0000:0000:0000:0000:0000:0000:d500
Ans: ff02::d500
Example 2:
2001:ed02:0000:0000:cf14:0000:0000:de95
Incorrect Answer -> 2001:ed02::cf14::de95
Since the rule says that you can apply “::” just one time, you need to do it for a per of zero segments, so the correct answer is:
Correct Answer -> 2001:ed02::cf14:0:0:de95
Or
2001:ed02:0:0:cf14::de95
Option C:
Since in IPv6 there are available addresses which means 340.282.366.920.938.463.463.374.607.431.768.211.456 (too many addresses), there is no need of NAT solution, so each device can have its own IP address by the same interface to have access through the internet if needed. If not, you can block the access through internet by the firewall.
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