Question

Which one of the following can be termed as worst case for linear search?
Element to be searched is present somewhere in the middle of the array.
Element to be searched is present at 0th index of the array.
Element to be searched is present at the last index of the array.
Element to be searched is present at the last index of the array or Element to be searched is not present in the 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?