A computer has __________processing device

If all the character pairs match after processing both strings, one string in stack and the other in queue, then this means one string is the reverse of the other.

Explanation:

Lets take an example of two strings abc and cba which are reverse of each other.

string1 = abc

string2 = cba

Now push the characters of string1 in stack. Stack is a LIFO (last in first out) data structure which means the character pushed in the last in stack is popped first.

Push abc each character on a stack in the following order.

c

b

a

Now add each character of string2 in queue. Queue is a FIFO (first in first out) data structure which means the character inserted first is removed first.

Insert cba each character on a stack in the following order.

a b c

First c is added to queue then b and then a.

Now lets pop one character from the stack and remove one character from queue and compare each pair of characters of both the strings to each other.

First from stack c is popped as per LIFO and c is removed from queue as per FIFO. Then these two characters are compared. They both match

c=c. Next b is popped from stack and b is removed from queue and these characters match too. At the end a is popped from the stack and a is removed from queue and they both are compared. They too match which shows that string1 and string2 which are reverse of each other are matched.

6 0

3 years ago

⦁ Consider transferring an enormous file of L bytes from Host A to Host B. Assume an MSS of 536 bytes. ⦁ What is the maximum val

timurjin [86]

Answer:

a) There are approximately 2^32 = 4,294,967,296 possible number of the sequence. This number of the sequence does not increase by one with every number of sequences but by byte number of data transferred. Therefore, the MSS size is insignificant. Thus, it can be inferred that the maximum L value is representable by 2^32 ≈ 4.19 Gbytes.

b) ceil(2^32 / 536) = 8,012,999

The segment number is 66 bytes of header joined to every segment to get a cumulative sum of 528,857,934 bytes of header. Therefore, overall number of bytes sent will be 2^32 + 528,857,934 = 4.824 × 10^9 bytes. Thus, we can conclude that the total time taken to send the file will be 249 seconds over a 155~Mbps link.

Explanation:

a) There are approximately 2^32 = 4,294,967,296 possible number of the sequence. This number of the sequence does not increase by one with every number of sequences but by byte number of data transferred. Therefore, the MSS size is insignificant. Thus, it can be inferred that the maximum L value is representable by 2^32 ≈ 4.19 Gbytes.

b) ceil(2^32 / 536) = 8,012,999

The segment number is 66 bytes of header joined to every segment to get a cumulative sum of 528,857,934 bytes of header. Therefore, overall number of bytes sent will be 2^32 + 528,857,934 = 4.824 × 10^9 bytes. Thus, we can conclude that the total time taken to send the file will be 249 seconds over a 155~Mbps link.

8 0

2 years ago