Answer:
Round trip times required = log2N
Explanation:
The round-trip times required before TCP can send N segments using a slow start is log2N. we can arrive at this by looking at the mode of operation of TCP which is at the 1st time of using a TCP it starts the congestion window as 1 then it sends an initial segment. When the acknowledgement of the initial segment arrives, TCP increases the congestion window to 2 and then sends 2 segments, When the 2 acknowledgements of the segments sent out arrives, they each increase the congestion window by one, thereby increasing the congestion window to 4 . therefore it takes log2N round trips before TCP can send N segments
Question 1: To tell what will happen when an if-statement is false.
Question 2: The = should be ==
elseif should be elif
The else should have a :
Question 3: All algorithms can only do number calculations.
Question 4: and
Question 5: To make a follow-up True/ False decision
Question 6: if (text1 > 15):
Question 7: if (text1 == 78):
Question 8: if (num1 != num2):
Question 9: >=
Question 10: 4
Question 11: 3
Question 18: a < b and a != b
Question 19: !=
Sorry about 12 - 17 and 20 i can't seem to find those questions guessing you wanted edhesive. I dont have an account on it.