The sum would be 31/7, or 4.428571428571429 in decimal form.
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:TRUE!!!!!!!!!!!!!!!!!!!!!
Explanation:
Answer:
350 kHz
Explanation:
as there are 100,000 character per sec.
so, total number of bits per sec = 100,000 * n
= 100,000 * 7 = 700,000 bits per sec
= 700 kbps
Bandwidth (BW) = total no. of bits / 2
BW = 700 kbps/2
= 350 kHz