You can insert a text box ~ wubba lubba dub dub!
Answer:
There is also an attachment below
Explanation:
Since we are talking about binary search, let's assume that the items are sorted according to some criteria.
Time complexity of binary search is O(logN) in worst case, best case and average case as well. That means it can search for an item in Log N time where N is size of the input. Here problem talks about the item not getting found. So, this is a worst case scenario. Even in this case, binary search runs in O(logN) time.
N = 700000000.
So, number of comparisions can be log(N) = 29.3 = 29.
So, in the worst case it does comparisions 29 times
Answer:
You don't really need the for loop to calculate B square.
The element-wise multiplication operator can help you get the square of each element of B.
B = [1, 2 3; 4, 5,6; 7,8,9];
B = B.^2;
Hope this helps!
Answer:
The Layer 4 (Transport layer)
Explanation:
The transport layer is the fourth layer of the OSI (Open Systems Interconnection) model that is responsible for transmitting data between networking devices. Some of its other functions are;
i. It maintains flow control so that the destination station does not receive more packets than it can handle or process at a particular time.
ii. it also maintains error control so that the entire message (data) sent arrives at the layer without any error due to incompleteness, loss, damage or duplication.