Suppose for the worst case, given input size n: algorithm 1 performs f(n) = n2 + n/2 steps algorithm 2 performs f(n) = 12n + 500 steps what is the smallest value of n for which algorithm 2 will be faster than algorithm 1?

29

Explanation:

for n=28:

Algorithm 1 performs f(n) = n2 + n/2 = 28*28 + 28/2 = 798

Algorithm 2 performs f(n) = 12*28 + 500 = 836

for n=29

Algorithm 1 performs f(n) = n2 + n/2 = 29*29 + 29/2 = 855.5

Algorithm 2 performs f(n) = 12*29 + 500 = 848

so, for n=29, algorithm 2 will be faster than algorithm 1

[A] TCP/IP, HTTP and Packet Switching

Transfer Control Protocol and Internet Protocol are the standard protocols which are used when transferring data over a network, and that data arriving to the correct destination.

Hypertext Transfer Protocol, and covers how data travels over the world wide web, such as text, images and videos.

Packet Switching, and covers how data travels across the internet after they have been broken in the small data packets of information, so that they can be reassembled when they reach he destination.