Question

Suppose you are given an array with n entries, with each entry holding a distinct number. you are told that the sequence of values a[1], a[2], …, a[n] is unimodal: for some index p between 1 and n, the values in the array entries increase up-to position p in a and then decrease the remainder of the way until position n. then find the "peak entry" p without having to read the entire array (in fact, by reading as few entries of a as possible). show how to find the entry p by reading at most o(logn) entries of a

Answer 1

vvvSuppose the population of the world is 6 billion, and that there is an average of 1000 communicating devices per person. how many bits are required to assign a unique host address to each communicating device? suppose that each device attaches to a single network and that each network on average has 10000 devices. how many bits are required to provide unique network ids to each network?