Question

Floor and ceiling given a sorted array and a value x, the ceiling of x is the smallest element in array greater than or equal to x, and the floor is the greatest element smaller than or equal to x. assume than the array is sorted in non-decreasing order. write a program to find floor and ceiling of x. example: let the input array be {1, 2, 8, 10, 10, 12, and 19} for x = 0: floor does not exist in array, ceil = 1 for x = 1: floor = 1, ceil = 1 for x = 5: floor = 2, ceil = 8 for x = 20: floor = 19, ceil does not exist in array

Answer 1

Suppose 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?