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
The SOA is the specific record type found in every zone and contains information that identifies the sever primarily responsible for the zone as well as some operational properties for the zone.
Explanation:
The Start of Authority Records (SOA) has the following information they are
Serial Number: This number is used to find when zonal information should be replicated.
Responsible person: The Email address of a person is responsible for managing the zone.
Refresh Interval: It specifies how often a secondary DNS server tries to renew its zone information.
Retry Interval: It specifies the amount of time a secondary server waits before retrying the zone information has failed.
Expires After: IT specifies the amount of time before a secondary server considers its zone data if it can't contact with the primary server.
Minimum TTL: It specifies the default TTL value for a zone data when a TTL is not supplied.
Answer: throw your computer out of the window because to hell with this question
Explanation:
Ur answer is: a-half-inch
